## Classical Search Strategies for Test Case Generation with Constraint Logic Programming (2001)

### Cached

### Download Links

Venue: | In Proc. Formal Approaches to Testing of Software |

Citations: | 22 - 7 self |

### BibTeX

@INPROCEEDINGS{Pretschner01classicalsearch,

author = {Alexander Pretschner},

title = {Classical Search Strategies for Test Case Generation with Constraint Logic Programming},

booktitle = {In Proc. Formal Approaches to Testing of Software},

year = {2001},

pages = {47--60},

publisher = {BRICS}

}

### Years of Citing Articles

### OpenURL

### Abstract

Test case generation for concurrent reactive systems on the grounds of symbolic execution basically amounts to searching their state space. As in the case of model checkers, di#erent search strategies (depth-first, breadth-first, best-first, tabu) together with di#erent strategies for storing visited states have a significant impact on the performance of the generation algorithm. We present experimental data for the performance of di#erent search strategies and discuss the results, taking into account counter examples as generated by model checkers.

### Citations

1995 |
Abstract interpretation: a unified lattice model for the static analysis of programs by construction or approximation of fixpoints, in
- Cousot, Cousot
- 1977
(Show Context)
Citation Context ...itself. This would enable one to compute with sets of states rather than single states, something that is referred to as the “collecting semantics” in the literature on abstract interpretation (e.=-=g., [8]-=-). Knowledge of this computed collecting semantics may turn out to be a good starting point for the definition of an abstract semantics that can, in turn, be used for an actual abstract interpretation... |

1401 |
2000, Extreme Programming Explained: Embrace Change
- BECK
(Show Context)
Citation Context ...es for model checkers with strategies for test case generation. Related work. Incremental SW development processes include the Rapid Prototyping, the spiral (meta) model, Extreme Programming/Modeling =-=[3, 4]-=-, and, more geared towards reactive systems, the Cleanroom Reference model (CRM, [30]). The benefit of models is particularly acknowledged in the Rational Unified Process [20] and the CRM. The embeddi... |

791 | Constraint logic programming: a survey
- Jaffar, Maher
- 1994
(Show Context)
Citation Context ...ng constraints that its preceding predicate can only satisfy in a finite number of ways. This led to the idea of merging Constraint Languages with LP into Constraint Logic Programming (CLP) languages =-=[19]-=-. These languages allow for the formulation of constraints that are checked for satisfiability in every step of the evaluation of a set of logical formulae (expansion of a node in the resolution tree)... |

652 | The algorithmic analysis of hybrid systems
- Alur, Courcoubetis, et al.
- 1995
(Show Context)
Citation Context ...The idea is to formulate constraints that approximate criteria for killing mutants. [6] uses a mixture of BDDs and Presburger constraints for the representation of sets of states in reactive systems. =-=[1]-=- uses linear constraints on real numbers for model checking hybrid systems. Clearly, the focus is on model checking. The difference with our approach is that (1) we are mixing enumerative and symbolic... |

346 |
The Rational Unified Process: An Introduction
- Kruchten
- 2004
(Show Context)
Citation Context ...e Programming/Modeling [3, 4], and, more geared towards reactive systems, the Cleanroom Reference model (CRM, [30]). The benefit of models is particularly acknowledged in the Rational Unified Process =-=[20]-=- and the CRM. The embedding of model based testing in incremental processes is discussed in [27]. A theory of formal testing is tackled in [16, 5]. They share the commonality of defining an observatio... |

258 | Constraint-based automatic test data generation - DeMillo, Offutt - 1991 |

199 | Constraint handling rules
- Frühwirth
- 1995
(Show Context)
Citation Context ...ior specifications with automata and functional definitions on transitions, and (3) in the thereby induced necessity for powerful constraint handlers on the grounds of Constraint Handling Rules (CHR, =-=[15]-=-). Lutess [12] is a tool for the generation of test cases for Lustre (as is Gatel [23], see above). The difference with our approach is the use of model checkers or random number generators for the ge... |

158 |
Abstract interpretation: A uni lattice model for static analysis of programs by construction of approximation of fixpoints
- Cousot, Cousot
- 1977
(Show Context)
Citation Context ...itself. This would enable one to compute with sets of states rather than single states, something that is referred to as the \collecting semantics" in the literature on abstract interpretation (e=-=.g., [8-=-]). Knowledge of this computed collecting semantics may turn out to be a good starting point for the denition of an abstract semantics that can, in turn, be used for an actual abstract interpretation.... |

152 |
Test generation with inputs, outputs and repetitive quiescence
- Tretmans
- 1996
(Show Context)
Citation Context ...cussed in [27]. A theory of formal testing is tackled in [16, 5]. They share the commonality of defining an observational congruence (“selection hypotheses”) on systems. Similar relations are used=-= in [32, 31]-=- to compute whether or not a system (model) conforms to its specification. We differ from this approach in that we do not want to prove such a conformance relation but rather approximate its proof as ... |

