Extending memory consistency of finite prefixes to infinite computations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2154, Issue , 2001, Pages 411-425

  Glusman, Marcelo ^a   Katz, Shmuel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONSISTENCY MODEL; FINITE COMPUTATIONS; INFINITE STATE SYSTEMS; MEMORY CONSISTENCY; SEQUENTIAL CONSISTENCY; SHARED MEMORY ALGORITHMS; SHARED MEMORY SYSTEM; SHARED-MEMORY PROTOCOL;

MEMORY ARCHITECTURE;

EID: 84944030696     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44685-0_28     Document Type: Conference Paper

References (15)

1. Yehuda Afek, Geoffrey Brown, and Michael Merritt. Lazy caching. ACM Transactions on Programming Languages and Systems, 15(1):182–205, January 1993.
2. Hagit Attiya and Jennifer Welch. Distributed Computing. McGraw-Hill Publishing Company, UK., 1998.
3. Ed Brinksma. Cache consistency by design. Distributed Computing, 12:61–74, 1999.
4. Rob Gerth. Sequential consistency and the lazy caching algorithm. Distributed Computing, 12:57–59, 1999.
5. Marcelo Glusman and Shmuel Katz. Mechanizing proofs of computation equivalence. In Proceedings of 11thInternational Conference on Computer-Aided Verification, CAV’99, volume 1633 of LNCS, pages 354–367. Springer-Verlag, 1999.
6. Susanne Graf. Characterization of a sequentially consistent memory and verification of a cache memory by abstraction. Distributed Computing, 12:75–90, 1999.
7. Wil Janssen, Mannes Poel, and Job Zwiers. The compositional approach to sequential consistency and lazy caching. Distributed Computing, 12:105–127, 1999.
8. Bengt Jonsson, Amir Pnueli, and Camilla Rump. Proving refinement using transduction. Distributed Computing, 12:129–149, 1999.
9. Shmuel Katz. Refinement with global equivalence proofs in temporal logic. In D. Peled, V. Pratt, and G. Holzmann, editors, Partial Order Methods in Verification, pages 59–78. American Mathematical Society, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 29.
10. Peter Ladkin, Leslie Lamport, Bryan Olivier, and Denis Roegel. Lazy caching in TLA. Distributed Computing, 12:151–174, 1999.
11. Leslie Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9):690–691, 1979.
12. Gavin Lowe and Jim Davies. Using CSP to verify sequential consistency. Distributed Computing, 12:91–103, 1999.
13. Z. Manna and A. Pnueli. A hierarchy of temporal properties. In Proceedings of the 9th ACM Symposium on Principles of Distributed Computing (PODC), pages 377–408, New York, NY, 1990. ACM Press.
14. Shaz Qadeer. On the verification of memory models of shared-memory multiprocessors. In Workshop on Shared Memory Protocol Verification, October 2000.
15. Andrew Tanenbaum. Distributed Operating Systems. Prentice-Hall, Inc., 1995