Abstract
Object calculi have been investigated as semantical foundation for object-oriented languages. Often, they are object-based, whereas the mainstream of object-oriented languages is class-based.
Considering classes as part of a component makes instantiation a possible interaction between component and environment. As a consequence, one needs to take connectivity information into account.
We formulate an operational semantics that incorporates the connectivity information into the scoping mechanism of the calculus. Furthermore, we formalize a notion of equivalence on traces which captures the uncertainty of observation cause by the fact that the observer may fall into separate groups of objects. We use a corresponding trace semantics for full abstraction wrt. a simple notion of observability. This requires to capture the notion of determinism for traces where classes may be instantiated into more than one instance during a run and showing thus twice an equivalent behavior (doing a “replay”), a problem absent in an object-based setting.
Part of this work has been financially supported by the IST project Omega (IST- 2001-33522) and the NWO/DFG project Mobi-J (RO 1122/9-1/2).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abadi, M., Cardelli, L.: A Theory of Objects. Monographs in Computer Science. Springer, Heidelberg (1996)
Ábrahám, E., Bonsangue, M.M., de Boer, F.S., Steffen, M.: Object connectivity and full abstraction for a concurrent calculus of classes. In: Li (ed.) [12], pp. 38–52
Abramsky, S.: Algorithmic game semantics: A tutorial introduction. In: Schichtenberg, Steinbruggen (eds.) [16], pp. 21–47
Bosangue, M., de Boer, F.S., de Roever, W.-P., Graf, S. (eds.): FMCO 2004. LNCS, vol. 3657. Springer, Heidelberg (2005)
de Boer, F.S., Bonsangue, M., Steffen, M., Ábrahám, E.: A fully abstract trace semantics for UML components. In: Bosangue, et al. (eds.) [4] (to appear)
Gordon, A.D., Hankin, P.D.: A concurrent object calculus: Reduction and typing. In: Nestmann, Pierce (eds.) [13]
Hennessy, M.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)
IEEE. Thirteenth Annual Symposium on Logic in Computer Science (LICS) (Indiana). Computer Society Press (July 1998)
IEEE. Seventeenth Annual Symposium on Logic in Computer Science (LICS), Copenhagen, Denmark, July 2002. Computer Society Press (2002)
Jeffrey, A., Rathke, J.: A fully abstract may testing semantics for concurrent objects. In: LICS 2002 [9] (2002)
Jeffrey, A., Rathke, J.: Java Jr.: A fully abstract trace semantics for a core Java language. In: Sagiv [15], pp. 423–438
Li, Z. (ed.): ICTAC 2004. LNCS, vol. 3407. Springer, Heidelberg (2005)
Nestmann, U., Pierce, B.C. (eds.): HLCL 1998: High-Level Concurrent Languages, Nice, France, September 12, 1998. Electronic Notes in Theoretical Computer Science, vol. 16(3). Elsevier Science Publishers, Amsterdam (1998)
Rathke, J.: A fully abstract trace semantics for a core Java language (preliminary title). In: Bosangue, et al. (eds.) [4] (to appear)
Sagiv, M. (ed.): ESOP 2005. LNCS, vol. 3444. Springer, Heidelberg (2005)
Schichtenberg, H., Steinbruggen, R. (eds.): Proof and System Reliability, Summer School, Marktoberdorf, Germany, NATO Advanced Study Institute. Series F: Computer and System Sciences. Kluwer Academic Publishers, Dordrecht (2001)
Smith, G.P.: An Object-Oriented Approach to Formal Specification. PhD thesis, Department of Computer Science, University of Queensland (October 1992)
Viswanathan, R.: Full abstraction for first-order objects with recursive types and subtyping. In: LICS 1998 [8] (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ábrahám, E., Bonsangue, M.M., de Boer, F.S., Grüner, A., Steffen, M. (2005). Observability, Connectivity, and Replay in a Sequential Calculus of Classes. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, WP. (eds) Formal Methods for Components and Objects. FMCO 2004. Lecture Notes in Computer Science, vol 3657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561163_13
Download citation
DOI: https://doi.org/10.1007/11561163_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29131-2
Online ISBN: 978-3-540-31939-9
eBook Packages: Computer ScienceComputer Science (R0)