Implementing a Program Logic of Objects in a Higher-Order Logic Theorem Prover

Authors:
Martin Hofmann;Francis Tang
Affiliations:
-;-
Venue:
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Year:
2000

Citing 2
Cited 0

The Theory and Practice of Concurrency

The Theory and Practice of Concurrency
A Logic of Object-Oriented Programs

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an implementation of a program logic of objects, extending that (AL) of Abadi and Leino. In particular, the implementation uses higher-order abstract syntax (HOAS) and--unlike previous approaches using HOAS--at the same time uses the built-in higher-order logic of the theorem prover to formulate specifications. We give examples of verifications, extending those given in [1], that have been attempted with the implementation. Due to the mixing of HOAS and built-in logic the soundness of the encoding is nontrivial. In particular, unhke in other HOAS encodings of program logics, it is not possible to directly reduce normal proofs in the higher-order system to proofs in the first-order object logic.