Existential quantification as incremental SAT

Authors:
Jörg Brauer;Andy King;Jael Kriener
Affiliations:
Embedded Software Laboratory, RWTH Aachen University, Germany;Portcullis Computer Security, Pinner, UK and School of Computing, University of Kent, UK;School of Computing, University of Kent, UK
Venue:
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Year:
2011

Citing 28
Cited 8

A Structure-preserving Clause Form Translation

Journal of Symbolic Computation
Implicit and incremental computation of primes and essential primes of Boolean functions

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Symbolic model checking: 1020 states and beyond

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Two classes of Boolean functions for dependency analysis

Science of Computer Programming
Predicate abstraction for software verification

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Faster SAT and smaller BDDs via common function structure

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
SAT-Based Image Computation with Application in Reachability Analysis

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Experience with Predicate Abstraction

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Abstract and Model Check While You Prove

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Applying SAT Methods in Unbounded Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Checking satisfiability of a conjunction of BDDs

Proceedings of the 40th annual Design Automation Conference
The Minimum Equivalent DNF Problem and Shortest Implicants

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Prime Implicant Computation Using Satisfiability Algorithms

ICTAI '97 Proceedings of the 9th International Conference on Tools with Artificial Intelligence
A SAT-based algorithm for reparameterization in symbolic simulation

Proceedings of the 41st annual Design Automation Conference
Efficient Preimage Computation Using A Novel Success-Driven ATPG

DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Computing Predicate Abstractions by Integrating BDDs and SMT Solvers

FMCAD '07 Proceedings of the Formal Methods in Computer Aided Design
A View from the Engine Room: Computational Support for Symbolic Model Checking

25 Years of Model Checking
The MathSAT 4 SMT Solver

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Model checking of software for microcontrollers

ACM Transactions on Embedded Computing Systems (TECS)
Range and Set Abstraction using SAT

Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic abstraction for intervals using Boolean formulae

SAS'10 Proceedings of the 17th international conference on Static analysis
Approximate quantifier elimination for propositional boolean formulae

NFM'11 Proceedings of the Third international conference on NASA Formal methods
CirCUs: a hybrid satisfiability solver

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
SMT techniques for fast predicate abstraction

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Quantifier elimination by lazy model enumeration

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Ranking function synthesis for bit-vector relations

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Widening ROBDDs with prime implicants

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Precise control flow reconstruction using boolean logic

EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Inferring definite counterexamples through under-approximation

NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
ALLQBF solving by computational learning

ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Loop leaping with closures

SAS'12 Proceedings of the 19th international conference on Static Analysis
FESA: fold- and expand-based shape analysis

CC'13 Proceedings of the 22nd international conference on Compiler Construction
Abstract interpretation of microcontroller code: Intervals meet congruences

Science of Computer Programming
Computing interpolants without proofs

HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing
SAT-Based analysis and quantification of information flow in programs

QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an elegant algorithm for existential quantifier elimination using incremental SAT solving. This approach contrasts with existing techniques in that it is based solely on manipulating the SAT instance rather than requiring any reengineering of the SAT solver or needing an auxiliary data-structure such as a BDD. The algorithm combines model enumeration with the generation of shortest prime implicants so as to converge onto a quantifier-free formula presented in CNF. We apply the technique to a number of hardware circuits and transfer functions to demonstrate the effectiveness of the method.