Test Selection Based on Finite State Models
IEEE Transactions on Software Engineering
Protocol testing: review of methods and relevance for software testing
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
Testing deterministic implementations from nondeterministic FSM specifications
Selected proceedings of the IFIP TC6 9th international workshop on Testing of communicating systems
Communication and Concurrency
Automata, Languages, and Machines
Automata, Languages, and Machines
IEEE Transactions on Software Engineering
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
An Improved Failures Model for Communicating Processes
Seminar on Concurrency, Carnegie-Mellon University
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
Hi-index | 0.00 |
The paper formalizes two types of refinement for finite state machines: OR refinement and p-OR refinement. For each such type of refinement, it shows that, if the implementation is also constructed through a process of refinement, then the application of Chow's W test generation method can be distributed into smaller chunks, thus diminishing the effort devoted to testing and the size of the final test set.