Name
Abstract | ||
|---|---|---|
To plan testing activities, testers face the challenge of determining a strategy, including a test coverage criterion that offers an acceptable compromise between the available resources and test goals. Known theoretical properties of coverage criteria do not always help and, thus, empirical data are needed. The results of an experimental evaluation of several coverage criteria for finite state machines (FSMs) are presented, namely, state and transition coverage; initialisation fault and transition fault coverage. The first two criteria focus on FSM structure, whereas the other two on potential faults in FSM implementations. The authors elaborate a comparison approach that includes random generation of FSM, construction of an adequate test suite and test minimisation for each criterion to ensure that tests are obtained in a uniform way. The last step uses an improved greedy algorithm. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1049/iet-sen.2008.0018 | Software, IET |
Keywords | Field | DocType |
finite state machines,greedy algorithms,program testing,software fault tolerance,finite state machine test coverage criteria,greedy algorithm,initialisation fault,software behaviour,state coverage,transition coverage,transition fault coverage | Test suite,Code coverage,Fault coverage,Computer science,Software fault tolerance,Greedy algorithm,Finite-state machine,Minimisation (psychology),Modified condition/decision coverage,Reliability engineering | Journal |
Volume | Issue | ISSN |
3 | 2 | 1751-8806 |
Citations | PageRank | References |
6 | 0.45 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adenilso Da Silva Simão | 1 | 216 | 23.24 |
| A. Petrenko | 2 | 565 | 31.37 |
| José Carlos Maldonado | 3 | 1179 | 94.20 |
| Simao, A. | 4 | 6 | 0.45 |