Trust and partial typing in open systems of mobile agents

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Trust and partial typing in open systems of mobile agents

Full text

Pdf (1.63 MB)

Source

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

San Antonio, Texas, United States

Pages: 93 - 104

Year of Publication: 1999

ISBN:1-58113-095-3

Authors

James Riely	Department of Computer Sciences, North Carolina State University, Raleigh, NC
Matthew Hennessy	School of Cognitive and Computing Sciences, Univ. of Sussex, Falmer, Brighton, BN1 9QH UK

Sponsors

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

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 20, Citation Count: 20

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/292540.292551 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	Martín Abadi, Secrecy by Typing inSecurity Protocols, Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software, p.611-638, September 23-26, 1997
	2	M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, To appear. Available as SRC Research Report 149 (1998).
	3	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
	4	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
	5	Luca Cardelli , Andrew D. Gordon, Mobile Ambients, Proceedings of the First International Conference on Foundations of Software Science and Computation Structure, p.140-155, March 28-April 04, 1998
	6	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]
	7	Luca Cardelli and Andrew Gordon. Types for mobile ambients. Draft, 1998. Available from http://www, luca. demon, co. uk/.
	8	Mads Dam, Proving Trust in Systems of 2nd-Order Processes: Preliminary Results, Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7, p.255, January 06-09, 1998 [doi>10.1109/HICSS.1998.649220]
	9	Dorothy E. Denning , Peter J. Denning, Certification of programs for secure information flow, Communications of the ACM, v.20 n.7, p.504-513, July 1977 [doi>10.1145/359636.359712]
	10	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
	11	Nevin Heintze , Jon G. Riecke, The SLam calculus: programming with secrecy and integrity, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.365-377, January 19-21, 1998, San Diego, California, United States [doi>10.1145/268946.268976]
	12	Matthew Hennessy and James Riely. Resource access control in systems of mobile agents. Computer Science Technical Report 2/98, University of Sussex, 1998. Extended abstract in HLCL '98. Available from http://www.elsevier.nl/locate/entcs/ volume 16.3. html.
	13	Matthew Hennessy and James Riely. Type-safe execution of mobile agents in anonymous networks. Computer Science Technical Report 3/98, University of Sussex, 1998. Available from http: //www. cogs. susx. ac. uk/.
	14	Frederick Coleville Knabe. Language Support for Mobile Agents. PhD thesis, Carnegie-Mellon University, 1995.
	15	Dexter Kozen, Efficient Code Certification, Cornell University, Ithaca, NY, 1998
	16	Robin Milner. The polyadic n-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.
	17	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]
	18	Greg Morrisett , David Walker , Karl Crary , Neal Glew, From system F to typed assembly language, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.85-97, January 19-21, 1998, San Diego, California, United States [doi>10.1145/268946.268954]
	19	George C. Necula, Proof-carrying code, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.106-119, January 15-17, 1997, Paris, France [doi>10.1145/263699.263712]
	20	Atsushi Ohori , Kazuhiko Kato, Semantics for communication primitives in a polymorphic language, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.99-112, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158529]
	21	Benjamin Pierce and Davide Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 6(5):409-454, 1996. Extended abstract in LICS '93.
	22	James Riely and Matthew Hennessy. Trust and partial typing in open systems of mobile agents. Computer Science Technical Report 4/98, University of Sussex, 1998. Available from http://www.cogs. susx.ac.uk/.
	23	James Riely , Matthew Hennessy, A typed language for distributed mobile processes (extended abstract), Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.378-390, January 19-21, 1998, San Diego, California, United States [doi>10.1145/268946.268978]
	24	Tatsurou Sekiguchi , Akinori Yonezawa, A calculus with code mobility, Proceeding of the IFIP TC6 WG6.1 international workshop on Formal methods for open object-based distributed systems, p.21-36, January 1997, Canterbury, United Kingdom
	25	Peter Sewell, Global/Local Subtyping and Capability Inference for a Distributed pi-calculus, Proceedings of the 25th International Colloquium on Automata, Languages and Programming, p.695-706, July 13-17, 1998
	26	Geoffrey Smith , Dennis Volpano, Secure information flow in a multi-threaded imperative language, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.355-364, January 19-21, 1998, San Diego, California, United States [doi>10.1145/268946.268975]
	27	Frank Yellin. Low-level security in Java. In WWW4 Conference, 1995. Available from htZp://www.javasoft.com/sfaq/ verifier, html.

CITED BY 20

	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
	Peter Sewell, π-calculi, Formal methods for distributed processing: a survey of object-oriented approaches, Cambridge University Press, New York, NY, 2001
	Matthew Hennessy , James Riely, Information flow vs. resource access in the asynchronous pi-calculus, ACM Transactions on Programming Languages and Systems (TOPLAS), v.24 n.5, p.566-591, September 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
	Nobuko Yoshida , Matthew Hennessy, Assigning types to processes, Information and Computation, v.174 n.2, p.143-179, May 1 2002
	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
	Nobuko Yoshida, Channel dependent types for higher-order mobile processes, ACM SIGPLAN Notices, v.39 n.1, p.147-160, January 2004
	Cédric Lhoussaine, Type inference for a distributed π-calculus, Science of Computer Programming, v.50 n.1-3, p.225-251, March 2004
	Tom Chothia , Dominic Duggan, Abstractions for fault-tolerant global computing, Theoretical Computer Science, v.322 n.3, p.567-613, 6 September 2004
	Gavin Bierman , Michael Hicks , Peter Sewell , Gareth Stoyle , Keith Wansbrough, Dynamic rebinding for marshalling and update, with destruct-time ?, ACM SIGPLAN Notices, v.38 n.9, p.99-110, September 2003
	Martín Abadi , Bruno Blanchet, Secrecy types for asymmetric communication, Theoretical Computer Science, v.298 n.3, p.387-415, 11 April 2003
	Igor Sobrado, Evaluation of two security schemes for mobile agents, ACM SIGCOMM Computer Communication Review, v.31 n.2 supplement, April 2001
	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
	Rocco De Nicola , Daniele Gorla , Rosario Pugliese, On the expressive power of KLAIM-based calculi, Theoretical Computer Science, v.356 n.3, p.387-421, 30 May 2006
	Dominic Duggan, Type-based cryptographic operations, Journal of Computer Security, v.12 n.3,4, p.485-550, May 2004
	Matthew Hennessy , Julian Rathke, Typed behavioural equivalences for processes in the presence of subtyping, Mathematical Structures in Computer Science, v.14 n.5, p.651-684, October 2004
	James Riely , Matthew Hennessy, Trust and Partial Typing in Open Systems of Mobile Agents, Journal of Automated Reasoning, v.31 n.3-4, p.335-370, 2003
	Dirk Pattinson , Martin Wirsing, A coordination approach to mobile components, Theoretical Computer Science, v.331 n.2-3, p.457-483, 25 February 2005
	Gianluigi Ferrari , Eugenio Moggi , Rosario Pugliese, MetaKlaim: a type safe multi-stage language for global computing, Mathematical Structures in Computer Science, v.14 n.3, p.367-395, June 2004
	Peter Sewell , Gareth Stoyle , Michael Hicks , Gavin Bierman , Keith Wansbrough, Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction, Journal of Functional Programming, v.18 n.4, p.437-502, July 2008