Abstract
Mobile agents, i.e. pieces of programs that can be sent around networks of computers, are starting to appear on the Internet. Such programs may be seen as an enrichment of traditional distributed computing. Since mobile agents may carry communication links with them as they move across the network, they create very dynamic interconnection structures that can be extremely complex to analyse. In this paper we analyse a fragment of a system based on the mobile agent principle written in the Facile programming language. We propose a Structural Operational Semantics (SOS) for Facile, giving a proved transition system that records encodings of the derivation trees of transitions in their labels. This information allows us to easily recover non-interleaving semantics for Facile by looking only at the labels of transitions. We use the new Facile semantics to debug an agent based system. This example is a scaled down version of a system demonstrated at the European IT Conference Exhibition in Brussels, 1995.
Work partially supported by ESPRIT Basic Research Action 8130 — LOMAPS
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
K. Ahlers, D. E. Breen, C. Crampton, E. Rose, M. Tucheryan, R. Whitaker, and D. Greer. An augmented vision system for industrial applications. In SPIE Photonics for Industrial Applications Conference Proceedings, October 1994.
R. Amadio, L. Leth, and B. Thomsen. From a concurrent λ-calculus to the π-calculus. In Proceedings of FCT'95, 1995. Full version in technical report ECRC-95-18.
A. Bianchi, S. Coluccini, P. Degano, and C. Priami. An efficient verifier of truly concurrent properties. In V. Malyshkin, editor, Proceedings of PaCT'95, LNCS 964, pages 36–50. Springer-Verlag, 1995.
Roberta Borgia, Pierpaolo Degano, Corrado Priami, Lone Leth, and Bent Thomsen. Understanding mobile agents via a non-interleaving semantics for Facile. Technical Report ECRC-96-4, European Computer-Industry Research Centre, 1996.
R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM Transaction on Programming Languages and Systems, pages 36–72, 1993.
P. Degano and C. Priami. Proved trees. In Proceedings of ICALP'92, LNCS 623, pages 629–640. Springer-Verlag, 1992.
P. Degano and C. Priami. Causality for mobile processes. In Proceedings of ICALP'95, LNCS 944, pages 660–671. Springer-Verlag, 1995.
Felix Gallo. Agent-Tcl: A white paper. Posted to the safe-tcl@cs.utk.edu mailing list, December 1994. Draft document.
A. Giacalone, P. Mishra, and S. Prasad. Facile: A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18:121–160, 1989.
A. Giacalone, P. Mishra, and S. Prasad. Operational and algebraic semantics for Facile: A symmetric integration of concurrent and functional programming. In Proceedings ICALP'90, LNCS 443, pages 765–780. Springer-Verlag, 1990.
James Gosling and Henry McGilton. The Java language environment. White paper, May 1995. Sun Microsystems, 2550 Garcia Avenue, Mountain View, CA 94043, USA. Available at http://www.java.sun.com/.
L. Leth and B. Thomsen. Some Facile Chemistry. Formal Aspects of Computing, Volume 7, Number 3, pages 314–328, 1995.
C. Priami. Enhanced Operational Semantics for Concurrency. PhD thesis, Dipartimento di Informatica, Università di Pisa, March 1996. Available as Tech. Rep. TD-08/96.
J.-P. Talpin. The Calumet Experiment in Facile — A Model for Group Communication and Interaction Control in Cooperative Applications. Technical Report ECRC-94-26, European Computer-Industry Research Centre, 1994.
J.-P. Talpin, P. Marchal, and K.: Ahlers. Calumet — A Reference Manual. Technical Report ECRC-94-30, European Computer-Industry Research Centre, 1994.
B. Thomsen, F. Knabe, L. Leth, and P.-Y. Chevalier. Mobile agents set to work. Communications International, July 1995.
B. Thomsen, L. Leth, and A. Giacalone. Some Issues in the Semantics of Facile Distributed Programming. In Proceedings of the 1992 REX Workshop on “Semantics: Foundations and Applications∝, LNCS 666. Springer-Verlag, 1992.
B. Thomsen, L. Leth., F. Knabe, and P.-Y. Chevalier. Mobile agents. Technical Report ECRC-95-21, European Computer-Industry Research Centre, 1995.
B. Thomsen, L. Leth, S. Prasad, T.-M. Kuo, A. Kramer, F. Knabe, and A. Giacalone. Facile Antigua Release Programming Guide. Technical Report ECRC-93-20, European Computer-Industry Research Centre, 1993.
James E. White. Telescript technology: The foundation for the electronic market-place. General Magic white paper, 2465 Latham Street, Mountain View, CA 94040, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borgia, R., Degano, P., Priami, C., Leth, L., Thomsen, B. (1996). Understanding mobile agents via a non-interleaving semantics for facile. In: Cousot, R., Schmidt, D.A. (eds) Static Analysis. SAS 1996. Lecture Notes in Computer Science, vol 1145. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61739-6_36
Download citation
DOI: https://doi.org/10.1007/3-540-61739-6_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61739-6
Online ISBN: 978-3-540-70674-8
eBook Packages: Springer Book Archive