Skip to main content
Springer Nature Link
Log in

System description: Verification of distributed Erlang programs

  • Conference paper
  • First Online:
Automated Deduction — CADE-15 (CADE 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1421))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Armstrong, R. Verding, C. Wikström and M. Wiliams, Concurrent Programming in Erlang. 2nd edition, Pretence Hall, 1996.

    Google Scholar 

  2. M. Dam, Compositional proof systems for model checking infinite state processes. In Proceedings CONCUR '95, LNCS 962, p. 12–26, 1995.

    Google Scholar 

  3. M. Dam, L.-å. Fredlund and D. Gurov, Toward Parametric Verification of Open Distributed Systems. To appear in: H. Langmaack, A. Pnueli, W.-P. De Roever (eds.), Compositionality: The Significant Difference, SpringerVerlag, 1998.

    Google Scholar 

  4. E.A. Emerson and C. Lei, Efficient model checking in fragments of the prepositional mu-calculus. In Proceedings LICS'86, p. 267–278, 1986.

    Google Scholar 

  5. D. Gurov, Specification and Verification of Communicating Systems with Value Passing. Ph.D. Thesis, Department of Computer Science, University of Victoria, March 1998.

    Google Scholar 

  6. M. Fröhlich and M. Werner. The graph visualization system daVinci — a user interface for applications. Technical Report 5/94, Department of Computer Science, Bremen University, 1994.

    Google Scholar 

  7. D. Kozen, Results on the prepositional Μ-calculus. Theoretical Computer Science, 27:333–354, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  8. D. Park, Finiteness is mu-ineffable. Theoretical Computer Science, 3:173–181, 1976.

    Article  MathSciNet  Google Scholar 

  9. C. Stirling and D. Walker, Local model checking in the modal mu-calculus. Theoretical Computer Science, 89(1):161–177, 1991.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Laboratory, Ericsson Telecom AB, 126 25, Stockholm, Sweden

    Thomas Arts

  2. Swedish Institute of Computer Science, Box 1263, S-164 28, Kista, Sweden

    Mads Dam, Lars -åke Fredlund & Dilian Gurov

Authors
  1. Thomas Arts
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mads Dam
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lars -åke Fredlund
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dilian Gurov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Claude Kirchner Hélène Kirchner

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arts, T., Dam, M., Fredlund, L.å., Gurov, D. (1998). System description: Verification of distributed Erlang programs. In: Kirchner, C., Kirchner, H. (eds) Automated Deduction — CADE-15. CADE 1998. Lecture Notes in Computer Science, vol 1421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054244

Download citation

  • DOI: https://doi.org/10.1007/BFb0054244

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64675-4

  • Online ISBN: 978-3-540-69110-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics