Advertisement

Using a theorem prover for reasoning about concurrent algorithms

  • Joakim von Wright
  • Thomas Långbacka
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 663)

Abstract

An attempt to mechanise reasoning about concurrent algorithms is described. The HOL theorem prover is used to formalise the semantics of the Temporal Logic of Actions (TLA). Using this formalisation, the proof rules of TLA are proved as theorems in the HOL system. The use of HOL in reasoning about algorithms in TLA is illustrated by two examples: a proof of a program property and an implementation proof.

Keywords

Temporal Logic Proof Assistant High Order Logic Liveness Property Refinement Mapping 
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.

References

  1. 1.
    R.J.R. Back and J. von Wright. Refinement concepts formalised in higher-order logic. Formal Aspects of Computing, 2:247–272, 1990.Google Scholar
  2. 2.
    A.J. Camilleri. Mechanizing CSP trace theory in higher order logic. IEEE Transactions of Software Engineering, 16(9):993–1004, 1990.Google Scholar
  3. 3.
    A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56–68, 1940.Google Scholar
  4. 4.
    The HOL System Documentation. Cambridge, 1989.Google Scholar
  5. 5.
    L. Lamport. A temporal logic of actions. Techn. Rep. 57, DEC Systems Research Center, April 1990.Google Scholar
  6. 6.
    L. Lamport. The temporal logic of actions. Manuscript, January 1991.Google Scholar
  7. 7.
    T.F. Melham. A mechanized theory of the π-calculus in HOL. Techn. Rep. 244, University of Cambridge Computer Laboratory, January 1992.Google Scholar
  8. 8.
    J. von Wright. Mechanising the temporal logic of actions in HOL. In Proceedings of the 1991 HOL Tutorial and Workshop. ACM, August 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Joakim von Wright
    • 1
  • Thomas Långbacka
    • 1
  1. 1.Department of Computer ScienceÅbo Akademi UniversityTurkuFinland

Personalised recommendations