A fully abstract semantics of classes for Object-Z

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.

[1]  簡聰富,et al.  物件導向軟體之架構(Object-Oriented Software Construction)探討 , 1989 .

[2]  Graeme Smith,et al.  An object-oriented approach to formal specification , 1992 .

[3]  Chris Smith,et al.  An Object Oriented Interpretation of LOTOS , 1989, FORTE.

[4]  Phillip M. Yelland.  First Steps Towards Fully Abstract Semantics for Object-Oriented Languages , 1989, Comput. J..

[5]  Grady Booch,et al.  Object-Oriented Design with Applications , 1990 .

[6]  A. Meyer,et al.  Bisimulation can't be traced. Preliminary report , 1987 .

[7]  O. J. Dahl,et al.  Simula Begin , 1979 .

[8]  Graeme Smith,et al.  The object-Z specification language: version 1 , 1991 .

[9]  Graeme Smith,et al.  The Object-Z Specification Language , 1999, Advances in Formal Methods.

[10]  Susan Stepney,et al.  Object Orientation in Z , 1992, Workshops in Computing.

[11]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[12]  James R. Russell,et al.  Full abstraction for nondeterministic dataflow networks , 1989, 30th Annual Symposium on Foundations of Computer Science.

[13]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[14]  C. A. R. Hoare,et al.  Specification-Oriented Semantics for Communicating Processes , 1983, ICALP.

[15]  Michael Goldsmith,et al.  Programming in occam 2 , 1985, Prentice Hall international series in computer science.

[16]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[17]  Jane Sinclair,et al.  Introduction to formal specification and Z , 1991, Prentice Hall International Series in Computer Science.

[18]  Albert R. Meyer,et al.  Experimenting with Process Equivalence , 1992, Theor. Comput. Sci..

[19]  A. W. Roscoe,et al.  Unbounded Nondeterminism in CSP , 1989, Mathematical Foundations of Programming Semantics.

[20]  Kim G. Larsen,et al.  Bisimulation through probabilistic testing (preliminary report) , 1989, POPL '89.

[21]  David A. Carrington,et al.  Object-Z: An Object-Oriented Extension to Z , 1989, FORTE.

[22]  Colin J. Fidge,et al.  A formal definition of priority in CSP , 1993, TOPL.

[23]  Albert R. Meyer,et al.  Semantical paradigms: notes for an invited lecture , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[24]  Alley Stoughton,et al.  Fully abstract models of programming languages , 1986, Research Notes in Theoretical Computer Science.

[25]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[26]  Bengt Jonsson,et al.  A fully abstract trace model for dataflow networks , 1989, POPL '89.

[27]  Rachid Sijelmassi,et al.  Formal specification of fault management system using O-Estelle , 1992, [Proceedings] Singapore ICCS/ISITA `92.

[28]  David Robson,et al.  Smalltalk-80: The Language and Its Implementation , 1983 .

[29]  Amir Pnueli,et al.  Linear and Branching Structures in the Semantics and Logics of Reactive Systems , 1985, ICALP.

[30]  David J. Duke,et al.  Towards a Semantics for Object-Z , 1990, VDM Europe.

[31]  J. Michael Spivey,et al.  The Z notation - a reference manual , 1992, Prentice Hall International Series in Computer Science.

[32]  Jamie Barry Nathan. Shield,et al.  Towards an object-oriented refinement calculus , 2004 .