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.
Chapter PDF
Similar content being viewed by others
Keywords
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
R.J.R. Back and J. von Wright. Refinement concepts formalised in higher-order logic. Formal Aspects of Computing, 2:247–272, 1990.
A.J. Camilleri. Mechanizing CSP trace theory in higher order logic. IEEE Transactions of Software Engineering, 16(9):993–1004, 1990.
A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56–68, 1940.
The HOL System Documentation. Cambridge, 1989.
L. Lamport. A temporal logic of actions. Techn. Rep. 57, DEC Systems Research Center, April 1990.
L. Lamport. The temporal logic of actions. Manuscript, January 1991.
T.F. Melham. A mechanized theory of the π-calculus in HOL. Techn. Rep. 244, University of Cambridge Computer Laboratory, January 1992.
J. von Wright. Mechanising the temporal logic of actions in HOL. In Proceedings of the 1991 HOL Tutorial and Workshop. ACM, August 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
von Wright, J., Långbacka, T. (1993). Using a theorem prover for reasoning about concurrent algorithms. In: von Bochmann, G., Probst, D.K. (eds) Computer Aided Verification. CAV 1992. Lecture Notes in Computer Science, vol 663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56496-9_6
Download citation
DOI: https://doi.org/10.1007/3-540-56496-9_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56496-6
Online ISBN: 978-3-540-47572-9
eBook Packages: Springer Book Archive