Abstract
The Temporal Logic of Actions is a formalism for reasoning about concurrent and reactive systems. In this paper I present a formulation of TLA in the Isabelle theorem prover, in which I make extensive use of facilities in the Isabelle system for embedding different logics, particularly the syntax for easy axiomatisation of logics and the existence of parsing and printing facilities. I show how these aspects of Isabelle have facilitated the embedding, and describe an example proof done within the implementation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi. An axiomatization of Lamport's Temporal Logic of Actions. In CONCUR '90, volume 458 of Lecture Notes in Computer Science. Springer Verlag, 1990. updated version available by ftp.
K. M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison Wesley Publishing Company, Inc., Reading, Massachusetts, 1988.
U. Engberg. Reasoning in the Temporal Logic of Actions. PhD thesis, Aarhus University, 1994.
U. Engberg, P. Gronning, and L. Lamport. Mechanical verification of concurrent systems with TLA. In Proceedings of the Fourth International Workshop on Computer-Aided Verification, 1992.
M. Gordon. Why higher-order logic is a good formalism for specifying and verifying hardware. In G. Milne and P. Subrahmanyam, editors, Formal Aspects of VLSI Design. Elsevier Science, 1986.
S. Kalvala. A Gentle Introduction to Isabelle. Isabelle distribution, available from ftp.cl.cam.ac.uk, 1994.
L. Lamport. Hybrid systems in TLA+. In Grossman et al., editors, Hybrid Systems, volume 736 of LNCS. Springer Verlag, 1993.
L. Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3), 1994.
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, 1992.
L. Paulson. Isabelle: A generic theorem prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994.
A. U. Shankar. An introduction to assertional reasoning for concurrent systems. ACM Computing Surveys, 25(3), 1993.
J. von Wright. Mechanizing the temporal logic of actions in HOL. In M. Archer, J. J. Joyce, K. N. Levitt, and P. J. Windley, editors, Proceedings of the 1991 International Workshop on the HOL Theorem Proving System and its Applications. IEEE Computer Society Press, 1992.
J. von Wright and T. Langbacka. Using a theorem prover for reasoning about concurrent algorithms. In Proceedings of the Fourth International Workshop on Computer-Aided Verification, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kalvala, S. (1995). A formulation of TLA in Isabelle. In: Thomas Schubert, E., Windley, P.J., Alves-Foss, J. (eds) Higher Order Logic Theorem Proving and Its Applications. TPHOLs 1995. Lecture Notes in Computer Science, vol 971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60275-5_67
Download citation
DOI: https://doi.org/10.1007/3-540-60275-5_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60275-0
Online ISBN: 978-3-540-44784-9
eBook Packages: Springer Book Archive