This paper presents a model checking-based approach to data flow testing. We characterize dataflow oriented coverage criteria in temporal logic such that the problem of test generation is reduced to the problem of finding witnesses for a set of temporal logic formulas. The capability of model checkers to construct witnesses and counterexamples allows test generation to be fully automatic. We discuss complexity issues in minimal cost test generation and describe heuristic test generation algorithms. We illustrate our approach using CTL as temporal logic and SMV as model checker.
|Number of pages||11|
|Journal||Proceedings - International Conference on Software Engineering|
|Publication status||Published - 2003|
|Event||25th International Conference on Software Engineering - Portland, OR, United States|
Duration: 2003 May 3 → 2003 May 10
ASJC Scopus subject areas