Extended Finite State Machine Based Test Derivation Driven by User Defined Faults

El-Fakih, Khaled; Kolomeez, A.; Prokopenko, Svetlana; Yevtushenko, Nina

doi:10.1109/icst.2008.16

Cited by 12 publications

(17 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Duale et al [4] presented a method combined with symbolic execution, linear programming and graph splitting to eliminate conflicts in a class of EFSMs. El-Fakih et al studied EFSM test generation with user defined faults [5]. Kalaji et al [6]- [8] applied Genetic Algorithm on feasible paths generation.…”

Section: Comparison With Related Workmentioning

confidence: 99%

Modeling and Testing of Network Protocols with Parallel State Machines

Yin

Yao

Wang

et al. 2015

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYThe researches on model-based testing mainly focus on the models with single component, such as FSM and EFSM. For the network protocols which have multiple components communicating with messages, CFSM is a widely accepted solution. But in some network protocols, parallel and data-shared components maybe exist in the same network entity. It is infeasible to precisely specify such protocol by existing models. In this paper we present a new model, Parallel Parameterized Extended Finite State Machine (PaP-EFSM). A protocol system can be modeled with a group of PaP-EFSMs. The PaP-EFSMs work in parallel and they can read external variables form each other. We present a 2-stage test generation approach for our new models. Firstly, we generate test sequences for internal variables of each machine. They may be non-executable due to external variables. Secondly, we process the external variables. We make the sequences for internal variables executable and generate more test sequences for external variables. For validation, we apply this method to the conformance testing of real-life protocols. The devices from different vendors are tested and implementation faults are exposed.

show abstract

Section: Comparison With Related Workmentioning

confidence: 99%

Modeling and Testing of Network Protocols with Parallel State Machines

Yin

Yao

Wang

et al. 2015

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…We follow the approach in [11], but a proposed technique allows to derive such a slice preserving more transitions of the initial EFSM [3]. The idea behind the approach is to delete transitions from the initial EFSM which have predicates that significanty depend on values of context variables.…”

Section: B Context-free Efsm Slicementioning

confidence: 99%

“…However, this approach is well elaborated only for two configurations and there still is the execution problem for an obtained distinguishing sequence, since not every parameterized input sequence that takes the product of two initial EFSMs from the initial state to a f ail state is executable. Another way is to distinguish not configurations but states of the EFSM using context-free slices of an EFSM that are very close to classical FSMs and correspondingly, there is no problem to execute a derived distinguishing sequence [11]. In this paper, we consider two such slices.…”

Section: Introductionmentioning

confidence: 99%

Extended Finite State Machine based Test Derivation Strategies for Telecommunication Protocols

Kushik¹,

Kolomeez²,

Cavalli³

et al. 2014

Proceedings of the Spring/Summer Young Researchers' Colloquium on Software Engineering

Self Cite

View full text Add to dashboard Cite

Abstract-In this paper, we consider the problem of test derivation based on an Extended Finite State Machine (EFSM) that is widely used for describing the behavior of telecommunication protocols and software. An EFSM augments a classical Finite State Machine (FSM) with context variables, input/output parameters and predicates. Tests based on various coverage criteria for EFSMs do not capture many functional faults and thus, there is a strong need for tests checking functional properties. Moreover, since there are no constructive necessary and sufficient conditions for checking whether two arbitrary EFSMs are equivalent, most methods are based on some kind of a transition tour, despite of the fact that such methods do not provide test suites with the guaranteed fault coverage. Given possibly nondeterministic and partial EFSM, we consider a transition tour of an FSM obtained by the simulation of the initial EFSM and provide some experimental results that such a test suite detects a number of inconsistencies in available protocol implementations with respect to protocol specifications. Since a transition tour augmented with state identifiers is known to have the higher fault coverage, we also discuss how state identifiers can be generated without facing the state explosion problem. Correspondingly, we consider FSM slices that are obtained by deleting from the initial EFSM all the context variables and possibly, input and output parameters. As the obtained FSM can be nondeterministic, a state identifier should contain separating sequences for pairs of states and we adapt the known techniques for deriving separating sequences for nonobservable partial FSMs.

show abstract

“…The EFSM model is used as the underlying model for a number of popular specification techniques, such as Statecharts (Harel & Naamad 1996), SDL (ITU-T 1994) and UML (OMG 2002). EFSM based related testing problems, test derivation approaches, and applications domains are given in several papers such as (Bochmann & Petrenko 1994;Bourhfir et al 2001;Cavalli et al 2003;Ramalingom et al 2003;El-Fakih et al 2003;Petrenko et al 2004;El-Fakih et al 2008;Sugeta et al 2004;Jia & Harman 2011;Keum et al 2006;Wong et al 2009). Furthermore, an extension of the EFSM model to specify and test timed systems is considered in (Merayo et al 2008).…”

mentioning

confidence: 99%

“…For instance, in test derivation, checking if a transition of the black-box Implementation Under Test (IUT) transfers wrongly from a current state involves distinguishing a next reference configuration from some other configurations of the specification EFSM as described in (Bochmann & Petrenko 1994;Bourhfir et al 2001;Ramalingom et al 2003;Petrenko et al 2004;El-Fakih et al 2008). The set of configurations that one would like to distinguish from a given configuration is called a "black-list" of "suspicious configurations" in (Petrenko et al 2004).…”

mentioning

confidence: 99%

Distinguishing extended finite state machine configurations using predicate abstraction

El-Fakih

Yevtushenko

Bozga

et al. 2016

J Softw Eng Res Dev

Self Cite

View full text Add to dashboard Cite

Background: Extended Finite State Machines (EFSMs) provide a powerful model for the derivation of functional tests for software systems and protocols. Many EFSM based testing problems, such as mutation testing, fault diagnosis, and test derivation involve the derivation of input sequences that distinguish configurations of a given EFSM specification. Method and Results: In this paper, a method is proposed for the derivation of a distinguishing sequence for two explicitly given or symbolically represented, possibly infinite, sets of EFSM configurations using a corresponding FSM abstraction that is derived based on finite sets of predicates and parameterized inputs. An abstraction function that maps configurations and transitions of the EFSM specification to corresponding abstract states and transitions of the abstraction FSM is proposed. Properties of the abstraction are established along with a discussion on a proper selection of the sets of predicates and parameterized inputs used while deriving an FSM abstraction. If no distinguishing sequence is found for the current FSM abstraction then a refined abstraction is constructed by extending the sets of predicates and parameterized inputs. Simple heuristics for the selection of additional predicates are discussed and application examples are provided. Conclusions: The work can be applied in various domains such as EFSM-based test derivation, mutation testing, and fault diagnosis.

show abstract

Extended Finite State Machine Based Test Derivation Driven by User Defined Faults

Cited by 12 publications

References 19 publications

Modeling and Testing of Network Protocols with Parallel State Machines

Modeling and Testing of Network Protocols with Parallel State Machines

Extended Finite State Machine based Test Derivation Strategies for Telecommunication Protocols

Distinguishing extended finite state machine configurations using predicate abstraction

Contact Info

Product

Resources

About