Analysis of Facile programs: A case study

  • Pierpaolo Degano
  • Corrado Priami
  • Lone Leth
  • Bent Thomsen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1192)


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 apply a non-interleaving semantics to analyse a system based on the mobile agent principle written in the Facile programming language. This example is a scaled down version of a system demonstrated at the European IT Conference Exhibition in Brussels, 1995.

This paper further develops a non-interleaving semantics for Facile, first presented in [4]. We develop 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. This semantics may be instantiated to recover both causality and locality information.


Destination Node Behaviour Expression Mobile Agent Transition Relation Operational Semantic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    R. Borgia. Semantiche causali per FACILE. Master's thesis, Dipartimento di Informatica, Università di Pisa, 1995.Google Scholar
  4. 4.
    Roberta Borgia, Pierpaolo Degano, Corrado Priami, Lone Leth, and Bent Thomsen. Understanding mobile agents via a non-interleaving semantics for facile. In Proceedings of SAS'96, To appear in LNCS. Springer-Verlag, 1996.Google Scholar
  5. 5.
    G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. A theory of processes with localities. Theoretical Computer Science, 114, 1993.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    P. Degano and C. Priami. Proved trees. In Proceedings of ICALP'92, LNCS 623, pages 629–640. Springer-Verlag, 1992.Google Scholar
  8. 8.
    P. Degano and C. Priami. Causality for mobile processes. In Proceedings of ICALP'95, LNCS 944, pages 660–671. Springer-Verlag, 1995.Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    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.Google Scholar
  11. 11.
    L. Leth and B. Thomsen. Some Facile Chemistry. Formal Aspects of Computing, Volume 7, Number 3, pages 314–328, 1995.Google Scholar
  12. 12.
    G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, Denmark, 1981.Google Scholar
  13. 13.
    C. Priami. Enhanced Operational Semantics for Concurrency. PhD thesis, Dipartimento di Informatica, Università di Pisa, March 1996. Available as Tech. Rep. TD-08/96.Google Scholar
  14. 14.
    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.Google Scholar
  15. 15.
    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.Google Scholar
  16. 16.
    Bent Thomsen, Lone Leth, and Tsung-Miu Kuo. A facile tutorial. In Proceedings of CONCUR'96, LNCS 1119, pages 278–298. Springer-Verlag, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Pierpaolo Degano
    • 1
  • Corrado Priami
    • 1
  • Lone Leth
    • 2
  • Bent Thomsen
    • 2
  1. 1.Dipartimento di InformaticaUniversità di PisaPisaItaly
  2. 2.Technology Businesses, Research & Advanced TechnologyICLBracknellUK

Personalised recommendations