#### DMCA

## Ural H., A Temporal Logic Based Theory of Test Coverage (2002)

Venue: | and Generation, International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS2002 |

Citations: | 60 - 7 self |

### Citations

2662 | Statecharts: A Visual Formalism for Complex Systems
- Harel
- 1987
(Show Context)
Citation Context ...(EFSMs). EFSMs extend finite state machines with variables and operations on them and are widely used as an underlying model of many specification languages such as SDL[2], Estelle[4], and Statecharts=-=[12]-=-. Because an EFSM specification typically allows an infinite number of executions, it is not possible to determine whether an implementation under test conforms to its specification by considering all... |

1579 |
Program Slicing
- Weiser
- 1984
(Show Context)
Citation Context ...rmula. In addition to the coverage criteria that cover states, transitions, and definition-use associations, we also consider more complex ones that are based on the affect relation in program slicing=-=[24]-=- and are applied to protocol conformance testing[22]. They deal with data flow from input variables to output variables through an arbitrary number of definition-use associations between local variabl... |

1493 | The Model Checker Spin
- Holzmann
- 1997
(Show Context)
Citation Context ...transition coverage criteria. [14] describes a test generation method by adapting local or on-the-fly model checking algorithms. [23] describes an on-the-fly test generation method which utilizes SPIN=-=[13]-=- to generate the information necessary for test generation. Test generation using the capability of model checkers to construct counterexamples has been applied in several contexts. [1] describes the ... |

1373 | Automatic verification of finite-state concurrent systems using temporal logic specifications
- Clarke, Emerson, et al.
- 1986
(Show Context)
Citation Context ...ith respect to a given EFSM. The capability of model checkers to construct witnesses and counterexamples allows test generation to be automatic. We illustrate our approach using the temporal logic CTL=-=[7]-=-. First we define the semantics of EFSMs in terms of Kripke structures. We then describe how to express each coverage criterion as a set of formulas in CTL, parameterized with the propositions of a gi... |

