2012 Sixth International Symposium on Theoretical Aspects of Software Engineering (2012)
Beijing, China China
July 4, 2012 to July 6, 2012
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TASE.2012.38
The Extended Finite State Machine (EFSM) is a commonly used model for specifying software systems. A test sequence for an EFSM is a sequence composed of values of input variables, which can make the EFSM "execute" along a complete path from entry to exit. Traditional test sequence generation methods for EFSM almost imitate those FSM based approaches and focus on states identification. Most of them impose significant restrictions on the EFSM. This paper proposes a path-oriented approach to generating test cases for EFSM and presents a tool for test data generation. The experiments show that our tool can generate executable test sequences for EFSM models of software systems automatically in acceptable time.
searching, EFSM, path feasibility, test sequence generation, coverage criterion, symbolic execution
T. Wu, J. Yan and J. Zhang, "A Path-oriented Approach to Generating Executable Test Sequences for Extended Finite State Machines," 2012 Sixth International Symposium on Theoretical Aspects of Software Engineering(TASE), Beijing, China China, 2012, pp. 267-270.