Abstract
The extended term graph rewriting formalism of MONSTR is described, together with some of its more important rigorously established properties, particularly regarding serialisability and acyclicity. This basis is used for giving a convenient description of the global runtime structure of a concurrent object oriented language. The formalism proves especially convenient for describing very precisely a variety of intended synchronisation properties of objects in a concurrent OOL, and this flexibility is illustrated by considering a variety of possible operational semantics for a simple counter object. A lower bound object example illustrates that even more extreme synchronisation properties for objects may be contemplated without stretching the capabilities of the MONSTR formalism. The presentation is independent of any specific high level OOL.
Chapter PDF
Similar content being viewed by others
Keywords
References
Banach R. (1993), MONSTR: Term Graph Rewriting for Parallel Machines, in Term Graph Rewriting: Theory and Practice, Sleep et al (eds.), Wiley, pp. 243–252.
Banach R. (1996a), MONSTR I — Fundamental Issues and the Design of MONSTR, Journal of Universal Computer Science, to appear.
Banach R. (1996b), MONSTR II - Suspending MONSTR Semantics and Independence, submitted to Journal of Universal Computer Science.
Banach R. (1996c), MONSTR III — Finegrained Semantics and Serialisability, in preparation.
Banach R. (1996d), MONSTR. IV — Coercing Semantics and Serialisability for Resilient Systems, in preparation.
Banach R., Balazs J., Papadopoulos G. A. (1995), A Translation of the Pi-Calculus into MONSTR, Journal of Universal Computer Science, 1 (6), 335–394.
Banach R., Papadopoulos G. A. (1993), Parallel Term Graph Rewriting and Concurrent Logic Programs, Proc. WPDP 93, Sofia, Bulgaria, May 4–7, 303–322.
Banach R., Papadopoulos G. A. (1995a), Linear Behaviour of Term Graph Rewriting Programs, Proc. ACM SAC 95 Nashville TN., USA, Feb. 26–28, ACM Press, 157–163.
Banach R., Papadopoulos G. A. (1995b), Term Graph Rewriting as a Specification and Implementation Framework for Concurrent Object Oriented Programming Languages, Proc. MPPM 95, Berlin, Germany, Oct. 9–12, IEEE Press, 151–158.
Ilenz M.,Smolka G., Wurtz J. (1994), Object-Oriented Concurrent Constraint Programming in Oz, Proc. PPCP, MIT Press, Cambridge MA., 27–48.
Nierstrasz O., Papathomas M. (1990), Viewing Objects as Patterns of Communicating Agents, Proc. OOPSLA/ECOOP 90, ACM Press, Ottawa, Canada, Oct. 21–25, 38–43.
Papathomas M. (1989), Concurrency Issues in Object-Oriented Languages, in Object Oriented Development, ed. D. Tsichritzis, Centre Universitaire d’ Informatique, University of Geneva, 207–245.
Sargeant J. (1993), Uniting Functional and Object-Oriented Programming, Proc. 1st JSST, Kanazawa, Japan, Nov. 4–6, LNCS 742, Springer Verlag, 1–26.
Sleep M. R., Plasmeijer M. J., van Eekelen M. C. J. D. eds. (1993), Term Graph Rewriting: Theory and Practice, John Wiley, New York.
Watson I., Woods V., Watson P., Banach R., Greenberg M., Sargeant J. (1988), Flagship: A Parallel Architecture for Declarative Programming, Proc. 15th ISCA, Hawaii, May 30-June 2, 124–130.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Banach, R., Papadopoulos, G.A. (1997). Expressing Runtime Structure and Synchronisation in Concurrent OO Languages with MONSTR. In: Najm, E., Stefani, JB. (eds) Formal Methods for Open Object-based Distributed Systems. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35082-0_26
Download citation
DOI: https://doi.org/10.1007/978-0-387-35082-0_26
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2875-9
Online ISBN: 978-0-387-35082-0
eBook Packages: Springer Book Archive