Skip to main content

A Weakest Precondition Semantics for Refinement of Object-oriented Programs

Cavalcanti, Ana L. C., Naumann, David A. (2000) A Weakest Precondition Semantics for Refinement of Object-oriented Programs. IEEE Transactions on Software Engineering, 26 (8). pp. 713-728. ISSN 0098-5589. (doi:10.1007/3-540-48118-4_26) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:21996)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.
Official URL
http://dx.doi.org/10.1007/3-540-48118-4_26

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 toward a refinement calculus.

Item Type: Article
DOI/Identification number: 10.1007/3-540-48118-4_26
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 09 Sep 2009 16:20 UTC
Last Modified: 16 Nov 2021 10:00 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/21996 (The current URI for this page, for reference purposes)
  • Depositors only (login required):