Algebraic theory of processes
Software testing based on formal specifications: a theory and a tool
Software Engineering Journal
Comparing test sets and criteria in the presence of test hypotheses and fault domains
ACM Transactions on Software Engineering and Methodology (TOSEM)
Fault Model-Driven Test Derivation from Finite State Models: Annotated Bibliography
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Testing Concurrent Systems: A Formal Approach
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Testing transition systems: an annotated bibliography
Modeling and verification of parallel processes
Prioritizing JUnit Test Cases: An Empirical Assessment and Cost-Benefits Analysis
Empirical Software Engineering
Specification, testing and implementation relations for symbolic-probabilistic systems
Theoretical Computer Science
Extending EFSMs to Specify and Test Timed Systems with Action Durations and Time-Outs
IEEE Transactions on Computers
Verdict functions in testing with a fault domain or test hypotheses
ACM Transactions on Software Engineering and Methodology (TOSEM)
A testing scenario for probabilistic automata
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Symbolic execution techniques for test purpose definition
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
A preliminary general testing method based on genetic algorithms
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
Formal passive testing of timed systems: theory and tools
Software Testing, Verification & Reliability
A formal framework to test soft and hard deadlines in timed systems
Software Testing, Verification & Reliability
A formal framework for software product lines
Information and Software Technology
| Hi-index | 0.00 |
We present a general framework allowing to classify testing problems into five testability classes. Classes differ in the number of tests we must apply to precisely determine whether the system is correct or not. The conditions that enable/disable finite testability are analyzed. A general method to reduce a testing problem into another is presented. The complexity of finding complete test suites and measuring the suitability of incomplete suites is analyzed.