Semantics and logic of object calculi
- 作者：Reus ; Bernhard ; Streicher ; Thomas
- 关键词：Object logic ; Programming logic ; Program verification ; Denotational semantics ; Domain theory
- 刊名：Theoretical Computer Science
- 出版年：2004
- 期刊代码：114_03043975
- 类别：cp
- 出版时间：May 28, 2004
- 卷：316
- 期：1-3
- 页码：191-213
- 文件大小：322 K
摘要
The main contribution of this paper is a formal characterization of recursive object specifications and their existence based on a denotational untyped semantics of the object calculus. Existence is not guaranteed but can be shown employing Pitts’ results on relational properties of domains. The semantics can be used to analyse and verify Abadi and Leino's object logic but it also suggests extensions. For example, specifications of methods may not only refer to fields but also to methods of objects in the store. This can be achieved without compromising the existence theorem. An informal logic of predomains is in use intentionally in order to avoid any commitment to a particular syntax of specification logic.