Name
Abstract | ||
|---|---|---|
Recently, we proposed a mutation-testing approach from a classical finite state machine (FSM) for detecting nonconforming mutants in a given fault domain specified with a so-called mutation machine. In this paper, we lift this approach to a particular type of extended finite state machines called symbolic input finite state machine (SIFSM), where transitions are labeled with symbolic inputs, which are predicates on input variables possibly having infinite domains. We define a well-formed mutation SIFSM for describing various types of faults. Given a mutation SIFSM, we develop a method for evaluating the adequacy of a test suite and a method for generating tests detecting all nonconforming mutants. Experimental results with the prototype tool we have developed indicate that the approach is applicable to industrial-like systems. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-67549-7_7 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Extended FSM,Symbolic inputs,Conformance testing,Mutation testing fault modelling,Fault model-based test generation,Constraint solving | Test suite,Lift (force),Mutation testing,Computer science,Algorithm,Conformance testing,Finite-state machine | Conference |
Volume | ISSN | Citations |
10533 | 0302-9743 | 3 |
PageRank | References | Authors |
0.39 | 19 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Omer Nguena-Timo | 1 | 19 | 4.77 |
| Alexandre Petrenko | 2 | 176 | 15.90 |
| Ramesh, S. | 3 | 144 | 19.02 |