Range and Set Abstraction using SAT

Authors:
Edd Barrett;Andy King
Affiliations:
School of Computing, University of Kent, Canterbury, England;School of Computing, University of Kent, Canterbury, England
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2010

Citing 15
Cited 5

A Structure-preserving Clause Form Translation

Journal of Symbolic Computation
Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Solving the incremental satisfiability problem

Journal of Logic Programming
SATIRE: a new incremental satisfiability engine

Proceedings of the 38th annual Design Automation Conference
Recovery of jump table case statements from binary code

Science of Computer Programming - Special issue on program comprehension (IWPC '99)
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A static analyzer for large safety-critical software

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Obfuscation of executable code to improve resistance to static disassembly

Proceedings of the 10th ACM conference on Computer and communications security
The octagon abstract domain

Higher-Order and Symbolic Computation
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Journal of the ACM (JACM)
An Abstract Interpretation-Based Framework for Control Flow Reconstruction from Binaries

VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Why does Astrée scale up?

Formal Methods in System Design
Two variables per linear inequality as an abstract domain

LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
A scalable segmented decision tree abstract domain

Time for verification
Automatic abstraction for intervals using Boolean formulae

SAS'10 Proceedings of the 17th international conference on Static analysis

Transfer function synthesis without quantifier elimination

ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Existential quantification as incremental SAT

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Precise control flow reconstruction using boolean logic

EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Bilateral algorithms for symbolic abstraction

SAS'12 Proceedings of the 19th international conference on Static Analysis
Abstract interpretation of microcontroller code: Intervals meet congruences

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Symbolic decision trees are not the only way to correlate the relationship between flags and numeric variables. Boolean formulae can also represent such relationships where the integer variables are modelled with bit-vectors of propositional variables. Boolean formulae can be composed to express the semantics of a block and program state, but they are hardly tractable, hence the need to compute their abstractions. This paper shows how incremental SAT can be applied to derive range and set abstractions for bit-vectors that are constrained by Boolean formulae.