A fully abstract semantics of classes for Object-Z
- 1 May 1995
- journal article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 7 (3) , 289-313
- https://doi.org/10.1007/bf01211075
Abstract
This paper presents a fully abstract semantics of classes for the object oriented formal specification language Object-Z. Such a semantics includes no unnecessary syntactic details and, hence, describes a class in terms of the external behaviour of its objects only. The semantics, based on an extension of existing process models, defines a notion of behavioural equivalence which is stronger than that of CSP and weaker than that of CCS.Keywords
This publication has 14 references indexed in Scilit:
- Linear and branching structures in the semantics and logics of reactive systemsPublished by Springer Nature ,2005
- Experimenting with Process EquivalencePublished by Springer Nature ,1990
- Towards a semantics for object-ZPublished by Springer Nature ,1990
- Bisimulation through probabilistic testing (preliminary report)Published by Association for Computing Machinery (ACM) ,1989
- A fully abstract trace model for dataflow networksPublished by Association for Computing Machinery (ACM) ,1989
- Semantical Paradigms: Notes for an Invited LecturePublished by Defense Technical Information Center (DTIC) ,1988
- Bisimulation can't be tracedPublished by Association for Computing Machinery (ACM) ,1988
- Specification-oriented semantics for Communicating ProcessesActa Informatica, 1986
- A Theory of Communicating Sequential ProcessesJournal of the ACM, 1984
- LCF considered as a programming languageTheoretical Computer Science, 1977