Abstract

Abstract. We describe an executable specification of the Java Virtual Machine (JVM) within the Coq proof assistant. The principal features of the development are that it is executable, meaning that it can be tested against a real JVM to gain confidence in the correctness of the specification; and that it has been written with heavy use of dependent types, this is both to structure the model in a useful way, and to constrain the model to prevent spurious partiality. We describe the structure of the formalisation and the way in which we have used dependent types. 1

Citations

1022	The Java Virtual Machine Specification - Lindholm, Yellin - 1996
1016	Proof-carrying code - NECULA - 1997
340	Interactive theorem proving and program development. Coq’Art: The calculus of inductive constructions - Bertot, Castéran - 2004
247	The Java Memory Model - Manson, Pugh, et al. - 2005
186	Formal certification of a compiler back-end or: programming a compiler with a proof assistant - Leroy - 2006
164	Dynamics class loading in the Java virtual machine - Liang, Bracha - 1998
80	A machine-checked model for a Java-like language, virtual machine and compiler - Klein, Nipkow, et al.
60	Towards a mechanized metatheory of Standard ML - Lee, Crary, et al.
19	Executable JVM model for analytical reasoning: A study - Liu, Moore - 2005
16	Formalising Java’s data race free guarantee - Aspinall, Sěvčík - 2007
8	de Sousa. A Formal Executable Semantics of the JavaCard Platform - Barthe, Dufay, et al. - 2001