666 |
Reducibility Among Combinatorial Problems, in Complexity of Computer Computations, (Editor
- Karp
- 1972
(Show Context)
Citation Context ...NTG ′ : given a collection of Wf and positive integer k, is there a witness-set Π with |Π| ≤k? We prove that MNTG ′ is NP-complete by reducing the Hitting Set problem, which is known to be NP-complete=-=[15]-=-, to MNTG ′ . The Hitting Set problem is defined by: given a collection of subsets Ci of a finite set S and positive integer k, is there a subset S ′ ⊆ S, called hitting set, such that |S ′ |≤k and S ... |

599 |
Symbolic Model Checking: An Approach to the State Explosion Problem
- McMillan
- 1992
(Show Context)
Citation Context ...how that these optimization problems are NP-hard and describe a simple heuristic similar to the test generation method in [10], which enables the application of existing CTL model checkers such as SMV=-=[19]-=- to automatic test generation. Related Work. Widely-used system models in the testing literature include finite state machines (FSMs) and labelled transition systems (LTSs), especially in hardware tes... |

350 | Selecting software test data using data flow information
- Rapps, Weyuker
- 1985
(Show Context)
Citation Context ...ch that the formula is satisfied by the EFSM if and only if the EFSM has an execution that covers the entity described by the formula such as a specific state, transition, or definitionuse association=-=[21]-=-. If the entity can be covered in the EFSM, a witness for the corresponding formula is constructed. Atest suite is a set of finite executions of the EFSM such that for every formula, the test suite in... |

332 |
Symbolic model checking: 10 states and beyond
- Burch, Clarke, et al.
- 1992
(Show Context)
Citation Context ...table. The approach we advocate here is based on constructing Kripke structures from EFSMs and hence also suers from state explosion. Our approach, however, enables the use of symbolic model checking=-=[5]-=- that has been shown to be eective for controlling state explosion for certain problem domains. Second, our approach overcomes the test explosion problem by using control and datasow information of E... |

331 | Principles and Methods of Testing Finite State Machines - A Survey
- Lee, Yannakakis
- 1996
(Show Context)
Citation Context ...nsition systems (LTSs), especially in hardware testing and protocol conformance testing. Testing methods based on such models primarily focus on control flow oriented test generation (for survey, see =-=[3,8,17]-=-). Although these methods are well-suited for hardware circuits and control portions of communication protocols, they are not powerful enough to test complex data-dependent behaviors. EFSMs extend FSM... |

327 | Results on the propositional [mu]-calculus - Kozen - 1983 |

173 | Using Model Checking to Generate Tests from Requirements Specifications
- Gargantini, Heitmeyer
- 1999
(Show Context)
Citation Context ...equences in the suite or the total length of test sequences in the suite. We show that these optimization problems are NP-hard and describe a simple heuristic similar to the test generation method in =-=[10]-=-, which enables the application of existing CTL model checkers such as SMV[19] to automatic test generation. Related Work. Widely-used system models in the testing literature include finite state mach... |

149 | Using model checking to generate tests from specifications
- Ammann, Black, et al.
- 1998
(Show Context)
Citation Context ... utilizes SPIN[13] to generate the information necessary for test generation. Test generation using the capability of model checkers to construct counterexamples has been applied in several contexts. =-=[1]-=- describes the application of model checking to mutation analysis. [6,9] generate tests by constructing counterexamples for user-specified temporal formulas. No consideration is given to coverage crit... |

112 |
An introduction to Estelle: A specification language for distributed systems
- Budkowski, Dembinski
- 1987
(Show Context)
Citation Context ...nite state machines (EFSMs). EFSMs extend finite state machines with variables and operations on them and are widely used as an underlying model of many specification languages such as SDL[2], Estelle=-=[4]-=-, and Statecharts[12]. Because an EFSM specification typically allows an infinite number of executions, it is not possible to determine whether an implementation under test conforms to its specificati... |

100 |
Symbolic model checking
- Clarke, McMillan, et al.
- 1996
(Show Context)
Citation Context ...able. The approach we advocate here is based on constructing Kripke structures from EFSMs and hence also suffers from state explosion. Our approach, however, enables the use of symbolic model checking=-=[5]-=- that has been shown to be effective for controlling state explosion for certain problem domains. Second, our approach overcomes the test explosion problem by using control and data flow information o... |

77 | Protocol testing: Review of methods and relevance for software testing
- Bochmann, Petrenko
- 1994
(Show Context)
Citation Context ...orms to its specification by considering all executions of the specification. In the last two decades, a number of methods and tools have been proposed for test generation from EFSMs (for survey, see =-=[3,8]-=-) and most of them focus on a family of coverage criteria based on the information of control flow (e.g, states and transitions) and data flow (e.g., definitions and uses of variables). We show that t... |

46 |
The CCITT-specification and description language SDL
- Belina, Hogrefe
- 1989
(Show Context)
Citation Context ... extended finite state machines (EFSMs). EFSMs extend finite state machines with variables and operations on them and are widely used as an underlying model of many specification languages such as SDL=-=[2]-=-, Estelle[4], and Statecharts[12]. Because an EFSM specification typically allows an infinite number of executions, it is not possible to determine whether an implementation under test conforms to its... |

46 |
Test generation derived from modelchecking
- Jéron, Morel
- 1999
(Show Context)
Citation Context ...en considered in the testing literature. [11,20] use binary decision diagrams (BDDs) to represent EFSMs and describe symbolic approaches to test generation for state and transition coverage criteria. =-=[14]-=- describes a test generation method by adapting local or on-the-fly model checking algorithms. [23] describes an on-the-fly test generation method which utilizes SPIN[13] to generate the information n... |

45 | Test Generation for Intelligent Networks Using Model Checking
- Engels, Feijs, et al.
- 1997
(Show Context)
Citation Context ...ration. Test generation using the capability of model checkers to construct counterexamples has been applied in several contexts. [1] describes the application of model checking to mutation analysis. =-=[6,9]-=- generate tests by constructing counterexamples for user-specified temporal formulas. No consideration is given to coverage criteria. [10] generates tests from SCR specifications using two model check... |

24 | On-the-fly conformance testing using SPIN
- Vries, Tretmans
- 2000
(Show Context)
Citation Context ...FSMs and describe symbolic approaches to test generation for state and transition coverage criteria. [14] describes a test generation method by adapting local or on-the-fly model checking algorithms. =-=[23]-=- describes an on-the-fly test generation method which utilizes SPIN[13] to generate the information necessary for test generation. Test generation using the capability of model checkers to construct c... |

21 |
Coverage-Directed Test Generation Using Symbolic Techniques
- Geist, Farkas, et al.
- 1996
(Show Context)
Citation Context ...analysis. Ideally, one would eventually like to be able to combine these two approaches. Recently, connection between test generation and model checking has been considered in the testing literature. =-=[11,20]-=- use binary decision diagrams (BDDs) to represent EFSMs and describe symbolic approaches to test generation for state and transition coverage criteria. [14] describes a test generation method by adapt... |

19 |
Specificationbased Testing Using Model Checking
- Callahan, Schneider, et al.
- 1996
(Show Context)
Citation Context ...ration. Test generation using the capability of model checkers to construct counterexamples has been applied in several contexts. [1] describes the application of model checking to mutation analysis. =-=[6,9]-=- generate tests by constructing counterexamples for user-specified temporal formulas. No consideration is given to coverage criteria. [10] generates tests from SCR specifications using two model check... |

18 | Abstraction techniques for validation coverage analysis and test generation
- Moundanos, Abraham, et al.
- 1998
(Show Context)
Citation Context ...analysis. Ideally, one would eventually like to be able to combine these two approaches. Recently, connection between test generation and model checking has been considered in the testing literature. =-=[11,20]-=- use binary decision diagrams (BDDs) to represent EFSMs and describe symbolic approaches to test generation for state and transition coverage criteria. [14] describes a test generation method by adapt... |

18 |
Automatic Veri of FiniteState Concurrent Systems Using Temporal Logic Speci
- Clarke, Emerson, et al.
- 1986
(Show Context)
Citation Context ...ith respect to a given EFSM. The capability of model checkers to construct witnesses and counterexamples allows test generation to be automatic. We illustrate our approach using the temporal logic CTL=-=[7]-=-. First we dene the semantics of EFSMs in terms of Kripke structures. We then describe how to express each coverage criterion as a set of formulas in CTL, parameterized with the propositions of a giv... |

15 |
Test development for communication protocols: towards automation
- Dssouli, Saleh, et al.
- 1999
(Show Context)
Citation Context ...orms to its specification by considering all executions of the specification. In the last two decades, a number of methods and tools have been proposed for test generation from EFSMs (for survey, see =-=[3,8]-=-) and most of them focus on a family of coverage criteria based on the information of control flow (e.g, states and transitions) and data flow (e.g., definitions and uses of variables). We show that t... |

7 |
A Test Sequence Generation Method for Protocol Testing
- Ural, Yang
- 1991
(Show Context)
Citation Context ...er states, transitions, and definition-use associations, we also consider more complex ones that are based on the affect relation in program slicing[24] and are applied to protocol conformance testing=-=[22]-=-. They deal with data flow from input variables to output variables through an arbitrary number of definition-use associations between local variables. Hence they cannot be characterized as CTL formul... |

2 |
An Introduction to Estelle: a Speci Language for Distributed Systems
- Budkowski, Dembinski
- 1991
(Show Context)
Citation Context ...edsnite state machines (EFSMs). EFSMs extendsnite state machines with variables and operations on them and are widely used as an underlying model of many specication languages such as SDL[2], Estelle=-=[4]-=-, and Statecharts[12]. Because an EFSM specication typically allows an innite number of executions, it is not possible to determine whether an implementation under test conforms to its specication ... |

1 | Test Sequence Selection - Lee, Hao - 2001 |