论文信息 - A bytecode logic for JML and types (Isabelle/HOL sources)

A bytecode logic for JML and types (Isabelle/HOL sources)

This document contains the Isabelle/HOL sources underlying our paper A bytecode logic for JML and types [2], updated to Isabelle 2008. We present a program logic for a subset of sequential Java bytecode that is suitable for representing both, features found in high-level specication language JML as well as interpretations of high-level type sys

Lennart Beringer | Martin Hofmann

[1] Martin Hofmann,et al. A Bytecode Logic for JML and Types , 2006, APLAS.

[2] Alan Bundy,et al. Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[3] Martin Hofmann,et al. Automatic Certification of Heap Consumption , 2004, LPAR.

[4] Peter Müller,et al. A Logic for Bytecode , 2004 .

[5] Uday S. Reddy,et al. Global state considered unnecessary: An introduction to object-based semantics , 1996, LISP Symb. Comput..

[6] Martin Hofmann,et al. Static prediction of heap space usage for first-order functional programs , 2003, POPL '03.

[7] David Cachera,et al. Certified Memory Usage Analysis , 2005, FM.

[8] Reiner Hähnle,et al. Verification of Safety Properties in the Presence of Transactions , 2004, CASSIS.

[9] A. Deutsch,et al. A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations , 1992, Proceedings of the 1992 International Conference on Computer Languages.