On Solving Presburger and Linear Arithmetic with SAT

Authors:
Ofer Strichman
Affiliations:
-
Venue:
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Year:
2002

Citing 14
Cited 18

A practical algorithm for exact array dependence analysis

Communications of the ACM
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic

ACM Transactions on Computational Logic (TOCL)
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Experiences with Constraint-based Array Dependence Analysis

PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Validity Checking for Combinations of Theories with Equality

FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
BDD Based Procedures for a Theory of Equality with Uninterpreted Functions

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Deciding Equality Formulas by Small Domains Instantiations

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Boolean Satisfiability with Transitivity Constraints

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
ICS: Integrated Canonizer and Solver

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Deciding Separation Formulas with SAT

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
IMPS: System Description

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Exploiting Positive Equality in a Logic of Equality with Uninterpreted Functions

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Reducing Bitvector Satisfiability Problems to Scale Down Design Sizes for RTL Property Checking

HLDVT '01 Proceedings of the Sixth IEEE International High-Level Design Validation and Test Workshop (HLDVT'01)

An efficient finite-domain constraint solver for circuits

Proceedings of the 41st annual Design Automation Conference
RTL SAT simplification by Boolean and interval arithmetic reasoning

ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures

Journal of Automated Reasoning
Efficient theory combination via boolean search

Information and Computation - Special issue: Combining logical systems
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Journal of the ACM (JACM)
Interactive presentation: Image computation and predicate refinement for RTL verilog using word level proofs

Proceedings of the conference on Design, automation and test in Europe
Symbolic and Abstract Interpretation for C/C++ Programs

Electronic Notes in Theoretical Computer Science (ENTCS)
Decision Procedures for the Grand Challenge

Verified Software: Theories, Tools, Experiments
A Unified Approach to Abstract Interpretation, Formal Verification and Testing of C/C++ Modules

Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Automated reasoning in modal and description logics via SAT encoding: the case study of KmALC-satisfiability

Journal of Artificial Intelligence Research
An extension of the Davis-Putnam procedure and its application to preprocessing in SMT

Proceedings of the 7th International Workshop on Satisfiability Modulo Theories
Integrating a SAT Solver with an LCF-style Theorem Prover

Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of data paths using unbounded integers: automata strike back

HVC'06 Proceedings of the 2nd international Haifa verification conference on Hardware and software, verification and testing
Decision procedures for SAT, SAT modulo theories and beyond. the barcelogictools

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Efficient satisfiability modulo theories via delayed theory combination

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Integrated and automated abstract interpretation, verification and testing of c/c++ modules

Concurrency, Compositionality, and Correctness
Approximating predicate images for bit-vector logic

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A method for symbolic computation of abstract operations

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show a reduction to propositional logic from quantifier-free Presburger arithmetic, and disjunctive linear arithmetic, based on Fourier-Motzkin elimination. While the complexity of this procedure is not better than competing techniques, it has practical advantages in solving verification problems. It also promotes the option of deciding a combination of theories by reducing them to this logic.