Abstract
Concurrent objects may offer services non-uniformly, constraining the acceptance of messages on the states of objects. We advocate a looser view of communication errors. Safe programmes must guarantee that every message has a chance of being received if it requests a method that may become enabled at some point in the future. We formalise non-uniform concurrent objects in TyCO, a name-passing object calculus, and ensure program safety via a type system. Types are terms of a process algebra that describes dynamic aspects of the behaviour of objects.
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
Gul Agha. Actors: A Model of Concurrent Computation in Distributed Systems. M.I.T. Press, 1986.
Roberto Amadio. An asynchronous model of locality, failure, and process mobility. In Coordination Languages and Models, LNCS 1282. Springer-Verlag, 1997.
Roberto Amadio, Ilaria Castellani, and Davide Sangiorgi. On bisimulations for the asynchronous π-calculus. Theoretical Computer Science, 195(2):291–324, 1998.
Michele Boreale. On the expressiveness of internal mobility in name-passing calculi. Theoretical Computer Science, 195(2):205–226, 1998.
Gérard Boudol. Asynchrony and the π-calculus (note). Rapport de Recherche RR-1702, INRIA Sophia-Antipolis, 1992.
Gérard Boudol. Typing the use of resources in a concurrent calculus. In Advances in Computing Science, LNCS 1345, pages 239–253. Springer-Verlag, 1997.
Søren Christensen. Decidability and Decomposition in Process Algebras. PhD thesis ECS-LFCS-93-278, Dep. of Computer Science, University of Edinburgh, 1993.
Jean-Louis Colaço, Mark Pantel, and Patrick Sallé. A set constraint-based analyses of actors. In Proc. of FMOODS’97. IFIP, 1997.
Laurent Dami. Labelled reductions, runtime errors, and operational subsumption. In Proc. of ICALP’97, LNCS 1256, pages 782–793. Springer-Verlag, 1997.
Cédric Fournet, Georges Gonthier, Jean-Jacques Lévy, Luc Maranget, and Didier Rémy. A calculus of mobile agents. In Proc. of CONCUR’96, LNCS 1119, pages 406–421. Springer-Verlag, 1996.
Kohei Honda and Mario Tokoro. An object calculus for asynchronous communication. In Proc. of ECOOP’91, LNCS 512, pages 141–162. Springer-Verlag, 1991.
Naoki Kobayashi. A partially deadlock-free typed process calculus. In Proc. of LICS’97, pages 128–139. Computer Society Press, 1997.
Massimo Merro and Davide Sangiorgi. On asynchrony in name-passing calculi. In Proc. of ICALP’98, LNCS 1443, pages 856–967. Springer-Verlag, 1998.
Robin Milner. Communication and Concurrency C. A. R. Hoare Series Editor— Prentice-Hall, 1989.
Robin Milner. The polyadic π-calculus: a tutorial. In Logic and Algebra of Specification. Springer-Verlag, 1993.
Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, parts I and II. Information and Computation, 100:1–77, 1992.
Elie Najm and Abdelkrim Nimour. A calculus of object bindings. In Proc. of FMOODS’97. IFIP, 1997.
Oscar Nierstrasz. Regular types for active objects. In Object-Oriented Software Composition, pages 99–121. Prentice-Hall, 1995.
Franz Puntigam. Coordination Requirements Expressed in Types for Active Objects. In Proc. of ECOOP’97, LNCS 1241, pages 367–388. Springer-Verlag, 1997.
António Ravara and Luís Lopes. Programming and implementation issues in non-uniform TyCO. Research report DCC-99-1, Department of Computer Science, Faculty of Sciences, University of Porto.
António Ravara, Pedro Resende, and Vasco T. Vasconcelos. An algebra of behavioural types. Research report 26/99 DM-IST, Technical University of Lisbon.
António Ravara and Vasco T. Vasconcelos. Behavioural types for a calculus of concurrent objects. In Proc. of Euro-Par’97, LNCS 1300, pages 554–561. Springer-Verlag, 1997.
António Ravara and Vasco T. Vasconcelos. Typing non-uniform concurrent objects. Research report 6/00 DM-IST, Technical University of Lisbon.
Eijiro Sumii and Naoki Kobayashi. A generalized deadlock-free process calculus. In Proc. of HLCL’98, Electronic Notes in Theoretical Computer Science, (16), 1998.
Vasco T. Vasconcelos. Processes, functions, and datatypes. Theory and Practice of Object Systems, 5(2):97–110, 1999.
Vasco T. Vasconcelos and António Ravara. Communication errors in the π-calculus are undecidable. Information Processing Letters, 71(5–6):229–233, 1999.
Vasco T. Vasconcelos and Mario Tokoro. A typing system for a calculus of objects. In Proc. of ISOTAS’93, LNCS 742, pages 460–474. Springer-Verlag, 1993.
Nobuko Yoshida. Graph types for monadic mobile processes. In Proc. of FST/TCS’96, LNCS 1180, pages 371–386. Springer-Verlag, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ravara, A., Vasconcelos, V.T. (2000). Typing Non-uniform Concurrent Objects. In: Palamidessi, C. (eds) CONCUR 2000 — Concurrency Theory. CONCUR 2000. Lecture Notes in Computer Science, vol 1877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44618-4_34
Download citation
DOI: https://doi.org/10.1007/3-540-44618-4_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67897-7
Online ISBN: 978-3-540-44618-7
eBook Packages: Springer Book Archive