Modular Proof Principles for Parameterised Concretizations [chapter]

David Pichardie
2006 Lecture Notes in Computer Science  
interpretation is a particularly well-suited methodology to build modular correctness proof of static analysers. Proof modularity becomes essential when correctness proof is machine checked for realistic languages To deal with complex concrete and abstract domains, the notion of parameterised concretization has been proposed to allow a structural decomposition of the abstract domain and its concretization. In this paper we develop proof principles for such concretizations, based on the
more » ... al notion of concretization functor, with the aim of obtaining modular correctness proofs. Our technique has been tested on a machine-checked correctness proof of a static analysis for a Java-like bytecode language.
doi:10.1007/11741060_8 fatcat:kjuawjvlcjhlfmphatdxwb5ngm