TY - GEN
T1 - An approach for test selection for EFSMs using a theorem prover
AU - Subramaniam, Mahadevan
AU - Xiao, Ling
AU - Guo, Bo
AU - Pap, Zoltan
PY - 2009
Y1 - 2009
N2 - This paper describes an automatic approach for selecting tests from a test suite to validate the changes made to an extended finite state machine (EFSM). EFSMs supporting variables over commonly used data types including booleans, numbers, arrays, queues, and records, and communicating with the environment using parameterized messages are considered. Changes to the EFSM add/delete/replace one or more transitions. Tests are described using a sequence of input and output messages with parameter values. We introduce a class of fully-observable tests. The description of a fully-observable test contains all the information to accurately determine the transitions executed by the test. Interaction among the EFSM transitions captured in terms of a compatibility relation is used along with a given test description to automatically identify fully-observable tests. A procedure is described for selecting a test for a given change based on accurately predicting if the test executes the change transition. We then describe how several tests can be simultaneously selected by grouping them based on overlap of their descriptions. The proposed approach has been implemented using a theorem prover and applied to several examples including protocols and web services with encouraging results.
AB - This paper describes an automatic approach for selecting tests from a test suite to validate the changes made to an extended finite state machine (EFSM). EFSMs supporting variables over commonly used data types including booleans, numbers, arrays, queues, and records, and communicating with the environment using parameterized messages are considered. Changes to the EFSM add/delete/replace one or more transitions. Tests are described using a sequence of input and output messages with parameter values. We introduce a class of fully-observable tests. The description of a fully-observable test contains all the information to accurately determine the transitions executed by the test. Interaction among the EFSM transitions captured in terms of a compatibility relation is used along with a given test description to automatically identify fully-observable tests. A procedure is described for selecting a test for a given change based on accurately predicting if the test executes the change transition. We then describe how several tests can be simultaneously selected by grouping them based on overlap of their descriptions. The proposed approach has been implemented using a theorem prover and applied to several examples including protocols and web services with encouraging results.
UR - http://www.scopus.com/inward/record.url?scp=70549096178&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70549096178&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-05031-2_10
DO - 10.1007/978-3-642-05031-2_10
M3 - Conference contribution
AN - SCOPUS:70549096178
SN - 3642050301
SN - 9783642050305
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 146
EP - 162
BT - Testing of Software and Communication Systems - 21st IFIP WG 6.1 International Conference, TESTCOM 2009 and 9th International Workshop, FATES 2009, Proceedings
T2 - 21st IFIP International Conference on Testing of Communicating Systems, TESTCOM 2009 and 9th International Workshop on Formal Approaches to Testing of Software, FATES 2009
Y2 - 2 November 2009 through 4 November 2009
ER -