Formal Methods for Protocol Testing: A Detailed Study
IEEE Transactions on Software Engineering
Software testing techniques (2nd ed.)
Software testing techniques (2nd ed.)
Introduction to algorithms
The complexity of stochastic games
Information and Computation
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
Distinguishing tests for nondeterministic and probabilistic machines
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Evolving algebras 1993: Lipari guide
Specification and validation methods
Competitive Markov decision processes
Competitive Markov decision processes
An experiment in automatic generation of test suites for protocols with verification technology
Science of Computer Programming - Special issue on COST 247, verification and validation methods for formal descriptions
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Generating finite state machines from abstract state machines
ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
IEEE Transactions on Software Engineering
Testing Probabilistic and Nondeterministic Processes
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Testing Non-Deterministic State Machines with Fault Coverage
Proceedings of the IFIP TC6/WG6.1 Fourth International Workshop on Protocol Test Systems IV
Testing transition systems: an annotated bibliography
Modeling and verification of parallel processes
Runtime verification of .NET contracts
Journal of Systems and Software - Special issue on: Component-based software engineering
Experiments with test case generation and runtime analysis
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
Online testing with model programs
Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
QSIC '05 Proceedings of the Fifth International Conference on Quality Software
Automated testing of stochastic systems: a statistically grounded approach
Proceedings of the 2006 international symposium on Software testing and analysis
Adaptive software testing with fixed-memory feedback
Journal of Systems and Software
Testing randomized software by means of statistical hypothesis tests
Fourth international workshop on Software quality assurance: in conjunction with the 6th ESEC/FSE joint meeting
Synthesis of test purpose directed reactive planning tester for nondeterministic systems
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Testing challenges for extending SQL server's query processor: a case study
Proceedings of the 1st international workshop on Testing database systems
On the synthesis of adaptive tests for nondeterministic finite state machines
Programming and Computing Software
Synthesizing Test Models from Test Cases
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Choosing a test modeling language: a survey
HVC'06 Proceedings of the 2nd international Haifa verification conference on Hardware and software, verification and testing
Automatic testing from formal specifications
TAP'07 Proceedings of the 1st international conference on Tests and proofs
Model-based testing of object-oriented reactive systems with spec explorer
Formal methods and testing
Synthesis of on-line planning tester for non-deterministic EFSM models
TAIC PART'10 Proceedings of the 5th international academic and industrial conference on Testing - practice and research techniques
Adaptive testing of deterministic implementations specified by nondeterministic FSMs
ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
Testing concurrent object-oriented systems with spec explorer
FM'05 Proceedings of the 2005 international conference on Formal Methods
A semantic framework for test coverage
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
Conformance tests as checking experiments for partial nondeterministic FSM
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
Testing systems of concurrent black-boxes—an automata-theoretic and decompositional approach
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
An orchestrated survey of methodologies for automated software test case generation
Journal of Systems and Software
Hi-index | 0.02 |
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: states and choice points. Choice points represent the nondeterministic behaviour of the implementation under test (IUT). Edges represent transitions. They have costs and probabilities. Test case generation in this setting amounts to generation of a game strategy. The two players are the testing tool (TT) and the IUT. The game explores the graph. The TT leads the IUT by selecting an edge at the state vertices. At the choice points the control goes to the IUT. A game strategy decides which edge should be taken by the TT in each state. This paper presents three novel algorithms 1) to determine an optimal strategy for the bounded reachability game, where optimality means maximizing the probability to reach any of the given final states from a given start state while at the same time minimizing the costs of traversal; 2) to determine a winning strategy for the bounded reachability game, which guarantees that given final vertices are reached, regardless how the IUT reacts; 3) to determine a fast converging edge covering strategy, which guarantees that the probability to cover all edges quickly converges to 1 if TT follows the strategy.