A weakest precondition semantics for an object-oriented language of refinement-Reference-Cited by-同舟云学术

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

Published:1999 Issue: Volume: Page:1439-1459
ISSN:0302-9743
Container-title:FM’99 — Formal Methods
language:
Short-container-title:

Author:

Cavalcanti Ana,Naumann David A.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48118-4_26

Reference18 articles.

1. Pierre America and Frank de Boer. Reasoning about dynamically evolving process structures. Formal Aspects of Computing, 6:269–316, 1994.

2. Martíin Abadi and K. Rustan Leino. A logic of object-oriented programs. In Proceedings, TAPSOFT 1997. Springer-Verlag, 1997. Expanded in DEC SRC report 161.

3. R. J. R. Back and J. von Wright. Refinement Calculus: A Systematic Introduction. Graduate Texts in Computer Science. Springer-Verlag, 1998.

4. Lect Notes Comput Sci;M. M. Bonsangue,1998

5. Paulo Borba. Where are the laws of object-oriented programming? In I Brazilian Workshop on Formal Methods, pages 59–70, Porto Alegre, Brazil, 19th-21st October 1998.

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. rCOS: A Refinement Calculus of Internetware Systems;Internetware;2016

2. Graph transformations for object-oriented refinement;Formal Aspects of Computing;2009-02

3. A Graph-Based Operational Semantics of OO Programs;Formal Methods and Software Engineering;2009

4. Decoupling in Object Orientation;FM 2005: Formal Methods;2005

5. Pointer Theory and Weakest Preconditions without Addresses and Heap;Lecture Notes in Computer Science;2004