The TLA +  Proof System: Building a Heterogeneous Verification Platform

  • Kaustuv Chaudhuri
  • Damien Doligez
  • Leslie Lamport
  • Stephan Merz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6255)

Abstract

Model checking has proved to be an efficient technique for finding subtle bugs in concurrent and distributed algorithms and systems. However, it is usually limited to the analysis of small instances of such systems, due to the problem of state space explosion. When model checking finds no more errors, one can attempt to verify the correctness of a model using theorem proving, which also requires efficient tool support.

References

  1. 1.
    Chaudhuri, K., Doligez, D., Lamport, L., Merz, S.: A TLA+ proof system. In: Sutcliffe, G., Rudnicki, P., Schmidt, R., Konev, B., Schulz, S. (eds.) Proc. of the LPAR Workshop Knowledge Exchange: Automated Provers and Proof Assistants (KEAPPA 2008). CEUR Workshop Proceedings, vol. 418, pp. 17–37 (2008)Google Scholar
  2. 2.
    Chaudhuri, K., Doligez, D., Lamport, L., Merz, S.: Verifying safety properties with the TLA+ proof system. In: Giesl, J., Hähnle, R. (eds.) Intl. Joint Conf. Automated Reasoning (IJCAR 2010). LNCS. Springer, Heidelberg (to appear, 2010), http://msr-inria.inria.fr/~doligez/tlaps/ Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Kaustuv Chaudhuri
    • 1
  • Damien Doligez
    • 2
  • Leslie Lamport
    • 3
  • Stephan Merz
    • 4
  1. 1.INRIA SaclayFrance
  2. 2.INRIA RocquencourtFrance
  3. 3.Microsoft Research Silicon ValleyUSA
  4. 4.INRIA NancyFrance

Personalised recommendations