Small formulas for large programs: on-line constraint simplification in scalable static analysis

Authors:
Isil Dillig;Thomas Dillig;Alex Aiken
Affiliations:
Department of Computer Science, Stanford University;Department of Computer Science, Stanford University;Department of Computer Science, Stanford University
Venue:
SAS'10 Proceedings of the 17th international conference on Static analysis
Year:
2010

Citing 25
Cited 10

Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Partial online cycle elimination in inclusion constraint graphs

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
The SLAM project: debugging system software via static analysis

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lazy abstraction

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ESP: path-sensitive program verification in polynomial time

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Simplifying Interpreted Formulas

Proceedings of the 5th Conference on Automated Deduction
Fundamentals of Context=Sensitive Rewriting

SOFSEM '95 Proceedings of the 22nd Seminar on Current Trends in Theory and Practice of Informatics
Counterexample-guided abstraction refinement for symbolic model checking

Journal of the ACM (JACM)
Constraint contextual rewriting

Journal of Symbolic Computation - Special issue: First order theorem proving
Scalable error detection using boolean satisfiability

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
DAG-aware AIG rewriting a fresh look at combinational logic synthesis

Proceedings of the 43rd annual Design Automation Conference
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Journal of the ACM (JACM)
Calysto: scalable and precise extended static checking

Proceedings of the 30th international conference on Software engineering
Verifying the Safety of User Pointer Dereferences

SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
The Barcelogic SMT Solver

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
The MathSAT 4 SMT Solver

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Snugglebug: a powerful approach to weakest preconditions

Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Beaver: Engineering an Efficient SMT Solver for Bit-Vector Arithmetic

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Constrained decision diagrams

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
CVC3

CAV'07 Proceedings of the 19th international conference on Computer aided verification
A decision procedure for bit-vectors and arrays

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Z3: an efficient SMT solver

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Fluid updates: beyond strong vs. weak updates

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems

Symbolic heap abstraction with demand-driven axiomatization of memory invariants

Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Precise reasoning for programs using containers

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
MeCC: memory comparison-based clone detector

Proceedings of the 33rd International Conference on Software Engineering
Simplifying loop invariant generation using splitter predicates

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Automated error diagnosis using abductive inference

Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
Minimum satisfying assignments for SMT

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Identifying Untestable Faults in Sequential Circuits Using Test Path Constraints

Journal of Electronic Testing: Theory and Applications
Data-driven equivalence checking

Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
Inductive invariant generation via abductive inference

Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
Explain: a tool for performing abductive inference

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

Static analysis techniques that represent program states as formulas typically generate a large number of redundant formulas that are incrementally constructed from previous formulas. In addition to querying satisfiability and validity, analyses perform other operations on formulas, such as quantifier elimination, substitution, and instantiation, most of which are highly sensitive to formula size. Thus, the scalability of many static analysis techniques requires controlling the size of the generated formulas throughout the analysis. In this paper, we present a practical algorithm for reducing SMT formulas to a simplified form containing no redundant subparts. We present experimental evidence that on-line simplification of formulas dramatically improves scalability.