Name
Abstract | ||
|---|---|---|
In this paper, we consider a classical problem of complete test generation for deterministic finite-state machines (FSMs) in a more general setting. The first generalization is that the number of states in implementation FSMs can even be smaller than that of the specification FSM. Previous work deals only with the case when the implementation FSMs are allowed to have the same number of states as the specification FSM. This generalization provides more options to the test designer: when traditional methods trigger a test explosion for large specification machines, tests with a lower, but yet guaranteed, fault coverage can still be generated. The second generalization is that tests can be generated starting with a user-defined test suite, by incrementally extending it until the desired fault coverage is achieved. Solving the generalized test derivation problem, we formulate sufficient conditions for test suite completeness weaker than the existing ones and use them to elaborate an algorithm that can be used both for extending user-defined test suites to achieve the desired fault coverage and for test generation. We present the experimental results that indicate that the proposed algorithm allows obtaining a trade-off between the length and fault coverage of test suites. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1093/comjnl/bxp073 | Comput. J. |
Keywords | Field | DocType |
fault coverage | Stuck-at fault,Test suite,Automatic test pattern generation,Fault coverage,Computer science,Algorithm,Test case,Test compression,Completeness (statistics) | Journal |
Volume | Issue | ISSN |
53 | 9 | 0010-4620 |
Citations | PageRank | References |
15 | 0.70 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adenilso Da Silva Simão | 1 | 216 | 23.24 |
| A. Petrenko | 2 | 565 | 31.37 |