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.
| Original language | English |
|---|---|
| Pages (from-to) | 713-728 |
| Number of pages | 16 |
| Journal | IEEE Transactions on Software Engineering |
| Volume | 26 |
| Issue number | 8 |
| DOIs | |
| State | Published - 2000 |
Keywords
- Object-orientation
- Refinement calculi
- Semantic models
- Verification
Fingerprint
Dive into the research topics of 'A weakest precondition semantics for refinement of object-oriented programs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver