Logical Interpretation: Static Program Analysis Using Theorem Proving

@inproceedings{Tiwari2007LogicalIS,
  title={Logical Interpretation: Static Program Analysis Using Theorem Proving},
  author={Ashish Tiwari and Sumit Gulwani},
  booktitle={CADE},
  year={2007}
}
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… CONTINUE READING
Highly Cited
This paper has 30 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 25 references

Forward relational infinitary static analysis, 2005. Lecture Notes, Available at http://web.mit.edu/afs/athena.mit.edu/course/16/16.399/www

  • P. Cousot
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…