Data flow testing as model checking
Hyoung Seok Hong,Sungdeok Cha,Insup Lee,Oleg Sokolsky,Hasan Ural +4 more
- 03 May 2003
- pp 232-242
TL;DR: A model checking-based approach to dataflow testing is presented using CTL as temporal logic and SMV as model checker and the capability of model checkers to construct witnesses and counterexamples allows test generation to be fully automatic.
read more
Abstract: This paper presents a model checking-based approach to data flow testing. We characterize data flow 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 heurstic test generation algorithms. We illustrate our approach using CTL as temporal logic and SMV as model checker.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Lazy abstraction
Thomas A. Henzinger,Ranjit Jhala,Rupak Majumdar,Grégoire Sutre +3 more
- 01 Jan 2002
TL;DR: This work presents an algorithm for model checking safety properties using lazy abstraction and describes an implementation of the algorithm applied to C programs and provides sufficient conditions for the termination of the method.
1.3K
Using Model Checking to Generate Tests from Specifications | NIST
Paul Ammann,Paul E. Black,William J. Majurski +2 more
- 01 Nov 1998
TL;DR: In this paper, a model checker is applied to the problem of test generation using a new application of mutation analysis, and two classes of operators are defined: those that generate test cases from which a correct implementation must differ, and those that produce test cases with which it must agree.
334
Testing real-time systems using UPPAAL
Anders Hessel,Kim Guldstrand Larsen,Marius Mikučionis,Brian Nielsen,Paul Pettersson,Arne Skou +5 more
- 01 Jan 2008
TL;DR: This chapter presents principles and techniques for modelbased black-box conformance testing of real-time systems using the Uppaal model-checking tool-suite using the basis for testing as a network of concurrent timed automata specified by the test engineer.
Coverage metrics for requirements-based testing
Michael W. Whalen,Ajitha Rajan,Mats P. E. Heimdahl,Steven P. Miller +3 more
- 21 Jul 2006
TL;DR: This paper focuses on structural coverage criteria on requirements formalized as LTL properties and discusses how they can be adapted to measure finite test cases and can be used to automatically generate a requirements-based test suite.
Transition covering tests for systems with queues
Jiale Huo,Alexandre Petrenko +1 more
TL;DR: This paper introduces a method to cover transitions of a concurrent system under test through a context consisting of infinite-capacity queues, derives transition covering tests directly from the specification of the concurrent system, not its composition with queues.
157
References
The model checker SPIN
Gerard J. Holzmann
- 01 May 1997
TL;DR: An overview of the design and structure of the verifier, its theoretical foundation, and an overview of significant practical applications are given.
Automatic verification of finite-state concurrent systems using temporal logic specifications
TL;DR: It is argued that this technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finite-state concurrent systems.
•Book
Symbolic Model Checking
Edmund M. Clarke,Kenneth L. McMillan,Sérgio Campos,Vassili Hartonas-Garmhausen +3 more
- 31 Jul 1993
TL;DR: Using symbolic model checking techniques it is possible to verify industrial-size finite state systems and models with more than 10120 states have been verified using special techniques.
Results on the propositional μ-calculus
TL;DR: A propositional μ-calculus L μ is defined and study, which consists essentially of propositional modal logic with a least fixpoint operator that is syntactically simpler yet strictly more expressive than Propositional Dynamic Logic (PDL).
2K
Symbolic model checking: an approach to the state explosion problem
Kenneth L. McMillan
- 01 Jan 1992
TL;DR: The symbolic model checking technique revealed subtle errors in this protocol, resulting from complex execution sequences that would occur with very low probability in random simulation runs, and an alternative method is developed for avoiding the state explosion in the case of asynchronous control circuits.
Related Papers (5)
Gerard J. Holzmann
- 01 May 1997
Edmund M. Clarke,Kenneth L. McMillan,Sérgio Campos,Vassili Hartonas-Garmhausen +3 more
- 31 Jul 1993
David Lee,Mihalis Yannakakis +1 more
- 01 Aug 1996