On theorem proving for program checking: historical perspective and recent developments

Authors:
Maria Paola Bonacina
Affiliations:
Università degli Studi di Verona, Verona, Italy
Venue:
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Year:
2010

Citing 84
Cited 4

Abstraction using generalization functions

Proc. of the 8th international conference on Automated deduction
On word problems in equational theories

14th International Colloquium on Automata, languages and programming
Theorem-proving with resolution and superposition

Journal of Symbolic Computation
On word problems in horn theories

Journal of Symbolic Computation
Proving refutational completeness of theorem-proving strategies: the transfinite semantic tree method

Journal of the ACM (JACM)
An algorithm for finding canonical sets of ground rewrite rules in polynomial time

Journal of the ACM (JACM)
A fast algorithm for generating reduced ground rewriting systems from a set of ground equations

Journal of Symbolic Computation
Distributed automated deduction

Distributed automated deduction
Equational inference, canonical proofs, and proof orderings

Journal of the ACM (JACM)
On Fourier's algorithm for linear arithmetic constraints

Journal of Automated Reasoning
Towards a foundation of completion procedures as semidecision procedures

Theoretical Computer Science
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
The Concept of Demodulation in Theorem Proving

Journal of the ACM (JACM)
Fast Decision Procedures Based on Congruence Closure

Journal of the ACM (JACM)
Reasoning About Recursively Defined Data Structures

Journal of the ACM (JACM)
Variations on the Common Subexpression Problem

Journal of the ACM (JACM)
Deciding Combinations of Theories

Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
An algorithm for reasoning about equality

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM
Automatic predicate abstraction of C programs

Proceedings of the ACM SIGPLAN 2001 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
Extended static checking for Java

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
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
Parametric shape analysis via 3-valued logic

ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementing the Davis–Putnam Method

Journal of Automated Reasoning
The verifying compiler: A grand challenge for computing research

Journal of the ACM (JACM)
A Generalization of Shostak's Method for Combining Decision Procedures

FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
An Efficient Decision Procedure for the Theory of Fixed-Sized Bit-Vectors

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Counterexample-Guided Abstraction Refinement

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
The Quest for Efficient Boolean Satisfiability Solvers

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
The grand challenge of Trusted Components

Proceedings of the 25th International Conference on Software Engineering
A rewriting approach to satisfiability procedures

Information and Computation - RTA 2001
A Decision Procedure for an Extensional Theory of Arrays

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Deconstructing Shostak

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Abstract Congruence Closure

Journal of Automated Reasoning
Abstractions from proofs

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model-Theoretic Methods in Combined Constraint Satisfiability

Journal of Automated Reasoning
Simplify: a theorem prover for program checking

Journal of the ACM (JACM)
An interpolating theorem prover

Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Abstract canonical presentations

Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures

Journal of Automated Reasoning
Interpolation for data structures

Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering
Abstract canonical inference

ACM Transactions on Computational Logic (TOCL)
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)
The design and implementation of VAMPIRE

AI Communications - CASC
E - a brainiac theorem prover

AI Communications - CASC
Fast congruence closure and extensions

Information and Computation
Rewrite-Based Satisfiability Procedures for Recursive Data Structures

Electronic Notes in Theoretical Computer Science (ENTCS)
Back to the future: revisiting precise program verification using SMT solvers

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On Variable-inactivity and Polynomial T-Satisfiability Procedures

Journal of Logic and Computation
Model-based Theory Combination

Electronic Notes in Theoretical Computer Science (ENTCS)
An improved algorithm for computing with equations

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Logical Interpretation: Static Program Analysis Using Theorem Proving

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Efficient E-Matching for SMT Solvers

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
New results on rewrite-based satisfiability procedures

ACM Transactions on Computational Logic (TOCL)
Finding Loop Invariants for Programs over Arrays Using a Theorem Prover

FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Verification using satisfiability checking, predicate abstraction, and craig interpolation

Verification using satisfiability checking, predicate abstraction, and craig interpolation
Theory decision by decomposition

Journal of Symbolic Computation
Model Checking Linear Programs with Arrays

Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient weakest preconditions

Information Processing Letters
Static and dynamic analysis: better together

APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
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
Quantified invariant generation using an interpolating saturation prover

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
Building SMT-based software model checkers: an experience report

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Superposition modulo linear arithmetic SUP(LA)

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Combinations of theories for decidable fragments of first-order logic

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Data structures with arithmetic constraints: a non-disjoint combination

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Combining theories with shared set operations

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Splitting on demand in SAT modulo theories

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
The spec# programming system: an overview

CASSIS'04 Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices
A fast linear-arithmetic solver for DPLL(T)

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Decidability and undecidability results for nelson-oppen and rewrite-based decision procedures

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A combination method for generating interpolants

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Integrating linear arithmetic into superposition calculus

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

SMT-based optimization for synchronous programs

Proceedings of the 14th International Workshop on Software and Compilers for Embedded Systems
On interpolation in decision procedures

TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
On Deciding Satisfiability by Theorem Proving with Speculative Inferences

Journal of Automated Reasoning
ConceVE: Conceptual modeling and formal validation for everyone

ACM Transactions on Modeling and Computer Simulation (TOMACS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article is a survey of recent results, related works and new challenges in automated theorem proving for program checking. The aim is to give some historical perspective, albeit necessarily incomplete, and highlight some of the turning points that made crucial advances possible.