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)

Volumn 1709, Issue , 1999, Pages 1439-1459

  Cavalcanti, Ana ^a   Naumann, David A ^b  

^a FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

^b Stevens Institute of Technology   (United States)

Author keywords

Object orientation; Refinement calculi; Semantic models; Verification

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; PATHOLOGY; SEMANTICS; VERIFICATION;

DYNAMIC BINDING; OBJECT ORIENTATION; PREDICATE TRANSFORMER SEMANTICS; RECURSIVE METHODS; REFINEMENT CALCULI; SEMANTIC MODEL; VISIBILITY CONTROL; WEAKEST PRECONDITION;

FORMAL METHODS;

EID: 84949511863     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48118-4_26     Document Type: Conference Paper

References (18)

1. Pierre America and Frank de Boer. Reasoning about dynamically evolving process structures. Formal Aspects of Computing, 6:269-316, 1994.
2. Martin 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. Marcello M. Bonsangue, Joost N. Kok, and Kaisa Sere. An approach to object-orientation in action systems. In Johan Jeuring, ed., Mathematics of Program Construction, LNCS 1422, pages 68-95. Springer, 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.
6. A. L. C. Cavalcanti and D. A. Naumann. A Weakest Precondition Semantics for an Object-oriented Language of Refinement - Extended Version. Available at http://www.di.ufpe.br/~alcc
7. A. L. C. Cavalcanti, A. C. A. Sampaio, and J. C. P. Woodcock. Procedures and Recursion in the Refinement Calculus. Journal of the Brazilian Computer Society, 5(1):1-15, 1998.
8. A. L. C. Cavalcanti, A. Sampaio, and J. C. P. Woodcock. An inconsistency in procedures, parameters, and substitution in the refinement calculus. Science of Computer Programming, 33(1):87-96, 1999.
9. C. A. R. Hoare and J. He. Unifying Theories of Programming. Prentice Hall, 1998.
10. C. A. R. Hoare and J. He and J. W. Sanders. Prespecification in data refinement. Information Processing Letters, 25(2), 1987.
11. Kevin Lano. Formal Object-Oriented Development. Springer, 1995.
12. K. Rustan M. Leino. Recursive object types in a logic of object-oriented programming. In Chris Hankin, ed., 7th European Symposium on Programming, LNCS 1381. Springer, 1998.
13. Barbara H. Liskov and Jeannette M. Wing. A behavioral notion of subtyping. ACM Transactions on Programming Languages and Systems, 16(6), 1994.
14. A. Mikhajlova and E. Sekerinski, Class refinement and interface refinement in object-oriented programs. In Proceedings of FME'97: Industrial Benefit of Formal Methods. Springer, 1997.
15. Carroll Morgan. Programming from Specifications, 2ed. Prentice Hall, 1994.
16. David A. Naumann. Validity of data refinement for a higher order imperative language. Submitted.
17. David A. Naumann. Predicate transformer semantics of a higher order imperative language with record subtypes. Science of Computer Programming, 1998. To appear.
18. U. S. Reddy. Objects and classes in Algol-like languages. In Fifth Intern. Workshop on Foundations of Object-oriented Languages.URL: http://pauillac.inria.fr/remy/fool/proceedings.html, Jan 1998.