Abstract Interpretation with a Theorem Prover

Abstract

This paper presents an approach to the implementation of the abstract interpretation style of program analysis by first constructing a logic for representing the process of abstract analysis, and then embedding this logic in the theorem prover HOL. Progr ams to be analysed undergo a two-phase process, first being mechanically transformed to an analysis model, and then this being used to test or verify program properties. A specific advantage of this approach is that it allows abstract interpretation to be used in a consistent framework with other analysis methods, such as Hoare Logic or exhaustive state space analysis.KeywordsConvex HullTransformation RuleLinear InequalityAbstract InterpretationEquivalence RuleThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.