Weakest Precondition Reasoning for Java Programs with JML Annotations (2002)
| Venue: | Journal of Logic and Algebraic Programming |
| Citations: | 16 - 2 self |
BibTeX
@ARTICLE{Jacobs02weakestprecondition,
author = {Bart Jacobs},
title = {Weakest Precondition Reasoning for Java Programs with JML Annotations},
journal = {Journal of Logic and Algebraic Programming},
year = {2002},
volume = {58},
pages = {2004}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper distinguishes several different approaches to organising a Weakest Precondition (WP) calculus in a theorem prover. The implementation of two of these approaches for Java within the LOOP project is described. This involves the WP-infrastructures in the higher order logic of the theorem prover PVS, together with some associated rules and strategies for automatically proving JML specifications for Java implementations. The soundness of all WP-rules has been proven on the basis of the underlying Java semantics. These WP-calculi are integrated with the existing Hoare logic, and together form a verification toolkit in PVS: typically one uses Hoare logic rules to break a large verification task up into smaller parts that can be handled automatically by one of the WP-strategies.
