Article

Generating finite state machines from abstract state machines

Authors:

Wolfgang Grieskamp,

Wolfram Schulte,

Margus VeanesAuthors Info & Claims

ISSTA '02: Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis

Pages 112 - 122

https://doi.org/10.1145/566172.566190

Published: 01 July 2002 Publication History

Abstract

We give an algorithm that derives a finite state machine (FSM) from a given abstract state machine (ASM) specification. This allows us to integrate ASM specs with the existing tools for test case generation from FSMs. ASM specs are executable but have typically too many, often infinitely many states. We group ASM states into finitely many hyperstates which are the nodes of the FSM. The links of the FSM are induced by the ASM state transitions.

References

[1]

Boris Beizer. Software Testing Techniques. Van Nostrand Reinhold, New York, second edition, 1990.]]

Digital Library

[2]

G. V. Bochmann and A. Petrenko. Protocol testing: review of methods and relevance for software testing. In Proceedings of the 1994 international symposium on Software testing and analysis, pages 109-124, 1994.]]

Digital Library

[3]

C. Bourhr, R. Dssouli, and E. M. Aboulhamid. Automatic test generation for EFSM-based systems. Publication departementale 1043, Departement IRO, Uni- versite de Montreal, August 1996.]]

[4]

E. Brinksma and J. Tretmans. Testing Transition Systems: An Annotated Bibliography. In F. Cassez, C. Jard, B. Rozoy, and M. Ryan, editors, Summer School MOVEP'2k Modelling and Verication of Parallel Processes, pp. 44-50, Nantes, July 2000.]]

Digital Library

[5]

I. B. Burdonov, A. S. Kossatchev, and V. V. Kulyamin. Application of finite automatons for program testing. Programming and Computer Software, 26(2):61-73, 2000.]]

[6]

I. B. Burdonov, A. S. Kossatchev, A. Petrenko, and D. Galter. Kvest: Automated generation of test suites from formal specications. In J. Wing, J. Woodcock, and J. Davies, editors, FM'99, Vol. I, volume 1708 of Lecture Notes in Computer Science, pages 608-621. Springer, 1999.]]

Digital Library

[7]

K.-T. Cheng and A. S. Krishnakumar. Automatic generation of functional vectors using the extended finite state machine model. ACM Transcations on Design Automation of Electronic Systems, 1(1):57-79, January 1996.]]

Digital Library

[8]

E. M. Clarke, Jr., O. Grumberg and D. A. Peled, Model Checking, MIT Press, 1999.]]

Digital Library

[9]

P. Cousot and R. Cousot. Abstract Interpretation Based Program Testing, Proceedings of the SSGRR 2000 Computer & eBusiness International Conference, Compact disk paper 248, L'Aquila, Italy, July 31 - August 6, 2000.]]

[10]

R. G. de Vries and J. Tretmans. On-the-fly conformance testing using Spin. Software Tools for Technology Transfer, 2(4):382{393, March 2000.]]

[11]

J. Dick and A. Faivre. Automating the generation and sequencing of test cases from model-based specifications. In Proc. FME'93, LNCS 670, p. 268-284, Springer, 1993.]]

Digital Library

[12]

J. C. Fernandez, C. Jard, T. Jéron, and C. Viho. An experiment in automatic generation of test suites for protocols with verification technology. Science of Computer Programming-Special Issue on COST247, Verification and Validation Methods for Formal Descriptions, 29(1-2):123-146, 1997.]]

Digital Library

[13]

Foundations of Software Engineering, Microsoft Research. Abstract state machine Language, Website: http://research.microsoft.com/fse/AsmL]]

[14]

A. Gargantini and E. Riccobene, ASM-based Testing: Coverage Criteria and Automatic Test Sequence Generation, J. of Universal Computer Science, 7(11):1050-1067, 2001.]]

[15]

U. Glässer, Y. Gurevich and M. Veanes, High-Level Executable Specification of the Universal Plug and Play Architecture, In Proc. of the Thirty-Fifth Annual Hawaii International Conference on System Sciences, IEEE, 2002.]]

Digital Library

[16]

U. Glässer, Y. Gurevich and M. Veanes, Universal Plug and Play Machine Models, Microsoft Research, Technical Report MSR-TR-2001-59, June, 2001.]]

[17]

J. Gross and J. Yellen. Graph Theory and its Applications. CRC, Boca Raton, 1999.]]

