Paper Info
Title
Checking Experiments for Finite State Machines with Symbolic Inputs.
Abstract
There exists a significant body of work in the theory of checking experiments devoted to test generation from FSM which guarantees complete fault coverage for a given fault model. Practical applications require nevertheless methods for fault-model driven test generation from Extended FSMs EFSM. Traditional approaches for EFSM focus on model coverage, which provides no characterization of faults that can be detected by the generated tests. Only few approaches use fault models, and we are not aware of any result in the theory of checking experiments for extended FSMs. In this paper, we lift the theory of checking experiments to EFSMs, which are Mealy machines with predicates defined over input variables treated as symbolic inputs. Considering this kind of EFSM, we propose a test generation method that produces a symbolic checking experiment, adapting the well-known HSI method. We then present conditions under which arbitrary instances of a symbolic checking experiment can be used for testing black-box implementations, while guaranteeing complete fault coverage.
Year
DOI
Venue
2015
10.1007/978-3-319-25945-1_1
ICTSS
Keywords
Field
DocType
Finite state machines,Extended finite state machines,Symbolic automata,Conformance testing,Checking experiments,Fault model based test generation
Abstraction model checking,Model checking,Fault coverage,Computer science,Extended finite-state machine,Algorithm,Finite-state machine,Theoretical computer science,Conformance testing,Fault model,Symbolic trajectory evaluation
Conference
Volume
ISSN
Citations 
9447
0302-9743
4
PageRank 
References 
Authors
0.41
22
2
Name
Order
Citations
PageRank
Alexandre Petrenko117615.90
Adenilso Da Silva Simão221623.24