## Semantics and Logic of Object Calculi (2002)

### Cached

### Download Links

- [basics.sjtu.edu.cn]
- [www.cogs.susx.ac.uk]
- DBLP

### Other Repositories/Bibliography

Venue: | Theoretical Computer Science |

Citations: | 13 - 3 self |

### BibTeX

@ARTICLE{Reus02semanticsand,

author = {Bernhard Reus and Thomas Streicher},

title = {Semantics and Logic of Object Calculi},

journal = {Theoretical Computer Science},

year = {2002},

volume = {316},

pages = {2004}

}

### Years of Citing Articles

### OpenURL

### Abstract

The main contribution of this paper is a formal characterization of recursive object specifications based on a denotational untyped semantics of the object calculus and the discussion of existence of those (recursive) specifications. The semantics is then applied to prove soundness of a programming logic [2] for the object calculus [1] and to suggest possible extensions. For the purposes of this discussion we use an informal logic of predomains in order to avoid any commitment to a particular syntax of specification logic.

### Citations

920 | A Theory of Objects
- ABADI, CARDELLI
- 1996
(Show Context)
Citation Context ...mantics of the object calculus and the discussion of existence of those (recursive) specifications. The semantics is then applied to prove soundness of a programming logic [2] for the object calculus =-=[1]-=- and to suggest possible extensions. For the purposes of this discussion we use an informal logic of predomains in order to avoid any commitment to a particular syntax of specification logic. 1 Introd... |

275 | Local reasoning about programs that alter data structures
- O’Hearn, Reynolds, et al.
- 2001
(Show Context)
Citation Context ...hose in this paper are expected to be hard to establish. In this paper we used classical logic as a meta logic but did not commit ourselves to any particular object logic. Spatial or separation logic =-=[9, 5]-=- is a prospective candidate for such an object logic as it simplifies handling of aliases. It remains to be seen whether predicates in such a logic pose any problems to the presented approach. Other i... |

130 | A logic of object-oriented programs
- Abadi, Leino
- 1997
(Show Context)
Citation Context ...es not help in proving that [[a]] 2 I for an object a since one has to find a predicate P such that o 2 P ) o:m(o)# ) false . But the only canonical choice for P is I again so nothing is achieved. In =-=[2]-=- Abadi and Leino introduced a sort of Hoare logic for a variant of the imperative object calculus which allows one to prove divergence of a:m() quite easily. For sake of simplicity we first discuss th... |

101 | Relational properties of domains
- Pitts
- 1996
(Show Context)
Citation Context ...di & Leino logic [2] is defined on the resulting object domains. We prove existence of these specifications under mild assumptions employing Andy Pitts' machinery for relational properties of domains =-=[10]-=-. The existence theorem is not only interesting in its own right, it will be also applied to ffl prove soundness of the object formation rule in [2] (in an untyped way but types can be encoded as spec... |

49 |
Modular specification and verification of object-oriented programs
- Leavens
- 1991
(Show Context)
Citation Context ...mmitment to a particular syntax of specification logic. 1 Introduction and motivation Programming logics have been suggested for object calculi [2, 8] as well as object-oriented programming languages =-=[3, 6, 16, 7, 11, 12]-=-. Since objects are inherently recursive due to self-application of objects in method calls, their specifications are recursive too. Soundness proofs of programming logics for objects w.r.t. operation... |

25 | Logical foundations for typed object-oriented languages
- Poetzsch-Heffter, Müller
- 1998
(Show Context)
Citation Context ...mmitment to a particular syntax of specification logic. 1 Introduction and motivation Programming logics have been suggested for object calculi [2, 8] as well as object-oriented programming languages =-=[3, 6, 16, 7, 11, 12]-=-. Since objects are inherently recursive due to self-application of objects in method calls, their specifications are recursive too. Soundness proofs of programming logics for objects w.r.t. operation... |

24 | Recursive object types in a logic of objectoriented programs
- Leino
- 1998
(Show Context)
Citation Context ...an informal logic of predomains in order to avoid any commitment to a particular syntax of specification logic. 1 Introduction and motivation Programming logics have been suggested for object calculi =-=[2, 8]-=- as well as object-oriented programming languages [3, 6, 16, 7, 11, 12]. Since objects are inherently recursive due to self-application of objects in method calls, their specifications are recursive t... |

22 | Objects and classes in Algol-like languages
- Reddy
- 1998
(Show Context)
Citation Context ...mmitment to a particular syntax of specification logic. 1 Introduction and motivation Programming logics have been suggested for object calculi [2, 8] as well as object-oriented programming languages =-=[3, 6, 16, 7, 11, 12]-=-. Since objects are inherently recursive due to self-application of objects in method calls, their specifications are recursive too. Soundness proofs of programming logics for objects w.r.t. operation... |

18 | Reasoning about Java classes
- Jacobs, Berg, et al.
- 1998
(Show Context)
Citation Context |

6 | A proof theory for a sequential version of POOL. Technical Report available also from URL http://www.cs.uu.nl/people/frankb/Availablepapers/spool.dvi - America, Boer - 1999 |

5 | On garbage and program logic
- Calcagno, O’Hearn
- 2001
(Show Context)
Citation Context ...hose in this paper are expected to be hard to establish. In this paper we used classical logic as a meta logic but did not commit ourselves to any particular object logic. Spatial or separation logic =-=[9, 5]-=- is a prospective candidate for such an object logic as it simplifies handling of aliases. It remains to be seen whether predicates in such a logic pose any problems to the presented approach. Other i... |

3 |
A Hoare-Calculus for Verifying Java Realizations of OCL-Constrained Design Models
- Reus, Wirsing, et al.
- 2001
(Show Context)
Citation Context |

2 |
A logic for objects
- Calcagno, O'Hearn
- 2001
(Show Context)
Citation Context ...olds but (2) is false, contradicting Lemma 7.1(2). More natural counterexamples are expected by semantic modelling of logics for object calculi using Hoare triples like the tentative one suggested in =-=[4]-=-. 8 Conclusions We have shown that a denotational approach to programming logics for object calculi leads to a better understanding of the implicit recursion of object specifications and their reasoni... |

2 |
Class based vs. object based: A denotational comparison
- Reus
- 2002
(Show Context)
Citation Context ...logics in the same denotational way. The analysis of further languages should be fruitful in the quest for more (natural) counterexamples. A comparison with classbased languages has been attempted in =-=[15]. Rec-=-ursive methods can be programmed in the object calculus without explicit recursion due to the recursive higherorder definition of the underlying store. This is a particular instance of "recursion... |

1 |
A logic of recursive objects
- Reus
- 1999
(Show Context)
Citation Context ...and logic of higher order store. Moreover, the proposed technique is expected to be applicable to various other object-oriented languages and programming logics. Some basic ideas date back to a draft =-=[13]-=- an abstract of which has been published in [14]. 2 Denotational model of the object calculus In this section we describe a most simple denotational semantics for functional and imperative object calc... |

1 |
A logic of recursive objects (abstract
- Reus
- 1999
(Show Context)
Citation Context ...roposed technique is expected to be applicable to various other object-oriented languages and programming logics. Some basic ideas date back to a draft [13] an abstract of which has been published in =-=[14]-=-. 2 Denotational model of the object calculus In this section we describe a most simple denotational semantics for functional and imperative object calculi within the category PreDom of predomains and... |