Symbolic verification and test generation for a network of communicating FSMs

Authors:
Xiaoqing Jin;Gianfranco Ciardo;Tae-Hyong Kim;Yang Zhao
Affiliations:
University of California, Riverside;University of California, Riverside;Kumoh National Institute of Technology, Gumi, Korea;University of California, Riverside
Venue:
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Year:
2011

Citing 8
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Computer Networks

Computer Networks
Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized Wp-Method

IEEE Transactions on Software Engineering
Using Edge-Valued Decision Diagrams for Symbolic Generation of Shortest Paths

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Automatic Test Generation from Communicating Extended Finite State Machine (CEFSM)-Based Models

ISORC '02 Proceedings of the Fifth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
The saturation algorithm for symbolic state-space exploration

International Journal on Software Tools for Technology Transfer (STTT) - Special section on Tools and Algorithms for the Construction and Analysis of Systems
Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Foundations of Software Testing

Foundations of Software Testing

Quantified Score

Hi-index	0.09

Visualization

Abstract

A network of communicating FSMs (NCFSMs) is a useful formalism to model complex concurrent systems, but its use demands efficient analysis algorithms. We propose a new symbolic framework for NCFMS verification and test generation. We explore the use of the breadth-first search (BFS) and saturation algorithms to compute the "unstable transitive closure" of transitions for the observable product machine of an NCFSM. Our framework can verify properties such as livelock freeness and includes a fully automatic test generation based on mutation analysis. Being symbolic, our framework can efficiently manage a large number of mutants with moderate resource consumption and derive a test suite to distinguish all non-equivalent first-order mutants.