Skip to main content
Article thumbnail
Location of Repository

Logical interpretation: Static program analysis using theorem proving

By Ashish Tiwari and Sumit Gulwani

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

Year: 2007
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.7378
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.csl.sri.com/~tiwari... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.