Processes are in the eye of the beholder

Theoretical Computer Science

Volumn 179, Issue 1-2, 1997, Pages 333-351

  Lamport, Leslie ^a  

^a HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; EQUIVALENCE CLASSES; FORMAL LANGUAGES; FORMAL LOGIC; PROGRAM PROCESSORS; THEOREM PROVING;

FORMAL EQUIVALENCE PROOF; TEMPORAL LOGIC OF ACTIONS (TLA);

ALGORITHMS;

EID: 0031165223     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00153-3     Document Type: Article

References (7)

1. M. Abadi, L. Lamport and S. Merz, Refining specifications, to appear.
2. C. A. R. Hoare, Communicating sequential processes, Comm. ACM 21(8) (1978) 666-677.
3. R. P. Kurshan and L. Lamport, Verification of a multiplier: 64 bits and beyond, in: C. Courcoubetis, ed., Computer-Aided Verification, Lecture Notes in Computer Science Vol. 697, 166-179. (Springer, Berlin, 1993) Also in: Proc. Fifth Internat. Conf. CAV'93.
4. R. P. Kurshan and L. Lamport, Verification of a multiplier: 64 bits and beyond, in: C. Courcoubetis, ed., Computer-Aided Verification, Lecture Notes in Computer Science Vol. 697, 166-179. (Springer, Berlin, 1993) Also in: Proc. Fifth Internat. Conf. CAV'93.
5. L. Lamport, How to write a proof, Amer. Math. Monthly 102 (1995) 600-608.
6. L. Lamport, The temporal logic of actions, ACM Trans. on Programming Languages and Systems, 16(3) (1994) 872-923.
7. R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, Vol. 92 (Springer, Berlin, 1980).