An approach for test selection for EFSMs using a theorem prover

Mahadevan Subramaniam, Ling Xiao, Bo Guo, Zoltan Pap

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationTesting of Software and Communication Systems - 21st IFIP WG 6.1 International Conference, TESTCOM 2009 and 9th International Workshop, FATES 2009, Proceedings
Pages146-162
Number of pages17
DOIs
StatePublished - Dec 1 2009
Event21st IFIP International Conference on Testing of Communicating Systems, TESTCOM 2009 and 9th International Workshop on Formal Approaches to Testing of Software, FATES 2009 - Eindhoven, Netherlands
Duration: Nov 2 2009Nov 4 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5826 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference21st IFIP International Conference on Testing of Communicating Systems, TESTCOM 2009 and 9th International Workshop on Formal Approaches to Testing of Software, FATES 2009
CountryNetherlands
CityEindhoven
Period11/2/0911/4/09

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'An approach for test selection for EFSMs using a theorem prover'. Together they form a unique fingerprint.

  • Cite this

    Subramaniam, M., Xiao, L., Guo, B., & Pap, Z. (2009). An approach for test selection for EFSMs using a theorem prover. In Testing of Software and Communication Systems - 21st IFIP WG 6.1 International Conference, TESTCOM 2009 and 9th International Workshop, FATES 2009, Proceedings (pp. 146-162). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5826 LNCS). https://doi.org/10.1007/978-3-642-05031-2_10