Relevance heuristics for program analysis

Authors:
K. L. McMillan
Affiliations:
Cadence Research Labs, Berkeley, CA
Venue:
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
2008

Citing 0
Cited 3

Abstractions from tests

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Sciduction: combining induction, deduction, and structure for verification and synthesis

Proceedings of the 49th Annual Design Automation Conference
An abstract interpretation framework for refactoring with application to extract methods with contracts

Proceedings of the ACM international conference on Object oriented programming systems languages and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where needed, while maintaining scalability. In this talk I will discuss the principles by which SAT solvers and other decision procedures decide what information is relevant to a given proof. Then we will see how these ideas can be exploited in program verification using the method of Craig interpolation. The result is an analysis that is finely tuned to prove a given property of a program. At the end of the talk, I will cover some recent research in this area, including the use of interpolants for verifying heap-manipulating programs.