A Weakest Precondition Semantics for an Object-oriented Language of Refinement (1999)
| Venue: | Lecture Notes in Computer Science 1708 |
| Citations: | 29 - 9 self |
BibTeX
@INPROCEEDINGS{Cavalcanti99aweakest,
author = {Ana Cavalcanti and David A. Naumann},
title = {A Weakest Precondition Semantics for an Object-oriented Language of Refinement},
booktitle = {Lecture Notes in Computer Science 1708},
year = {1999},
pages = {1439--1459},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We define a predicate-transformer semantics for an object-oriented language that includes specification constructs from refinement calculi. The language includes recursive classes, visibility control, dynamic binding, and recursive methods. Using the semantics, we formulate basic notions of refinement, with respect to which the constructs are shown to be monotonic. Such results are a first step towards a refinement calculus. The step is not trivial, because of the number of features in the language and especially the complexity of dynamic binding.
