Affiliation:
1. Digital Equipment Corp., Palo Alto, CA
Abstract
The temporal logic of actions (TLA) is a logic for specifying and reasoning about concurrent systems. Systems and their properties are represented in the same logic, so the assertion that a system meets its specification and the assertion that one system implements another are both expressed by logical implication. TLA is very simple; its syntax and complete formal semantics are summarized in about a page. Yet, TLA is not just a logician's toy; it is extremely powerful, both in principle and in practice. This report introduces TLA and describes how it is used to specify and verify concurrent algorithms. The use of TLA to specify and reason about open systems will be described elsewhere.
Publisher
Association for Computing Machinery (ACM)
Reference33 articles.
1. ABADI M. AND LAMPORT L. 1993. Conjoining specifications. Res. Rep. 118 Digital Equipment Corp. Systems Research Center Palo Alto Calif. ABADI M. AND LAMPORT L. 1993. Conjoining specifications. Res. Rep. 118 Digital Equipment Corp. Systems Research Center Palo Alto Calif.
2. The existence of refinement mappings
3. Defining liveness;ALPERN B.;Inf. Process. Lett.,1985
4. Ten Years of Hoare's Logic: A Survey—Part I
5. APT K. R. AND OLDEROG E.-R. 1990. Verification of Sequential and Concurrent Programs. Springer-Verlag New York. APT K. R. AND OLDEROG E.-R. 1990. Verification of Sequential and Concurrent Programs. Springer-Verlag New York.
Cited by
923 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献