Testing deterministic implementations from nondeterministic FSM specifications
Selected proceedings of the IFIP TC6 9th international workshop on Testing of communicating systems
Software unit test coverage and adequacy
ACM Computing Surveys (CSUR)
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Testing Finite-State Machines: State Identification and Verification
IEEE Transactions on Computers
The Linear Time-Branching Time Spectrum (Extended Abstract)
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Automated Boundary Testing from Z and B
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Testing Non-Deterministic State Machines with Fault Coverage
Proceedings of the IFIP TC6/WG6.1 Fourth International Workshop on Protocol Test Systems IV
A Modal Characterisation of Observable Machine-Behaviour
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case
Programming and Computing Software
The UniTesK Approach to Designing Test Suites
Programming and Computing Software
Irredundant Algorithms for Traversing Directed Graphs: The Nondeterministic Case
Programming and Computing Software
Traversal of an Unknown Directed Graph by a Finite Robot
Programming and Computing Software
Backtracking Problem in the Traversal of an Unknown Directed Graph by a Finite Robot
Programming and Computing Software
Formalization of test experiments
Programming and Computing Software
Interaction semantics with refusals, divergence, and destruction
Programming and Computing Software
Hi-index | 0.00 |
An approach to the problem of complete testing is proposed. Testing is interpreted as the check of an implementation's conformance to the given requirements described by a specification. The completeness means that a test suite finds all the possible implementation errors. In practice, testing must end in a finite amount of time. In the general case, the requirements of completeness and finiteness contradict each other. However, finite complete test suites can be constructed for certain classes of implementations and specifications provided that there are specific test capabilities. Test algorithms are proposed for finite specifications and finite implementations with limited nondeterminism for the case of open-state testing. The complexity of those algorithms is estimated.