Refinement in Finite State Machine Testing

Authors:
Florentin Ipate;Tudor Bălănescu
Affiliations:
Department of Computer Science and Mathematics, University of Pitesti, Romania. fipate@ifsoft.ro;Department of Computer Science and Mathematics, University of Pitesti, Romania. fipate@ifsoft.ro (Corresp.)
Venue:
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Year:
2004

Citing 6
Cited 0

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

Communication and Concurrency
Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized Wp-Method

IEEE Transactions on Software Engineering
An Improved Failures Model for Communicating Processes

Seminar on Concurrency, Carnegie-Mellon University

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.