Skip to main content

Proving liveness of fair transition systems

  • Conference paper
  • First Online:
  • 141 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1125))

Abstract

A graph-based method for automatically synthesizing liveness proofs of non-finite concurrent systems is described. The implemented procedure is a significant extension of a previous mechanization of TLA[Lam94] in a higher-order logic theorem prover [Bus95].

Supported in part by a grant from the German Federal Ministry of Education, Science, Research and Technology under contract number 01IS519A (project KORSYS).

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Andersen, K.D. Petersen, and J.S. Pettersson, ‘A Graphical Tool for Proving UNITY Progress', in Higher Order Logic Theorem Proving and its Applications, 7th International Workshop, T. Melham, and J. Camilleri (Eds.), pp. 17–32, Springer, LNCS 859, 1994.

    Google Scholar 

  2. N. Bjørner, a. Browne and Z. Manna, ‘Automatic Generation of Invariants and Intermediate Assertions', in First International Conference on Principles and Practice of Constraint Programming, U. Montanari (Ed.), LNCS, Cassis, France, September 1995.

    Google Scholar 

  3. J.C. Bradfield, ‘Verifying Temporal Properties of Systems', Birkhäuser, Progress in Theoretical Computer Science, 1992.

    Google Scholar 

  4. H. Busch, ‘Rule-Based Induction', in FORMAL METHODS IN SYSTEM DESIGN — Special Issue on HOL'92, Kluwer, Vol. 5, Issue 1 & 2, July/August 1994.

    Google Scholar 

  5. H. Busch, ‘A Practical Method for Reasoning About Distributed Systems in a Theorem Prover', in Higher Order Logic Theorem Proving and its Applications, 8th International Workshop, E.T. Schubert, P.J. Windley, J. Alves-Foss (Eds.), pp. 106–121, Springer, LNCS 971, 1995.

    Google Scholar 

  6. K.M. Chandy and J. Misra, ‘Parallel Program Design — A Foundation', Addison-Wesley, 1988.

    Google Scholar 

  7. J. R. Cuéllar, I. Wildgruber, and D. Barnard, ‘Combining the Design of Industrial Systems with Effective Verification Techniques', in Proc. of FME'94, Barcelona, Spain, pp. 639–658, Springer LNCS 873, M. Naftalin, T. Denvir, and M. Betran (Eds.), October 1994.

    Google Scholar 

  8. J. R. Cuéllar and I. Wildgruber, ‘The Dagstuhl Steam-Boiler Controller-Problem — The TLT Solution', Presented at Dagstuhl Seminar 9523, 1995, in The Steam-Boiler Case Study, Springer LNCS, J.-R. Abrial, E. Börger, and H. Langmaack (Eds.), 1996.

    Google Scholar 

  9. U. Engberg, P. Grønning, and L. Lamport, ‘Mechanical Verification of Concurrent Systems with TLA', in CAV'92, 4th International Workshop, G.v. Bochmann and D.K. Probst (Eds.), pp. 44–55, Springer, LNCS 663, 1993.

    Google Scholar 

  10. G. Gouverneur, ‘Korrekter Entwurf und Verifikation verteilter Systeme', Dissertation, University of Kaiserslautern, 1995.

    Google Scholar 

  11. L. Lamport, ‘The Temporal Logic of Actions', ACM Transactions on Programming Languages and Systems, Vol. 16, No. 3, pp. 872–923, May 1994.

    Article  Google Scholar 

  12. L. Lamport, ‘TLA in Pictures', in DIMACS Workshop on Specification of Parallel Algorithms, Princeton, May 1994, 1994.

    Google Scholar 

  13. Z. Manna and A. Pnueli, ‘Verification of Parameterized Programs', in Specification and Validation Methods, E.Börger (Ed.), Oxford University Press, 1994.

    Google Scholar 

  14. G. Sander, ‘VCG — Visualization of Compiler Graphs', User Documentation V.1.30, Saarbrücken University, 1995.

    Google Scholar 

  15. J. v. Wright and T. Långbacka, ‘Using a Theorem Prover for Reasoning about Concurrent Algorithms', in CAV'92, 4th International Workshop, G.v. Bochmann and D.K. Probst (Eds.), Springer, LNCS 663, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Gerhard Goos Juris Hartmanis Jan van Leeuwen Joakim von Wright Jim Grundy John Harrison

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Busch, H. (1996). Proving liveness of fair transition systems. In: Goos, G., Hartmanis, J., van Leeuwen, J., von Wright, J., Grundy, J., Harrison, J. (eds) Theorem Proving in Higher Order Logics. TPHOLs 1996. Lecture Notes in Computer Science, vol 1125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105398

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61587-3

  • Online ISBN: 978-3-540-70641-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics