Relevance heuristics for program analysis
Special Interest Group on Programming Languages(2008)
摘要
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.
更多查看译文
关键词
abstract interpretation,craig interpolation,model checking
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络