Digital Library

[18]

Y. Gurevich. Evolving algebra 1993: Lipari guide. In Egon Boerger, editor, Specification and Validation Methods, pages 9-36. Oxford University Press, 1995.]]

Digital Library

[19]

Yuri Gurevich. Sequential Abstract State Machines capture Sequential Algorithms, ACM Transactions on Computational Logic, Volume 1, Number 1 (July 2000), pages 77-111]]

Digital Library

[20]

S. Helke, T. Neustupny, and T. Santen. Automating test case generation from Z specifications with Isabelle. In Proc. ZUM97, LNCS 1212, p. 52-71, Springer, 1997.]]

Digital Library

[21]

G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, Englewood Cliffs, NJ, 1991.]]

Digital Library

[22]

D. Lee and M. Yannakakis. Principles and methods of testing finite state machines - a survey. In Proceedings of the IEEE, volume 84, number 8, pages 1090-1123, Berlin, Aug 1996. IEEE Computer Society Press.]]

[23]

R. J. Linn and M. Ü. Uyar. Conformance Testing Methodologies and Architectures for OSI Protocols. IEEE Computer Society Press, Los Alamitos, CA, 1994.]]

Digital Library

[24]

Y. V. Matiyasevich. Hilbert's Tenth Problem. MIT Press, 1993.]]

Digital Library

[25]

A. Petrenko. Fault model-driven test derivation from finite state models: Annotated bibliography. In Proceedings of the Summer School MOVEP2000, Modelling and Verification of Parallel Processes, 2000. Appears in LNCS.]]

Digital Library

[26]

Universal Plug and Play Forum. Website: http://www.upnp.org]]

[27]

H. Robinson. Model-Based Testing. Website: http://www.geocities.com/model_based_testing/]]

[28]

Deepinder P. Sidhu and Ting-Kau Leung. Formal methods for protocol testing: A detailed study. IEEE Transactions on Software Engineering, 15(4):413-426, April 1989.]]

Digital Library

[29]

H. Thimbleby. An algorithm for the directed Chinese Postman Problem (with applications). Technical report, Middlesex University School of Computing Science, London, 2000.]]

[30]

J. Tretmans and A. Belinfante. Automatic testing with formal methods. In EuroSTAR'99: 7th European Int. Conference on Software Testing, Analysis & Review, Barcelona, Spain, November pp. 8-12, 1999. EuroStar Conferences, Galway, Ireland.]]

[31]

C. D. Turner and D. J. Robson. The state-based testing of object-oriented programs. In Proc. IEEE Conf. Software Maintenance, pp. 302-310, 1993.]]

Digital Library

Cited By

Türker UHierons REl-Fakih KMousavi MTyukin I(2024)Accelerating Finite State Machine-Based Testing Using Reinforcement LearningIEEE Transactions on Software Engineering10.1109/TSE.2024.335841650:3(574-597)Online publication date: Mar-2024
https://doi.org/10.1109/TSE.2024.3358416
Tung LTran HLe KHung P(2022)An automated test data generation method for void pointers and function pointers in C/C++ libraries and embedded projectsInformation and Software Technology10.1016/j.infsof.2022.106821145:COnline publication date: 1-May-2022
https://dl.acm.org/doi/10.1016/j.infsof.2022.106821
Godoy JGaleotti JGarbervetsky DUchitel S(2021)Enabledness-based Testing of Object ProtocolsACM Transactions on Software Engineering and Methodology10.1145/341515330:2(1-36)Online publication date: 3-Jan-2021
https://dl.acm.org/doi/10.1145/3415153
Show More Cited By

Recommendations

Generating finite state machines from abstract state machines

We give an algorithm that derives a finite state machine (FSM) from a given abstract state machine (ASM) specification. This allows us to integrate ASM specs with the existing tools for test case generation from FSMs. ASM specs are executable but have ...
Canonical finite state machines for distributed systems

There has been much interest in testing from finite state machines (FSMs) as a result of their suitability for modelling or specifying state-based systems. Where there are multiple ports/interfaces a multi-port FSM is used and in testing, a tester is ...
Mutation Analysis for Testing Finite State Machines
ISECS '09: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01

Mutation analysis is a program testing method which seeds a fault in a program and tries to identify it with test data, thus promoting the test efficiency. The paper investigates the application of mutation analysis in model-based testing for the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ISSTA '02: Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis

