Logical Interpretation: Static Program Analysis Using Theorem Proving

Authors:
Ashish Tiwari;Sumit Gulwani
Affiliations:
SRI International, Menlo Park, CA 94025,;Microsoft Research, Redmond, WA 98052,
Venue:
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Year:
2007

Citing 17
Cited 9

Detecting equality of variables in programs

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Detecting Equalities of Variables: Combining Efficiency with Precision

SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Little Engines of Proof

FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Testing Equivalence of Morphisms on Context-Free Languages

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Precise interprocedural analysis through linear algebra

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Combining abstract interpreters

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
The octagon abstract domain

Higher-Order and Symbolic Computation
Computing procedure summaries for interprocedural analysis

ESOP'07 Proceedings of the 16th European conference on Programming
Assertion checking unified

VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
An abstract domain for analyzing heap-manipulating low-level software

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Checking herbrand equalities and beyond

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Join algorithms for the theory of uninterpreted functions

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Assertion checking over combined abstraction of linear arithmetic and uninterpreted functions

ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems

Logical foundation for static analysis: application to binary static analysis for security

ACM SIGAda Ada Letters
Predicate Abstraction in a Program Logic Calculus

IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Invariant Checking for Programs with Procedure Calls

SAS '09 Proceedings of the 16th International Symposium on Static Analysis
On theorem proving for program checking: historical perspective and recent developments

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
The reduced product of abstract domains and the combination of decision procedures

FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Predicate abstraction in a program logic calculus

Science of Computer Programming
Incremental computation of succinct abstractions for hybrid systems

FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Theories, solvers and static analysis by abstract interpretation

Journal of the ACM (JACM)
Abstract satisfaction

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of logical lattices--- a class of lattices defined on logical formulas in a logical theory --- in an abstract interpretation framework. Abstract interpretation over logical lattices, called logical interpretation, raises new challenges for theorem proving. We present an overview of some of the existing results in the field of logical interpretation and outline some requirements for building expressive and scalable logical interpreters.