123 |
A theory for the derivation of tests
- Brinksma
- 1988
(Show Context)
Citation Context ...articularly acknowledged in the Rational Unified Process [20] and the CRM. The embedding of model based testing in incremental processes is discussed in [27]. A theory of formal testing is tackled in =-=[16, 5]. Th-=-ey share the commonality of defining an observational congruence (“selection hypotheses”) on systems. Similar relations are used in [32, 31] to compute whether or not a system (model) conforms to ... |

93 | Model Checking in CLP
- Delzanno, Podelski
- 1999
(Show Context)
Citation Context ...the grounds of CLP is, for various non-modular [25] automata considered in [17, 14]. The relationship of Model Checking and (C)LP with possibly tabled resolution procedures is discussed (and used) in =-=[10, 13, 9]-=-. Bounded Model Checking with propositional solvers for test case generation is considered in [33]. Test case generation on the grounds of mutation analysis is, among others, treated in [2]. In the co... |

84 | Testing can be formal, too
- Gaudel
- 1995
(Show Context)
Citation Context ...articularly acknowledged in the Rational Unified Process [20] and the CRM. The embedding of model based testing in incremental processes is discussed in [27]. A theory of formal testing is tackled in =-=[16, 5]. Th-=-ey share the commonality of defining an observational congruence (“selection hypotheses”) on systems. Similar relations are used in [32, 31] to compute whether or not a system (model) conforms to ... |

42 | éron. An approach to symbolic test generation
- Rusu, Bousquet, et al.
- 2000
(Show Context)
Citation Context ...cussed in [27]. A theory of formal testing is tackled in [16, 5]. They share the commonality of defining an observational congruence (“selection hypotheses”) on systems. Similar relations are used=-= in [32, 31]-=- to compute whether or not a system (model) conforms to its specification. We differ from this approach in that we do not want to prove such a conformance relation but rather approximate its proof as ... |

41 | Consistent graphical specification of distributed systems
- Huber, Schätz, et al.
- 1997
(Show Context)
Citation Context ...is may include the test of “unspecified” parts of the system’s behavior. 2 AutoFocus In this section, we briefly present the modeling concepts of the CASE tool AutoFocus (http:// autofocus.in.tu=-=m.de, [18]-=-) and present an example from earlier work that we will use as a basis for the generation of test cases with CLP. AutoFocus. Similar to the UML-RT, systems are modularly specified by different views. ... |

41 |
Test sequences generation from LUSTRE descriptions: Gatel
- Marre, Arnould
- 2000
(Show Context)
Citation Context ...h in that we do not want to prove such a conformance relation but rather approximate its proof as done in traditional testing. (Constraint) Logic Programming for test case generation has been used in =-=[24, 7, 23]-=-; our approach differs (1) in the class of systems we consider, (2) in the input language with a concept of interface and a combined approach to behavior specifications with automata and functional de... |

37 | Logic programming and model checking
- Cui, Dong, et al.
- 1998
(Show Context)
Citation Context ...the grounds of CLP is, for various non-modular [25] automata considered in [17, 14]. The relationship of Model Checking and (C)LP with possibly tabled resolution procedures is discussed (and used) in =-=[10, 13, 9]-=-. Bounded Model Checking with propositional solvers for test case generation is considered in [33]. Test case generation on the grounds of mutation analysis is, among others, treated in [2]. In the co... |

29 |
Atgen: automatic test data generation using constraint logic programming and symbolic execution
- Meudec
(Show Context)
Citation Context ...h in that we do not want to prove such a conformance relation but rather approximate its proof as done in traditional testing. (Constraint) Logic Programming for test case generation has been used in =-=[24, 7, 23]-=-; our approach differs (1) in the class of systems we consider, (2) in the input language with a concept of interface and a combined approach to behavior specifications with automata and functional de... |

28 | Constraint logic programming applied to model checking
- Fribourg
- 2000
(Show Context)
Citation Context ...the grounds of CLP is, for various non-modular [25] automata considered in [17, 14]. The relationship of Model Checking and (C)LP with possibly tabled resolution procedures is discussed (and used) in =-=[10, 13, 9]-=-. Bounded Model Checking with propositional solvers for test case generation is considered in [33]. Test case generation on the grounds of mutation analysis is, among others, treated in [2]. In the co... |

24 | A constraint-based approach for specification and verification of real-time systems
- Gupta, Pontelli
- 1997
(Show Context)
Citation Context ...random number generators for the generation of test cases as well as a restriction to boolean data types. Code generation on the grounds of CLP is, for various non-modular [25] automata considered in =-=[17, 14]-=-. The relationship of Model Checking and (C)LP with possibly tabled resolution procedures is discussed (and used) in [10, 13, 9]. Bounded Model Checking with propositional solvers for test case genera... |

17 | Specification based test sequence generation with propositional logic
- Wimmel, Loetzbeyer, et al.
- 2000
(Show Context)
Citation Context ...Model Checking and (C)LP with possibly tabled resolution procedures is discussed (and used) in [10, 13, 9]. Bounded Model Checking with propositional solvers for test case generation is considered in =-=[33]-=-. Test case generation on the grounds of mutation analysis is, among others, treated in [2]. In the context of mutation testing, constraints for the generation of test cases for transformational syste... |

15 |
W.: Extreme Modeling
- Boger, Baier, et al.
(Show Context)
Citation Context ...es for model checkers with strategies for test case generation. Related work. Incremental SW development processes include the Rapid Prototyping, the spiral (meta) model, Extreme Programming/Modeling =-=[3, 4]-=-, and, more geared towards reactive systems, the Cleanroom Reference model (CRM, [30]). The benefit of models is particularly acknowledged in the Rational Unified Process [20] and the CRM. The embeddi... |

12 | An Overview of Lutess: A Specification-based Tool for Testing Synchronous Software
- Bousquet, Zuanon
- 1999
(Show Context)
Citation Context ...ions with automata and functional definitions on transitions, and (3) in the thereby induced necessity for powerful constraint handlers on the grounds of Constraint Handling Rules (CHR, [15]). Lutess =-=[12]-=- is a tool for the generation of test cases for Lustre (as is Gatel [23], see above). The difference with our approach is the use of model checkers or random number generators for the generation of te... |

11 | Test generation and recognition with formal methods
- AMMANN, E
(Show Context)
Citation Context ...in [10, 13, 9]. Bounded Model Checking with propositional solvers for test case generation is considered in [33]. Test case generation on the grounds of mutation analysis is, among others, treated in =-=[2]-=-. In the context of mutation testing, constraints for the generation of test cases for transformational systems are used in [11]. The idea is to formulate constraints that approximate criteria for kil... |

11 |
Automated symbolic analysis of reactive systems
- Bultan
- 1998
(Show Context)
Citation Context ...xt of mutation testing, constraints for the generation of test cases for transformational systems are used in [11]. The idea is to formulate constraints that approximate criteria for killing mutants. =-=[6]-=- uses a mixture of BDDs and Presburger constraints for the representation of sets of states in reactive systems. [1] uses linear constraints on real numbers for model checking hybrid systems. Clearly,... |

11 |
Cleanroom Software Engineering
- Prowell, Trammell, et al.
- 1999
(Show Context)
Citation Context ...al SW development processes include the Rapid Prototyping, the spiral (meta) model, Extreme Programming/Modeling [3, 4], and, more geared towards reactive systems, the Cleanroom Reference model (CRM, =-=[30]-=-). The benefit of models is particularly acknowledged in the Rational Unified Process [20] and the CRM. The embedding of model based testing in incremental processes is discussed in [27]. A theory of ... |

10 | AutoFocus on constraint logic programming
- Lötzbeyer, Pretschner
(Show Context)
Citation Context ...nstance of conformance testing amounts to showing that the behaviors of the implementation constitute a subset of the behaviors of the specification. With this article, we continue a series of papers =-=[21, 22, 26, 27, 28, 29]-=- on model based test case generation for reactive systems specified with the CASE tool AutoFocus. The idea is to use the system model (a network of hierarchic components with associated behaviors) for... |

10 | Model Based Testing with Constraint Logic Programming: First Results and Challenges
- Pretschner, Lotzbeyer
- 1991
(Show Context)
Citation Context ...nstance of conformance testing amounts to showing that the behaviors of the implementation constitute a subset of the behaviors of the specification. With this article, we continue a series of papers =-=[21, 22, 26, 27, 28, 29]-=- on model based test case generation for reactive systems specified with the CASE tool AutoFocus. The idea is to use the system model (a network of hierarchic components with associated behaviors) for... |

10 | Model based testing in evolutionary software development - Pretschner, Lotzbeyer, et al. |

9 | Modelling and verification using linear hybrid automata - a case study
- Müller, Stauner
(Show Context)
Citation Context ...he use of model checkers or random number generators for the generation of test cases as well as a restriction to boolean data types. Code generation on the grounds of CLP is, for various non-modular =-=[25]-=- automata considered in [17, 14]. The relationship of Model Checking and (C)LP with possibly tabled resolution procedures is discussed (and used) in [10, 13, 9]. Bounded Model Checking with propositio... |

8 | Testing Concurrent Reactive Systems with Constraint Logic Programming
- Pretschner
- 2000
(Show Context)
Citation Context ...nstance of conformance testing amounts to showing that the behaviors of the implementation constitute a subset of the behaviors of the specification. With this article, we continue a series of papers =-=[21, 22, 26, 27, 28, 29]-=- on model based test case generation for reactive systems specified with the CASE tool AutoFocus. The idea is to use the system model (a network of hierarchic components with associated behaviors) for... |

8 | Developing correct safety critical, hybrid, embedded systems
- Pretschner, Slotosch, et al.
- 2000
(Show Context)
Citation Context ... systems, too. In the following, we pick some additional aspects from a recent position paper [26]. One issue is the use of our approach to generating test cases for mixed discrete-continuousssystems =-=[29]-=-. Storing sets of states as well as partial order reduction techniques seem promising candidates to successfully tackle this particularly difficult class of systems. The exact relationship between a s... |

8 |
A Constraint-based Approach to Speci and Veri of Real-time Systems
- Gupta, Pontelli
- 1997
(Show Context)
Citation Context ...random number generators for the generation of test cases as well as a restriction to boolean data types. Code generation on the grounds of CLP is, for various non-modular [25] automata considered in =-=[17, 14]-=-. The relationship of Model Checking and (C)LP with possibly tabled resolution procedures is discussed (and used) in [10, 13, 9]. Bounded Model Checking with propositional solvers for test case genera... |

7 |
Using Constraint Logic Programming for Software Validation
- Ciarlini, Frühwirth
- 1999
(Show Context)
Citation Context ...h in that we do not want to prove such a conformance relation but rather approximate its proof as done in traditional testing. (Constraint) Logic Programming for test case generation has been used in =-=[24, 7, 23]-=-; our approach differs (1) in the class of systems we consider, (2) in the input language with a concept of interface and a combined approach to behavior specifications with automata and functional de... |

7 |
Modelling and veri using linear hybrid automata - a case study. Mathematical and Computer Modelling of Dynamical Systems
- Muller, Stauner
- 2000
(Show Context)
Citation Context ...he use of model checkers or random number generators for the generation of test cases as well as a restriction to boolean data types. Code generation on the grounds of CLP is, for various non-modular =-=[25]-=- automata considered in [17, 14]. The relationship of Model Checking and (C)LP with possibly tabled resolution procedures is discussed (and used) in [10, 13, 9]. Bounded Model Checking with propositio... |

6 |
Automates concurrents a contraintes
- Fribourg, Peixoto
- 1994
(Show Context)
Citation Context ...random number generators for the generation of test cases as well as a restriction to boolean data types. Code generation on the grounds of CLP is, for various non-modular [25] automata considered in =-=[17, 14]-=-. The relationship of Model Checking and (C)LP with possibly tabled resolution procedures is discussed (and used) in [10, 13, 9]. Bounded Model Checking with propositional solvers for test case genera... |

6 | Model based testing for real: The inhouse card case study
- Pretschner, Slotosch, et al.
(Show Context)
Citation Context |

6 |
Consistent graphical speci of distributed systems
- Huber, Schatz, et al.
- 1997
(Show Context)
Citation Context ...this may include the test of \unspecied" parts of the system's behavior. 2 AutoFocus In this section, we brie y present the modeling concepts of the CASE tool AutoFocus (http:// autofocus.in.tum.=-=de, [1-=-8]) and present an example from earlier work that we will use as a basis for the generation of test cases with CLP. AutoFocus. Similar to the UML-RT, systems are modularly specied by dierent views. Th... |

5 |
The Rational Uni Process: An Introduction
- Kruchten
- 2000
(Show Context)
Citation Context ...eme Programming/Modeling [3, 4], and, more geared towards reactive systems, the Cleanroom Reference model (CRM, [30]). The benet of models is particularly acknowledged in the Rational Unied Process [2=-=0-=-] and the CRM. The embedding of model based testing in incremental processes is discussed in [27]. A theory of formal testing is tackled in [16, 5]. They share the commonality of dening an observation... |

3 |
Automates Concurrents a Contraintes. Technique et Science Informatiques
- Fribourg, Veloso-Peixoto
- 1994
(Show Context)
Citation Context |

2 |
An overview of lutess, a speci tool for testing synchronous software
- Bousquet, Zuanon
- 1999
(Show Context)
Citation Context ...tions with automata and functional denitions on transitions, and (3) in the thereby induced necessity for powerful constraint handlers on the grounds of Constraint Handling Rules (CHR, [15]). Lutess [=-=12-=-] is a tool for the generation of test cases for Lustre (as is Gatel [23], see above). The dierence with our approach is the use of model checkers or random number generators for the generation of tes... |