Toward Parametric Verification of Open Distributed Systems

  • Mads Dam
  • Lars-åke Fredlund
  • Dilian Gurov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1536)


A logic and proof system is introduced for specifying and proving properties of open distributed systems. Key problems that are addressed include the verification of process networks with a changing interconnection structure, and where new processes can be continuously spawned. To demonstrate the results in a realistic setting we consider a core fragment of the Erlang programming language. Roughly this amounts to a first-order actor language with data types, buffered asynchronous communication, and dynamic process spawning. Our aim is to verify quite general properties of programs in this fragment. The specification logic extends the first-order μ-calculus with Erlang-specific primitives. For verification we use an approach which combines local model checking with facilities for compositional verification. We give a specification and verification example based on a billing agent which controls and charges for user access to a given resource.


Operational Semantic Proof System User Account Proof Rule Valid Sequent 
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. [AD96]
    R. Amadio and M. Dam. A modal theory of types for the π-calculus. In Proc. FTRTFT’96, Lecture Notes in Computer Science, 1135:347–365, 1996.Google Scholar
  2. [AMST97]
    G. Agha, I. A. Mason, S. F. Smith, and C. L. Talcott. A foundation for actor computation. J. Functional Programming, 7:1–72, 1997.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [AVWW96]
    J. Armstrong, R. Virding, C. Wikström, and M. Williams. Concurrent Programming in Erlang (Second Edition). Prentice-Hall International (UK) Ltd., 1996.Google Scholar
  4. [Dam98]
    M. Dam. Proving properties of dynamic process networks. To appear, Information and Computation, 1998. Preliminary version as “Compositional Proof Systems for Model Checking Infinite State Processes”, Proc. CONCUR’95, LNCS 962, pp. 12–26.Google Scholar
  5. [MPW92]
    R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I and II. Information and Computation, 100(1):1–40 and 41–77, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  6. [Par76]
    D. Park. Finiteness is mu-Ineffable. Theoretical Computer Science, 3:173–181, 1976.CrossRefMathSciNetGoogle Scholar
  7. [Sim95]
    A. Simpson. Compositionality via cut-elimination: Hennessy-Milner logic for an arbitrary GSOS. In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 420–430, San Diego, California, 26–29 June 1995. IEEE Computer Society Press.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Mads Dam
    • 1
  • Lars-åke Fredlund
    • 1
  • Dilian Gurov
    • 1
  1. 1.Swedish Institute of Computer ScienceKistaSweden

Personalised recommendations