Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
A framework for combining analysis and verification
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An axiomatic basis for computer programming
Communications of the ACM
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
Double Description Method Revisited
Selected papers from the 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
| Hi-index | 0.00 |
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. Programs 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.