Proving possibility properties

Theoretical Computer Science

Volumn 206, Issue 1-2, 1998, Pages 341-352

  Lamport, Leslie ^a  

^a HEWLETT PACKARD COMPANY   (United States)

Author keywords

Branching time; Linear time; Temporal logic

Indexed keywords

EID: 0347658952     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00129-7     Document Type: Article

References (10)

1. M. Abadi, L. Lamport, An old-fashioned recipe for real time, ACM Trans. Programming Languages Systems 16 (5) (1994) 1543-1571.
2. B. Alpern, F.B. Schneider, Recognizing safety and liveness, Distributed Computing 2 (3) (1987) 117-126.
3. K.R. Apt, Ten years of Hoare's logic: a survey - part one, ACM Trans. Programming Languages Systems 3 (4) (1981) 431-483.
4. E.A. Emerson, Temporal and modal logic, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B, Ch. 16, Elsevier and MIT Press, Amsterdam and Cambridge, MA, 1990, pp. 995-1072.
5. S.S. Lam, A.U. Shankar, Specifying modules to satisfy interfaces: A state transition system approach, Distributed Comput. 6 (1) (1992) 39-63.
6. L. Lamport, 'Sometime' is sometimes 'not never': a tutorial on the temporal logic of programs, in: Proc. 7th Ann. Symp. on Principles of Programming Languages, ACM SIGACT-SIGPLAN, January 1980, pp. 174-185.
7. L. Lamport, Win and sin: predicate transformers for concurrency, ACM Trans. on Programming Language Systems 12 (3) (1990) 396-428.
8. L. Lamport, The temporal logic of actions, ACM Trans. Programming Languages Systems 16 (3) (1994) 872-.923.
9. N. Lynch, M. Tuttle, Hierarchical correctness proofs for distributed algorithms, in: Proc. 6th Symp. on the Principles of Distributed Computing, ACM, New York, 1987, pp. 137-151.
10. Z. Manna, A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems, Springer, New York, 1991.