Java Program Verification at Nijmegen: Developments and Perspective

TL;DR: In this article, the main result is representation independence: a rule for modular proof of equivalence of class implementations. But encapsulation is difficult to achieve in object-oriented programs owing to heap based structures and reentrant callbacks.

TL;DR: A generalization of standard typestate systems in which the typestate of each object is determined by its membership in a collection of abstract typestate sets, which characterizes global sharing patterns.

TL;DR: In this paper, the verification of sequential Java programs has been studied for the KIV system and used for smart card applications, and a calculus for verification of Java programs is presented.

TL;DR: We present a history of Hoare’s logic is a formalism allowing us to reason about program correctness.

TL;DR: The Extended Static Checker for Java (ESC/Java) is introduced, an experimental compile-time program checker that finds common programming errors and provides programmers with a simple annotation language with which programmer design decisions can be expressed formally.

TL;DR: PVS (Prototype Verification System) is an environment for constructing clear and precise specifications and for developing readable proofs that have been mechanically verified to exploit the synergies between language and deduction, automation and interaction, and theorem proving and model checking.

TL;DR: KeY is a tool that provides facilities for formal specification and verification of programs within a commercial platform for UML based software development and provides a state-of-the-art theorem prover for interactive and automated verification.

TL;DR: A runtime assertion checker for the Java Modeling Language (JML) that helps in assigning blame during debugging and in automatic generation of test oracles, which represents a significant advance over the current state of the art.