Paper Info
Title
Checking Experiments for Symbolic Input/Output Finite State Machines
Abstract
After sixty or so years of development the theory of checking experiments for FSM still continues to attract a lot of attention of research community. One of the reasons is that it offers test generation techniques which under well-defined assumptions guarantee complete fault coverage for a given fault model of a specification FSM. Checking experiments have already been extended to remove assumptions that the specification Mealy machine need to be reduced, deterministic, and completely specified, while keeping the input, output and state sets finite. In our recent work, we investigated possibilities of removing the assumption about the finiteness of the input set, introducing the model FSM with symbolic inputs. In this paper, we report on our efforts of further lifting the theory of checking experiments for Mealy machines with symbolic inputs and symbolic outputs. The former are predicates defined over input variables and the latter are output variable valuations computed by assignments on input variables. Both types of variables can have large or even infinite domains. Inclusion of assignments in the model complicates fault detection, as different assignments may produce the same output valuations for some input valuations. We address this issue by using a transition cover enhanced with assignment discriminating predicates specifying symbolic inputs on which the assignments produce different outputs. The enhanced transition cover is then used in checking experiments, which can detect assignment/output faults and more general transition faults under certain assumptions.
Year
DOI
Venue
2016
10.1109/ICSTW.2016.9
2016 IEEE Ninth International Conference on Software Testing, Verification and Validation Workshops (ICSTW)
Keywords
Field
DocType
Finite State Machines,Extended Finite State Machines,Symbolic Automata,Conformance testing,Checking experiments,Fault model based test generation
Fault coverage,Fault detection and isolation,Computer science,Automaton,Algorithm,Input/output,Theoretical computer science,Finite-state machine,Mealy machine,Fault model,Symbolic trajectory evaluation
Conference
ISSN
ISBN
Citations 
2159-4848
978-1-5090-3675-2
6
PageRank 
References 
Authors
0.45
25
1
Name
Order
Citations
PageRank
Alexandre Petrenko117615.90