Lazy caching in TLA

Distributed Computing

Volumn 12, Issue 2-3, 1999, Pages 151-174

  Ladkin, Peter ^a   Lamport, Leslie ^b   Olivier, Bryan ^c   Roegel, Denis ^d  

^a BIELEFELD UNIVERSITY   (Germany)

^b Sytems Research Center   (United States)

^c Campus Scientifique ^*  (Netherlands)

^d LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; DATA RECORDING; FORMAL LANGUAGES; SEQUENTIAL SWITCHING; THEOREM PROVING;

LAZY CACHING ALGORITHMS; TEMPORAL LOGIC OF ACTIONS (TLA);

BUFFER STORAGE;

EID: 0033338240     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050063     Document Type: Article

References (22)

1. Abadi M, Lamport L: The existence of refinement mappings. Theor Comput Sci 82(2):253-284 (1991)
2. Abadi M, Lamport L, Merz S: Refining specifications. To appear.
3. Afek Y, Brown G, Merritt M: Lazy caching. ACM Transactions on Programming Languages and Systems 15(1):182-205 (1993)
4. Ashcroft EA: Proving assertions about parallel programs. J Comput Syst Sci 10:110-135 (1975)
5. Chandy KM, Misra J: Parallel Program Design. Addison-Wesley, Reading, Mass. 1988
6. De Millo RA, Lipton RJ, Perlis AJ: Social processes and proofs of theorems and programs. Communications of the ACM 22(5):271-280 (1979)
7. Engberg U, Grønning P, Lamport L: Mechanical verification of concurrent systems with TLA. In: v. Bochmann G, Probst DK (eds) Proceedings of the Fourth International Conference on Computer Aided Verification, Lecture Notes in Computer Science Vol 663, pp 44-55. Springer, Berlin 1992. Proceedings of the Fourth International Conference, CAV'92
8. Gerth R: Sequential consistency and the lazy caching algorithm. Distrib Comput 12: 57-59 (1999)
9. Lam SS, Shankar AU: Protocol verification via projections. IEEE Transactions on Software Engineering SE-10(4):325-342 (1984)
10. Lamport L: What good is temporal logic? In: Mason REA (ed) Information Processing 83: Proceedings of the IFIP 9th World Congress, pp 657-668, Paris, September 1983. IFIP, North-Holland, Amsterdam
11. Lamport L: A simple approach to specifying concurrent systems. Communications of the ACM 32(1):32-45 (1989)
12. +. In: Grossman RL, Nerode A, Ravn AP, Rischel H (eds) Hybrid Systems, Lecture Notes in Computer Science Vol 736, pp 77-102. Springer, Berlin, Heidelberg 1993
13. Lamport L: How to write a long formula. Formal Aspects of Computing 6:580-584 (1994). First appeared as Research Report 119, Digital Equipment Corporation, Systems Research Center
14. Lamport L: The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872-923 (1994)
15. Lamport L: How to write a proof. American Mathematical Monthly 102(7):600-608 (1995)
16. Lamport L: How to make a correct multiprocess program execute correctly on a multiprocessor. IEEE Transactions on Computers 46(7):779-782 (1997)
17. Lamport L. Merz S: Specifying and verifying fault-tolerant systems. In: Langmaack H, de Roever W-P, Vytopil J (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems, Lecture Notes in Computer Science Vol 863, pp 41-76. Springer, Berlin Heidelberg New York 1994
18. Lamport L, Paulson LC: Should your specification language be typed? Research Report 147, Digital Equipment Corporation, Systems Research Center, May 1997, to appear in ACM Transactions on Programming Language and Systems
19. Lynch NA: Distributed Algorithms. Morgan Kaufmann, San Mateo, Ca., 1995
20. Manna Z, Pnueli A: Completing the temporal picture. Theor Comput Sci 83(1):97-130 (1991)
21. Manna Z, Pnueli A: The Temporal Logic of Reactive and Concurrent Systems. Springer, New York 1991
22. Owicki S, Gries D: An axiomatic proof technique for parallel programs I. Acta Informatica 6(4):319-340 (1976)