Extending Constraint-Only Representation of Polyhedra with Boolean Constraints - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Extending Constraint-Only Representation of Polyhedra with Boolean Constraints

Alexey Bakhirkin
  • Function : Author
  • PersonId : 1028653
David Monniaux

Abstract

We propose a new relational abstract domain for analysing programs with numeric and Boolean variables. The main idea is to represent an abstract state as a set of linear constraints over numeric variables, with every constraint being enabled by a formula over Boolean variables. This allows us, unlike in some existing approaches, to avoid duplicating linear constraints shared by multiple Boolean formulas. To perform domain operations, we adapt algorithms from constraint-only representation of convex polyhedra, most importantly Fourier-Motzkin elimination and projection-based convex hull. We made a prototype implementation of the new domain in our abstract interpreter for Horn clauses. Our initial experiments are, in our opinion, promising and show directions for future improvement.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
sas18.pdf (261.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01841837 , version 1 (17-07-2018)
hal-01841837 , version 2 (23-01-2019)

Identifiers

Cite

Alexey Bakhirkin, David Monniaux. Extending Constraint-Only Representation of Polyhedra with Boolean Constraints. 25th Static Analysis Symposium (SAS 2018), Aug 2018, Freiburg im Breisgau, Germany. pp.127-145, ⟨10.1007/978-3-319-99725-4_10⟩. ⟨hal-01841837v2⟩
147 View
415 Download

Altmetric

Share

Gmail Facebook X LinkedIn More