Acceptance testing

Summary

In engineering and its various subdisciplines, acceptance testing is a test conducted to determine if the requirements of a specification or contract are met. It may involve chemical tests, physical tests, or performance tests. In systems engineering, it may involve black-box testing performed on a system (for example: a piece of software, lots of manufactured mechanical parts, or batches of chemical products) prior to its delivery. In software testing, the ISTQB defines acceptance testing as: Formal testing with respect to user needs, requirements, and business processes conducted to determine whether a system satisfies the acceptance criteria and to enable the user, customers or other authorized entity to determine whether to accept the system. Acceptance testing is also known as user acceptance testing (UAT), end-user testing, operational acceptance testing (OAT), acceptance test-driven development (ATDD) or field (acceptance) testing. Acceptance criteria are the criteria that a

Official source

https://en.wikipedia.org/wiki/Acceptance_testing

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (38)

Related publications

Related people (1)

Related people

Related units (1)

Related units

Related concepts (20)

Related concepts

Related courses (6)

Related courses

Related lectures (12)

Related lectures

Minimizing Generalized Buchi Automata

Sudeep Juvekar

We consider the problem of minimization of generalized Buchi automata. We show how to extend fair simulation and delayed simulation to the case where the Buchi automaton has multiple acceptance conditions. For fair simulation, we show how to efficiently compute the fair-simulation relation while maintaining the structure of the automaton. We then use the fair-simulation relation to merge states and remove transitions. Our fair-simulation algorithm works in time

O(mn^2k^2)

where

m

is the number of transitions,

n

is the number of states, and

k

is the number of acceptance sets. For delayed simulation, we extend the existing definition to the case of multiple acceptance condition. We show that our definition can indeed be used for minimization and give an algorithm that computes the delayed-simulation relation. Our delayed-simulation algorithm works in time

O(mn^2k)

. We implemented the two algorithms and report on experimental results.

2005

Acceptance testing

Supporting Loop Proofs in KeY by using BLAST

Minimizing Generalized Buchi Automata

Supporting Loop Proofs in KeY by using BLAST

Minimizing Generalized Buchi Automata