Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Generation of complete test suites from Mealy input/output transition systems
Paiva S., Simao A. Formal Aspects of Computing28 (1):65-78,2016.Type:Article
Date Reviewed: Jul 15 2016

The ever-increasing complexity of systems has motivated research in methodologies like model-based design (MBD) for managing and controlling the complexity of system development. MBD raises the level of abstraction of languages for specifying, designing, and implementing systems. MBD is supported by tools and techniques for automating steps in a development cycle.

Various forms of state machines have been proposed for specifying systems over the years, and there has been extensive research in algorithms to formally analyze state machines and automatically generate test cases to drive verification and validation processes.

This paper addresses a gap in the spectrum of research in test generation from state machines--and in particular input/output transition systems (IOTSs). IOTSs are asynchronous and help capture fine-grained interactions between I/O actions in a system. This is important as it may be difficult and even impossible to maintain a synchronous view of the system for verifying real-time and physical systems where the robustness of the system to the asynchronous nature of cause and effect is exactly what needs to be verified.

Early work in test generation [1] for IOTSs suffers from being stochastic in nature, and did not provide strong guarantees of finite and deterministic execution time for complete verification in the presence of uncontrolled asynchrony. However, imposing restrictions on asynchrony and considering Mealy IOTSs allows existing algorithms for synchronous finite-state machines to be used for test generation and to obtain completeness guarantees. A number of contemporary research efforts [2] address the same problem using slightly different hypotheses.

This area of research seems ripe for the systematization and rationalization of the different formalisms and algorithms to clarify tradeoffs and help practitioners select particular formalisms and algorithms for their applications.

Reviewer:  Prahladavaradan Sampath Review #: CR144589 (1611-0830)
1) Tretmans, J. Test generation with inputs, outputs and repetitive quiescence. Software Concepts Tools 17, 3(1996), 103–120.
2) Simao, A.; Petrenko, A. Generating complete and finite test suite for ioco: Is it possible?. In Proc. of the 9th Workshop on Model-based Testing. Schlingloff, H., Petrenko, A., Eds. EPTCS, 2014, 56–70.
Bookmark and Share
 
Specifying And Verifying And Reasoning About Programs (F.3.1 )
 
 
Model Validation And Analysis (I.6.4 )
 
 
Process Management (D.4.1 )
 
Would you recommend this review?
yes
no
Other reviews under "Specifying And Verifying And Reasoning About Programs": Date
Programming: the derivation of algorithms
Kaldewaij A., Prentice-Hall, Inc., Upper Saddle River, NJ, 1990. Type: Book (9780132041089)
Aug 1 1991
An introduction to programming with specifications
Kubiak R., Rudziński R., Sokolowski S., Academic Press Prof., Inc., San Diego, CA, 1991. Type: Book (9780124276208)
Jun 1 1992
Observational implementation of algebraic specifications
Hennicker R. Acta Informatica 28(3): 187-230, 1991. Type: Article
Jul 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy