A Weakest Precondition Semantics for Refinement of Object-oriented Programs

Cavalcanti, A.L.C. and Naumann, D.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 . (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)

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
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Faculties > Science Technology and Medical Studies > School of Computing > Systems Architecture Group
Depositing User: Mark Wheadon
Date Deposited: 09 Sep 2009 16:20
Last Modified: 09 Sep 2009 16:20
Resource URI: http://kar.kent.ac.uk/id/eprint/21996 (The current URI for this page, for reference purposes)
  • Depositors only (login required):