See this document in CiteSeerX!

Lazy Caching in TLA (1999)  (Make Corrections)  (12 citations)
Peter Ladkin, Leslie Lamport, Bryan Olivier, Denis Roegel
Distributed Computing



  Home/Search   Context   Related

 
View or download:
microsoft.com/users...ladkingerth.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  microsoft.com/u...tml#timeclocks (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We address the problem, proposed by Gerth, of verifying that a simplified version of the lazy caching algorithm of Afek, Brown, and Merritt is sequentially consistent. We specify the algorithm and sequential consistency in , a formal specification language based on TLA (the Temporal Logic of Actions). We then describe how to construct and check a formal TLA correctness proof. (Update)

Similar documents based on text:   More   All
1.3:   Lazy Caching in TLA - Ladkin, Lamport, Olivier, Roegel (1996)   (Correct)
0.3:   Bibliography - Aaic Japan Aircraft   (Correct)
0.2:   Study of the Semantics of "Real" Parallel Languages in TLA - Roegel   (Correct)

BibTeX entry:   (Update)

P. Ladkin, L. Lamport, B. Olivier, and D. Roegel. Lazy caching in tla. Distributed Computing, 1997. http://citeseer.ist.psu.edu/ladkin99lazy.html   More

@article{ ladkin99lazy,
    author = "Peter B. Ladkin and Leslie Lamport and Bryan Olivier and Denis Roegel",
    title = "Lazy Caching in {TLA}",
    journal = "Distributed Computing",
    volume = "12",
    number = "2-3",
    pages = "151-174",
    year = "1999",
    url = "citeseer.ist.psu.edu/ladkin99lazy.html" }
Citations (may not include all citations):
1180   The Temporal Logic of Reactive and Concurrent Systems (context) - Manna, Pnueli - 1991
718   Distributed Algorithms (context) - Lynch - 1995
274   The existence of refinement mappings - Abadi, Lamport - 1991
208   An axiomatic proof technique for parallel programs (context) - Owicki, Gries - 1976
195   Parallel Program Design (context) - Chandy, Misra - 1988
160   What good is temporal logic (context) - Lamport - 1983
121   A simple approach to specifying concurrent systems - Lamport - 1989
120   ACM Transactions on Programming Languages and Systems (context) - Lamport, logic - 1994
51   Mechanical verification of concurrent systems with TLA - Engberg, Grnning et al. - 1992
49   ACM Transactions on Programming Languages and Systems (context) - Afek, rey et al. - 1993
47   Theoretical Computer Science (context) - Manna, Pnueli et al. - 1991
45   IEEE Transactions on Software Engineering (context) - Lam, Shankar et al. - 1984
40   Proving assertions about parallel programs (context) - Ashcroft - 1975
34   American Mathematical Monthly (context) - Lamport, write et al. - 1995
34   Specifying and verifying faulttolerant systems - Lamport, Merz - 1994

[Article contains additional citations not shown here]



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://research.microsoft.com/users/lamport/pubs/pubs.html#time-clocks):   More
Lower Bounds on Consensus - Lamport (2000)   (Correct)
High-Level Specifications: Lessons from Industry - Batson, Lamport (2003)   (Correct)
Formal Specification of a Web Services Protocol - Johnson (2004)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC