Skip to main content
Conference ProceedingsOPEN ACCESS

A weakest precondition semantics for an object-oriented language of refinement

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1709 1439-1459
DOI: 10.1007/3-540-48118-4_26
21Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

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 notions of refinement. Such results are a first step towards a refinement calculus.

Author supplied keywords

Cite

CITATION STYLE

APA

Cavalcanti, A., & Naumann, D. A. (1999). A weakest precondition semantics for an object-oriented language of refinement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1709, pp. 1439–1459). Springer Verlag. https://doi.org/10.1007/3-540-48118-4_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free