A typed language for distributed mobile processes (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A typed language for distributed mobile processes (extended abstract)

Full text

Pdf (1.91 MB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

San Diego, California, United States

Pages: 378 - 390

Year of Publication: 1998

ISBN:0-89791-979-3

Authors

James Riely	School of Cognitive and Computing Sciences, Univ. of Sussex, Falmer, Brighton, BN1 9QH, UK
Matthew Hennessy	School of Cognitive and Computing Sciences, Univ. of Sussex, Falmer, Brighton, BN1 9QH, UK

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 17, Citation Count: 28

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/268946.268978 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	M. Abadi and a. D. Gordon. A calculus for cryptographic photocols: The spi calculus. Technical Report 414, University of Cambridge Computer Laboratory, January 1997.
	2	Roberto M. Amadio , Sanjiva Prasad, Localities and Failures (Extended Abstract), Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science, p.205-216, December 15-17, 1994
	3	Roberto M. Amadio, An Asynchronous Model of Locality, Failurem and Process Mobility, Proceedings of the Second International Conference on Coordination Languages and Models, p.374-391, September 01-03, 1997
	4	Roberto M. Amadio , Ilaria Castellani , Davide Sangiorgi, On Bisimulations for the Asynchronous pi-Calculus, Proceedings of the 7th International Conference on Concurrency Theory, p.147-162, August 26-29, 1996
	5	Gerard Berry , Gerard Boudol, The chemical abstract machine, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.81-94, December 1989, San Francisco, California, United States [doi>10.1145/96709.96717]
	6	Michele Boreale and Davide Sangiorgi, Typed bisimulation for the pi-calculus. Talk at EXPRESS97, September 1997.
	7	G. Boudol Asynchrony and the x-calculus. Research Report 1702, INRIA, Sophia-Antipolis, 1992.
	8	L. Cardelli and A. D. Gordon. Mobile ambient% 1997. Draft, Available from http://www.cl.cam.ac.uk/users/adg/.
	9	Luca Cardelli, A language with distributed scope, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.286-297, January 23-25, 1995, San Francisco, California, United States [doi>10.1145/199448.199516]
	10	R. De Nicola and M. C. B. Hennessy. Testing equivalcnccs for processes. Theoretical CompulerScience,34:83-133.1984.
	11	Cédric Fournet , Georges Gonthier, The reflexive CHAM and the join-calculus, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.372-385, January 21-24, 1996, St. Petersburg Beach, Florida, United States [doi>10.1145/237721.237805]
	12	Cédric Fournet , Georges Gonthier , Jean-Jacques Lévy , Luc Maranget , Didier Rémy, A Calculus of Mobile Agents, Proceedings of the 7th International Conference on Concurrency Theory, p.406-421, August 26-29, 1996
	13	Alessandro Giacalone , Prateek Mishra , Sanjiva Prasad, Facile: a symmetric integration of concurrent and functional programming, International Journal of Parallel Programming, v.18 n.2, p.121-160, Apr. 1990 [doi>10.1007/BF01491213]
	14	Robin Milner. The polydic pi-calculus: a tutorial. Technical Report ECS-LFCS-91-180, Laboratory for Foundations of Computer Science, Department of computer Science, University of Edinburgh, UK, October 1991. Also in Logic and Algebra of Specification, ed. F. L. Bauer, W. brauer and H. Schwichtenberg, Springer-Verlag, 1993.
	15	Robin Milner , Joachim Parrow , David Walker, A calculus of mobile processes, I, Information and Computation, v.100 n.1, p.1-40, Sept. 1992 [doi>10.1016/0890-5401(92)90008-4]
	16	Benjamin Pierce and Davide Sangiorgi. Typing and sublyping for mobile processes. Mathematical Structures in Comptuer Science. 6(5):409-454, 1996. Extended abstract in LICS '93.
	17	Benjamin C. Pierce and David N. Turner, Pict: A programming language based on the pi-calculus. Technical Report CSCI 476, Computer Science Department, Indiana University, 1997. To appear in Proof. Language and Interaction: Essays in Honour of Robin Millner. Gordon Plotkin, Colin Stirling, and Mads Tofle, editors, MIT Press.
	18	James Riely and Matthew Hennessy. Distributed processes and location failures. Computer Science Technical Report 2/97, University of Sussex, Department of Computer Science, 1997. Available from http://www.cogs.susx.ac.uk/.
	19	James Riely and Matthew Hennessy. A typed language for distributed mobile processes. Computer Science Technical Report 3/97, University of Sussex, Department of Computer Science, 1997. Available from http://www.cogs.susx.ac.uk/.
	20	Davide Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. Ph D thesis, University of Edinburgh, 1992.
	21	Davide Sangiorgi, Locality and interleaving semantics in calculi for mobile processes, Theoretical Computer Science, v.155 n.1, p.39-83, Feb. 26, 1996 [doi>10.1016/0304-3975(95)00020-8]
	22	Peter Sewell. Global/local subtyping for a distributed pi-calculus. Technical Report 435, Computer Laboratory, University of Cambridge, August 1997.
	23	Gert Smolka, The Oz Programming Model, Proceedings of the European Workshop on Logics in Artificial Intelligence, p.251, September 30-October 03, 1996
	24	David Turner. The Polymorphic Pi-Calculus: Theory and Implementation. PhD thesis, Edinburgh University, 1995.

CITED BY 28

	Peter Sewell , Jan Vitek, Secure composition of untrusted code: box π, wrappers, and causality types, Journal of Computer Security, v.11 n.2, p.135-187, May 2003
	Francesca Levi , Davide Sangiorgi, Controlling interference in ambients, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.352-364, January 19-21, 2000, Boston, MA, USA
	Antónia Lopes , José Luiz Fiadeiro , Michel Wermelinger, Architectural primitives for distribution and mobility, Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering, November 18-22, 2002, Charleston, South Carolina, USA
	Asis Unyapoth , Peter Sewell, Nomadic pict: correct communication infrastructure for mobile computation, ACM SIGPLAN Notices, v.36 n.3, p.116-127, March 2001
	Matthew Hennessy , James Riely, Resource access control in systems of mobile agents, Information and Computation, v.173 n.1, p.82-120, February 25, 2002
	James Riely , Matthew Hennessy, Trust and partial typing in open systems of mobile agents, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.93-104, January 20-22, 1999, San Antonio, Texas, United States
	Luca Cardelli , Andrew D. Gordon, Types for mobile ambients, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.79-92, January 20-22, 1999, San Antonio, Texas, United States
	Peter Sewell, From rewrite rules to bisimulation congruences, Theoretical Computer Science, v.274 n.1-2, p.183-230, March 6, 2002
	Martín Abadi, Secrecy by typing in security protocols, Journal of the ACM (JACM), v.46 n.5, p.749-786, Sept. 1999
	Luca Cardelli , Andrew D. Gordon, Mobile ambients, Formal methods for distributed processing: a survey of object-oriented approaches, Cambridge University Press, New York, NY, 2001
	Chiara Nottegar , Corrado Priami , Pierpaolo Degano, Performance Evaluation of Mobile Processes via Abstract Machines, IEEE Transactions on Software Engineering, v.27 n.10, p.867-889, October 2001
	Corrado Priami, Language-based performance prediction for distributed and mobile systems, Information and Computation, v.175 n.2, p.119-145, June 15, 2002
	C. Bodei , P. Degano , F. Nielson , H. Riis Nielson, Flow logic for Dolev-Yao secrecy in cryptographic processes, Future Generation Computer Systems, v.18 n.6, p.747-756, May 2002
	Luca Cardelli , Giorgio Ghelli , Andrew D. Gordon, Types for the ambient calculus, Information and Computation, v.177 n.2, p.160-194, 15 September 2002
	Silvano Dal Zilio, Mobile processes: a commented bibliography, Modeling and verification of parallel processes, Springer-Verlag New York, Inc., New York, NY, 2001
	Massimo Merro , Francesco Zappa Nardelli, Behavioral theory for mobile ambients, Journal of the ACM (JACM), v.52 n.6, p.961-1023, November 2005
	Luca Cardelli , Giorgio Ghelli , Andrew D. Gordon, Secrecy and group creation, Information and Computation, v.196 n.2, p.127-155, January 29, 2005
	Michele Bugliesi , Giuseppe Castagna , Silvia Crafa, Access control for mobile agents: The calculus of boxed ambients, ACM Transactions on Programming Languages and Systems (TOPLAS), v.26 n.1, p.57-124, January 2004
	Francesca Levi , Davide Sangiorgi, Mobile safe ambients, ACM Transactions on Programming Languages and Systems (TOPLAS), v.25 n.1, p.1-69, January 2003
	G. Castagna , J. Vitek , F. Zappa Nardelli, The Seal Calculus, Information and Computation, v.201 n.1, p.1-54, 25 August 2005
	Antónia Lopes , José Luiz Fiadeiro , Michel Wermelinger, Architectural primitives for distribution and mobility, ACM SIGSOFT Software Engineering Notes, v.27 n.6, November 2002
	Alan Jeffrey , Julian Rathke, A theory of bisimulation for a fragment of concurrent ML with local names, Theoretical Computer Science, v.323 n.1-3, p.1-48, 14 September 2004
	Massimo Merro , Matthew Hennessy, A bisimulation-based semantic theory of Safe Ambients, ACM Transactions on Programming Languages and Systems (TOPLAS), v.28 n.2, p.290-330, March 2006
	Chiara Bodei , Mikael Buchholtz , Pierpaolo Degano , Flemming Nielson , Hanne Riis Nielson, Static validation of security protocols, Journal of Computer Security, v.13 n.3, p.347-390, May 2005
	Paola Quaglia , David Walker, Types and full abstraction for polyadic π-calculus, Information and Computation, v.200 n.2, p.215-246, 1 August 2005
	Massimo Merro , Davide Sangiorgi, On asynchrony in name-passing calculi, Mathematical Structures in Computer Science, v.14 n.5, p.715-767, October 2004
	Ugo Montanari , Marco Pistore, Structured coalgebras and minimal HD-automata for the π-calculus, Theoretical Computer Science, v.340 n.3, p.539-576, 31 August 2005
	P. Ciancarini , F. Franze` , C. Mascolo, A Coordination Model to Specify Systems Including Mobile Agents, Proceedings of the 9th international workshop on Software specification and design, p.96, April 16-18, 1998