July 2002

248 pages

ISBN:1581135629

DOI:10.1145/566172

Program Chair:
Phyllis G. Frankl

ACM SIGSOFT Software Engineering Notes Volume 27, Issue 4
July 2002
242 pages
ISSN:0163-5948
DOI:10.1145/566171
Issue’s Table of Contents

Copyright © 2002 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGSOFT: ACM Special Interest Group on Software Engineering

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

ISSTA02

Sponsor:

SIGSOFT

ISSTA02: International Symposium on Software Testing and Analysis ( co-located with WOSP 2002)

July 22 - 24, 2002

Roma, Italy

Acceptance Rates

ISSTA '02 Paper Acceptance Rate 26 of 97 submissions, 27%;

Overall Acceptance Rate 58 of 213 submissions, 27%

Upcoming Conference

ISSTA '25

Sponsor:
sigsoft

34th ACM SIGSOFT International Symposium on Software Testing and Analysis

June 25 - 28, 2025

Trondheim , Norway

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

142
Total Citations
View Citations
2,153
Total Downloads

Downloads (Last 12 months)45
Downloads (Last 6 weeks)2

Reflects downloads up to 15 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Türker UHierons REl-Fakih KMousavi MTyukin I(2024)Accelerating Finite State Machine-Based Testing Using Reinforcement LearningIEEE Transactions on Software Engineering10.1109/TSE.2024.335841650:3(574-597)Online publication date: Mar-2024
https://doi.org/10.1109/TSE.2024.3358416
Tung LTran HLe KHung P(2022)An automated test data generation method for void pointers and function pointers in C/C++ libraries and embedded projectsInformation and Software Technology10.1016/j.infsof.2022.106821145:COnline publication date: 1-May-2022
https://dl.acm.org/doi/10.1016/j.infsof.2022.106821
Godoy JGaleotti JGarbervetsky DUchitel S(2021)Enabledness-based Testing of Object ProtocolsACM Transactions on Software Engineering and Methodology10.1145/341515330:2(1-36)Online publication date: 3-Jan-2021
https://dl.acm.org/doi/10.1145/3415153
Ji SLee SYoo SSuh IKwon IPark FLee SKim H(2021)Learning-Based Automation of Robotic Assembly for Smart ManufacturingProceedings of the IEEE10.1109/JPROC.2021.3063154109:4(423-440)Online publication date: Apr-2021
https://doi.org/10.1109/JPROC.2021.3063154
Ferrarotti FPichler JMoser MBuchgeher G(2019)Extracting High-Level System Specifications from Source Code via Abstract State MachinesModel and Data Engineering10.1007/978-3-030-32065-2_19(267-283)Online publication date: 21-Oct-2019
https://doi.org/10.1007/978-3-030-32065-2_19
Julliand JKouchnarenko OMasson PVoiron G(2018)Test Generation from Event System Abstractions to Cover Their States and TransitionsProgramming and Computing Software10.1134/S036176881801008544:1(1-14)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1134/S0361768818010085
Julliand JKouchnarenko OMasson PVoiron G(2018)Under-Approximation Generation Driven by Relevance Predicates and VariantsTests and Proofs10.1007/978-3-319-92994-1_4(63-82)Online publication date: 2-Jun-2018
https://doi.org/10.1007/978-3-319-92994-1_4
Julliand JKouchnarenko OMasson PVoiron G(2018)Approximating Event System Abstractions by Covering Their States and TransitionsPerspectives of System Informatics10.1007/978-3-319-74313-4_16(211-226)Online publication date: 18-Jan-2018
https://doi.org/10.1007/978-3-319-74313-4_16
Julliand JKouchnarenko OMasson PVoiron G(2017)Two under-approximation techniques for 3-modal abstraction coverage of event systems: Joint effort?2017 International Symposium on Theoretical Aspects of Software Engineering (TASE)10.1109/TASE.2017.8285632(1-8)Online publication date: Sep-2017
https://doi.org/10.1109/TASE.2017.8285632
Fragal VSimao AEndo AMousavi M(2017)Reducing the Concretization Effort in FSM-Based Testing of Software Product Lines2017 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)10.1109/ICSTW.2017.61(329-336)Online publication date: Mar-2017
https://doi.org/10.1109/ICSTW.2017.61
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents