### Citations

1267 |
Interval analysis
- Moore
- 1966
(Show Context)
Citation Context ...connection between the concrete domain and the abstract domain of intervals. The approximation of transfert functions is realized by using their structure and classical results from Interval Analysis =-=[27]-=-. For example, functions [x ≤ y] and [x = y + z] are abstracted by the following (sound) approximations: [x ≤ y]] : ([a,b], [c,d]) → ([a,min(b,d)], [max(a,c),d])) and [x = y+ z]] : ([a,b], [c,d], [e, ... |

835 | DART: Directed automated random testing
- Godefroid, Klarlund, et al.
- 2005
(Show Context)
Citation Context ... state search space. However, both strategies are quite powerful and have been implemented into several software model checkers based on constraint solving [25, 16] and automated test case generators =-=[29, 18, 17, 8, 3]-=-. In this paper, we present an integrated constraint-based strategy that can benefit from the strengths of both forward and backward analysis. The keypoint of the approach, that we have called Constra... |

725 | Automatic discovery of linear restraints among variables of a program
- Cousot, Halbwachs
- 1978
(Show Context)
Citation Context ...performed by f . Depending on whether the abstract poset is a complete lattice or not, we have distinct theoretical results regarding the abstraction. Proofs of the following theorems can be found in =-=[11]-=-. Galois connection When the abstract poset is a complete lattice, the notion of Galois connection is available to link the abstract computations with the concrete lattice. Definition 3 (Galois connec... |

409 |
Programming with Constraints: An Introduction
- Marriott, Stuckey
- 1998
(Show Context)
Citation Context ...ariable has a support in the domain of the other variable. The standard extension of arc-consistency for constraints of more than two variables is domainconsistency (also called hyper-arc consistency =-=[26]-=-). Roughly speaking, the abstraction that underpins domain-consistency filtering aims at considering each variable domain separately, instead of considering the Cartesian product of each individual do... |

353 | Constant propagation with conditional branches
- Wegman, Zadeck
- 1985
(Show Context)
Citation Context ... denotes the state after execution, Dec is a boolean syntactical expression, and Body is a list of statements. This three-states consideration is inspired by the Static Single Assignment of a program =-=[28]-=-. If the state of M is irrelevant for a given computation, we simply write . Note that Body may also contain other iterators, and thus w is meant to be a compositional operator. The semantics of w is ... |

114 |
Automatic test data generation using constraint solving techniques
- Gotlieb, Botella, et al.
- 1998
(Show Context)
Citation Context ...R to program exploration results in a semi-correct procedure only, meaning that there is no termination guarantee. CBR has been mainly applied in automatic test data generation for iterative programs =-=[21, 22]-=-, programs that manipulate pointers towards named locations of the memory [23, 24], programs on dynamic data structures and anonymous locations [7], programs containing floating-point computations [5]... |

104 | The essence of constraint propagation.
- Apt
- 1999
(Show Context)
Citation Context ...f the expression is non-linear, then a linear approximation is derived when available and added to the polyhedron (case 3). 3 Filtering consistencies as abstract domain computations As noticed by Apt =-=[1]-=-, constraint propagation algorithms can be seen as instances of algorithms that deal with chaotic iteration. In this context, chaotic means fair application of propagators until saturation. In this se... |

52 | Pathcrawler: Automatic generation of path tests by combining static and dynamic analysis
- Williams, Mouy, et al.
- 2005
(Show Context)
Citation Context ... state search space. However, both strategies are quite powerful and have been implemented into several software model checkers based on constraint solving [25, 16] and automated test case generators =-=[29, 18, 17, 8, 3]-=-. In this paper, we present an integrated constraint-based strategy that can benefit from the strengths of both forward and backward analysis. The keypoint of the approach, that we have called Constra... |

46 | C.: Symbolic execution of floating-point computations
- Botella, Gotlieb, et al.
- 2006
(Show Context)
Citation Context ...22], programs that manipulate pointers towards named locations of the memory [23, 24], programs on dynamic data structures and anonymous locations [7], programs containing floating-point computations =-=[5]-=-. A major improvement of the approach was brought by the usage of Abstract Interpretation techniques to enrich the filtering capabilities of the constraints used to represent conditionals and loops [1... |

19 | TCAS software verification using constraint programming
- Gotlieb
(Show Context)
Citation Context ...have illustrated these notions with several examples in order to ease the understanding of the reader. This appraoch has been implemented and tested on several problems, including real-world programs =-=[19, 20]-=-. The goal is now to broader the scope of these techniques that combine constraint reasoning and abstraction techniques, to adress fundamental problems such as reachability in infinite-state systems. ... |

14 |
Cousot (1977): Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints
- Cousot, R
(Show Context)
Citation Context ...ation of the w constraint for handling iterative constructions while Sec.5 concludes the paper. 2 Background Abstract Interpretation (AI) is a theoretical framework introduced by Cousot and Cousot in =-=[10]-=- to manipulate abstractions of program states. An abstraction can be used to simplify program analysis problems otherwise not computable in realistic time, to manageable problems more easily solvable.... |

13 | OSMOSE: Automatic Structural Testing of Executables
- Bardin, Herrmann
(Show Context)
Citation Context ... state search space. However, both strategies are quite powerful and have been implemented into several software model checkers based on constraint solving [25, 16] and automated test case generators =-=[29, 18, 17, 8, 3]-=-. In this paper, we present an integrated constraint-based strategy that can benefit from the strengths of both forward and backward analysis. The keypoint of the approach, that we have called Constra... |

12 |
Euclide: A constraint-based testing platform for critical c programs
- Gotlieb
- 2009
(Show Context)
Citation Context ...es to enrich the filtering capabilities of the constraints used to represent conditionals and loops [14, 15]. This approach permitted us to build efficient test data generator tools for a subset of C =-=[19]-=- and Java Bytecode [8]. The first contribution of this paper is the interpretation of classical filtering consistencies notions in terms of abstract domain computations. Constraint filtering is the ma... |

11 | An abstract interpretation based combinator for modeling while loops in constraint programming
- Denmat, Gotlieb, et al.
- 2007
(Show Context)
Citation Context ...5]. A major improvement of the approach was brought by the usage of Abstract Interpretation techniques to enrich the filtering capabilities of the constraints used to represent conditionals and loops =-=[14, 15]-=-. This approach permitted us to build efficient test data generator tools for a subset of C [19] and Java Bytecode [8]. The first contribution of this paper is the interpretation of classical filterin... |

4 |
Testing abstract distributed programs and their implementations: A constraint-based approach
- Carver
- 1996
(Show Context)
Citation Context ... infinite-state system. Several authors have advocated the usage of constraints to represent an infinite set of states and the usage of constraint solvers to efficiently address reachability problems =-=[6, 13, 16, 4]-=-. In automated program verification problems, the goal is to find a state of the program which violates a given safety property, i.e., an unsafe state. Two distinct strategies have been investigated t... |

3 |
Enea Zaffanella & Patricia M. Hill (2002): Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library
- Bagnara, Ricci
(Show Context)
Citation Context ...is awaked without being succesfull in solving one of the guarded-constraint. As a consequence, we found out that it was not reasonable to use standard libraries to compute over polyhedra, such as PPL =-=[2]-=-, because they use a dual representation for Polyhedra, which is a source of exponential time computations for the conversion. 4.5 Illustrative example Looking at an iterative computation over unbound... |

3 |
Cadar & Dawson Engler (2008): RWset: Attacking path explosion in constraintbased test generation
- Boonstoppel, Cristian
(Show Context)
Citation Context ... infinite-state system. Several authors have advocated the usage of constraints to represent an infinite set of states and the usage of constraint solvers to efficiently address reachability problems =-=[6, 13, 16, 4]-=-. In automated program verification problems, the goal is to find a state of the program which violates a given safety property, i.e., an unsafe state. Two distinct strategies have been investigated t... |

3 |
Gotlieb (2009): Modelling dynamic memory management in Constraint-Based Testing
- Charreteur, Botella, et al.
(Show Context)
Citation Context ...tic test data generation for iterative programs [21, 22], programs that manipulate pointers towards named locations of the memory [23, 24], programs on dynamic data structures and anonymous locations =-=[7]-=-, programs containing floating-point computations [5]. A major improvement of the approach was brought by the usage of Abstract Interpretation techniques to enrich the filtering capabilities of the co... |

3 |
Gotlieb (2010): Constraint-Based Test Input Generation for Java Bytecode
- Charreteur, A
(Show Context)
Citation Context |

3 |
Cousot & Radhia Cousot (1976): Static Determination of dynamic properties of programs
- Patrick
(Show Context)
Citation Context ...ice from this element. The fix point is still an over-approximation of the concrete semantics. 2.1 Examples of abstract domains In this section, we briefly describe two abstract domains: the Interval =-=[12]-=- and the Polyhedral [11] domains. 2.1.1 The Interval abstract domain Interval analysis aims at approximating a set of values by an interval of possible values. If IN = {[a,b] | a,b ∈ N∪{−∞,+∞}}, then ... |

3 |
Delzanno & Andreas Podelski (2001): Constraint-based deductive model checking
- Giorgio
(Show Context)
Citation Context ... infinite-state system. Several authors have advocated the usage of constraints to represent an infinite set of states and the usage of constraint solvers to efficiently address reachability problems =-=[6, 13, 16, 4]-=-. In automated program verification problems, the goal is to find a state of the program which violates a given safety property, i.e., an unsafe state. Two distinct strategies have been investigated t... |

3 |
Ducasse (2007): Improving Constraint-Based Testing with Dynamic Linear Relaxations
- Denmat, Gotlieb, et al.
(Show Context)
Citation Context ...5]. A major improvement of the approach was brought by the usage of Abstract Interpretation techniques to enrich the filtering capabilities of the constraints used to represent conditionals and loops =-=[14, 15]-=-. This approach permitted us to build efficient test data generator tools for a subset of C [19] and Java Bytecode [8]. The first contribution of this paper is the interpretation of classical filterin... |

3 |
Franz Wotawa (2007): Test-Case Generation and Coverage Analysis for Nondeterministic Systems Using Model-Checkers
- Fraser
(Show Context)
Citation Context |

3 |
Rueher (2000): A CLP Framework for Computing Structural Test Data
- Gotlieb, Botella, et al.
(Show Context)
Citation Context ...R to program exploration results in a semi-correct procedure only, meaning that there is no termination guarantee. CBR has been mainly applied in automatic test data generation for iterative programs =-=[21, 22]-=-, programs that manipulate pointers towards named locations of the memory [23, 24], programs on dynamic data structures and anonymous locations [7], programs containing floating-point computations [5]... |

3 |
Botella (2005): Constraint-based test data generation in the presence of stack-directed pointers
- Gotlieb, Denmat, et al.
(Show Context)
Citation Context ...ere is no termination guarantee. CBR has been mainly applied in automatic test data generation for iterative programs [21, 22], programs that manipulate pointers towards named locations of the memory =-=[23, 24]-=-, programs on dynamic data structures and anonymous locations [7], programs containing floating-point computations [5]. A major improvement of the approach was brought by the usage of Abstract Interpr... |

3 |
Botella (2007): Goal-oriented test data generation for pointer programs
- Gotlieb, Denmat, et al.
(Show Context)
Citation Context ...ere is no termination guarantee. CBR has been mainly applied in automatic test data generation for iterative programs [21, 22], programs that manipulate pointers towards named locations of the memory =-=[23, 24]-=-, programs on dynamic data structures and anonymous locations [7], programs containing floating-point computations [5]. A major improvement of the approach was brought by the usage of Abstract Interpr... |

3 |
Sutre (2003): Software verification with Blast
- Henzinger, Jhala, et al.
(Show Context)
Citation Context ...e of the targeted unsafe state to refine the state search space. However, both strategies are quite powerful and have been implemented into several software model checkers based on constraint solving =-=[25, 16]-=- and automated test case generators [29, 18, 17, 8, 3]. In this paper, we present an integrated constraint-based strategy that can benefit from the strengths of both forward and backward analysis. The... |