Checking well-formedness of pure-method specifications (2008)
| Venue: | Eds.): Proc. Int. Symp. Formal Methods. Vol. 5014 of LNCS (Springer-Verlag |
| Citations: | 10 - 3 self |
BibTeX
@INPROCEEDINGS{Rudich08checkingwell-formedness,
author = {Arsenii Rudich and Ádám Darvas and Peter Müller},
title = {Checking well-formedness of pure-method specifications},
booktitle = {Eds.): Proc. Int. Symp. Formal Methods. Vol. 5014 of LNCS (Springer-Verlag},
year = {2008},
pages = {68--83}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Contract languages such as JML and Spec # specify invariants and pre- and postconditions using side-effect free expressions of the programming language, in particular, pure methods. For such contracts to be meaningful, they must be well-formed: First, they must respect the partiality of operations, for instance, the preconditions of pure methods used in the contract. Second, they must enable a consistent encoding of pure methods in a program logic, which requires that their specifications are satisfiable and that recursive specifications are well-founded. This paper presents a technique to check well-formedness of contracts. We give proof obligations that are sufficient to guarantee the existence of a model for the specification of pure methods. We improve over earlier work by providing a systematic solution including a soundness result and by supporting more forms of recursive specifications. Our technique has been implemented in the Spec # programming system. 1
