Extending a CP Solver with Congruences as Domains for Program Verification

Leconte, Michel; Berstel, Bruno

doi:10.1002/9780470612309.ch21

Cited by 11 publications

(10 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A program analysis is not a decision procedure, and interval analysis, like many other classical analyses, is not relational, but rather is an "independent attribute" analysis [Nielson et al 1999]. Leconte and Berstel [2006] discuss the potential and dangers of the constraint propagation approach in software verification. A finite-domain constraint satisfaction problem (CSP) [Marriott and Stuckey 1998] is a constraint (in conjunctive form) over the variables, together with a mapping D that associates a finite set of values with each variable.…”

Section: Bit Blasting and Constraint Propagation Approachesmentioning

confidence: 99%

“…(Bit-level reasoning can establish the unsatisfiability of 2x + 2y = 1 easily.) Leconte and Berstel [2006] propose the inclusion of arithmetical congruence constraints in the constraint propagation approach, effectively obtaining a CSP analogue of the RIC domain discussed in Section 9.4, by utilizing the analysis of Granger [1989] to develop propagators. This leads to much faster propagation overall.…”

Section: Bit Blasting and Constraint Propagation Approachesmentioning

confidence: 99%

See 1 more Smart Citation

Interval Analysis and Machine Arithmetic

Gange

Navas

Schachte

et al. 2015

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

The most commonly used integer types have fixed bit-width, making it possible for computations to "wrap around," and many programs depend on this behaviour. Yet much work to date on program analysis and verification of integer computations treats integers as having infinite precision, and most analyses that do respect fixed width lose precision when overflow is possible. We present a novel integer interval abstract domain that correctly handles wrap-around. The analysis is signedness agnostic. By treating integers as strings of bits, only considering signedness for operations that treat them differently, we produce precise, correct results at a modest cost in execution time.

show abstract

Section: Bit Blasting and Constraint Propagation Approachesmentioning

confidence: 99%

Section: Bit Blasting and Constraint Propagation Approachesmentioning

confidence: 99%

Interval Analysis and Machine Arithmetic

Gange

Navas

Schachte

et al. 2015

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

show abstract

“…Consistency between congruence domains and interval domains (i.e. all bounds of intervals respect the congruence) is enforced in a standard way with an additional consistency propagator [18].…”

Section: Congruence Domainmentioning

confidence: 99%

“…Intervals I are a standard abstract domain for N ≤M . The congruence domain C has been recently proposed [18]. In the context of CLP over abstract domains, it is interesting to consider new kinds of consistency.…”

Section: Efficient Clp Over Bounded Arithmeticmentioning

confidence: 99%

“…First, we set up the basic ingredients of a dedicated CLP(N ≤M BV ) framework, avoiding both bit-blasting and non-linear encoding into N ≤M . The paper introduces two main features: (1) N ≤M BV -propagators for existing domains (union of intervals with congruence [18], denoted Is/C), and (2) a new domain bit-list BL designed to work in combination with Is/C and BL-propagators. While Is/C comes with efficient propagators on linear arithmetic constraints, BL is equipped with efficient propagators on "linear" bitwise constraints, i.e.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Alternative to SAT-Based Approaches for Bit-Vectors

Bardin

Herrmann

Perroud

2010

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. The theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solvers for this theory are based on a bit-level encoding into propositional logic and SAT-based resolution techniques. In this paper, we investigate an alternative approach based on a word-level encoding into bounded arithmetic and Constraint Logic Programming (CLP) resolution techniques. We define an original CLP framework (domains and propagators) dedicated to bitvector constraints. This framework is implemented in a prototype and thorough experimental studies have been conducted. The new approach is shown to perform much better than standard CLP-based approaches, and to considerably reduce the gap with the best SAT-based BV solvers.

show abstract

OSMOSE: automatic structural testing of executables

Bardin

Herrmann

2011

Software Testing Verif & Rel

View full text Add to dashboard Cite

Verification is usually performed on a high‐level view of the software, either specification or program source code. However, in certain circumstances verification is more relevant when performed at the machine‐code level. This paper focuses on automatic test data generation from a stand‐alone executable. Low‐level analysis is much more difficult than high‐level analysis since even the control‐flow graph is not available and bit‐level instructions have to be modelled faithfully. The paper shows how ‘path‐based’ structural test data generation can be adapted from structured language to machine code, using both state‐of‐the‐art technologies and innovative techniques. The results have been implemented in a tool named OSMOSE and encouraging experiments have been conducted. Copyright © 2010 John Wiley & Sons, Ltd.

show abstract

Extending a CP Solver with Congruences as Domains for Program Verification

Cited by 11 publications

References 19 publications

Interval Analysis and Machine Arithmetic

Interval Analysis and Machine Arithmetic

An Alternative to SAT-Based Approaches for Bit-Vectors

OSMOSE: automatic structural testing of executables

Contact Info

Product

Resources

About