Test sets generation from algebraic specifications using logic programming
Journal of Systems and Software
Synthesis of test experiments in some classes of automata
Automatic Control and Computer Sciences
Software testing based on formal specifications: a theory and a tool
Software Engineering Journal
Selecting test sequences for partially-specified nondeterministic finite state machines
IWPTS '94 7th IFIP WG 6.1 international workshop on Protocol test systems
On Minimizing the Lengths of Checking Sequences
IEEE Transactions on Computers
Testing deterministic implementations from nondeterministic FSM specifications
Selected proceedings of the IFIP TC6 9th international workshop on Testing of communicating systems
IEEE Transactions on Software Engineering
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Nondeterministic State Machines in Protocol Conformance Testing
Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems VI
Casl User Manual: Introduction to Using the Common Algebraic Specification Language Casl (Lecture Notes in Computer Science, 2900)
Casl Reference Manual: The Complete Documentation Of The Common Algebraic Specification Language (LECTURE NOTES IN COMPUTER SCIENCE)
Testing from a Nondeterministic Finite State Machine Using Adaptive State Counting
IEEE Transactions on Computers
Testing from Partial Deterministic FSM Specifications
IEEE Transactions on Computers
Optimizing the Length of Checking Sequences
IEEE Transactions on Computers
Test Synthesis from UML Models of Distributed Software
IEEE Transactions on Software Engineering
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
Fault detecting experiments for sequential circuits
SWCT '64 Proceedings of the 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
A logic for assessing sets of heterogeneous testing hypotheses
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
From U2TP models to executable tests with TTCN-3 - an approach to model driven testing -
TestCom'05 Proceedings of the 17th IFIP TC6/WG 6.1 international conference on Testing of Communicating Systems
Research: Construction of checking sequences based on characterization sets
Computer Communications
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Hi-index | 0.00 |
In state-based testing, it is common to include verdicts within test cases, the result of the test case being the verdict reached by the test run. In addition, approaches that reason about test effectiveness or produce tests that are guaranteed to find certain classes of faults are often based on either a fault domain or a set of test hypotheses. This article considers how the presence of a fault domain or test hypotheses affects our notion of a test verdict. The analysis reveals the need for new verdicts that provide more information than the current verdicts and for verdict functions that return a verdict based on a set of test runs rather than a single test run. The concepts are illustrated in the contexts of testing from a nondeterministic finite state machine and the testing of a datatype specified using an algebraic specification language but are potentially relevant whenever fault domains or test hypotheses are used.