Distributed Computing, Volume 12

Volume 12, Number 1, 1999

• Gurdip Singh:
  Constraint-based Structuring of Network Protocols. 1-12
  
• Steven P. Ketchpel, Hector Garcia-Molina:
  A Sound and Complete Algorithm for Distributed Commerce Transactions. 13-29
  
• Loe M. G. Feijs:
  Generating FSMs from Interworkings. 31-40
  
• Shing-Tsaan Huang, Tzong-Jye Liu:
  Self-stabilizing 2^m-Clock for Unidirectional Rings of Odd Size. 41-46
  
• Mehmet Hakan Karaata, Pranay Chaudhuri:
  A Self-Stabilizing Algorithm for Bridge Finding. 47-53
  

Volume 12, Numbers 2-3, 1999

• Michael Merritt:
  Introduction. 55-56
  
• Rob Gerth:
  Sequential Consistency and the Lazy Caching Algorithm. 57-59
  
• Ed Brinksma:
  Cache Consistency by Design. 61-74
  
• Susanne Graf:
  Characterization of a Sequentially Consistent Memory and Verification of a Cache Memory by Abstraction. 75-90
  
• Gavin Lowe, Jim Davies:
  Using CSP to Verify Sequential Consistency. 91-103
  
• Wil Janssen, Mannes Poel, Job Zwiers:
  The Compositional Approach to Sequential Consistency and Lazy Caching. 105-127
  
• Bengt Jonsson, Amir Pnueli, Camilla Rump:
  Proving Refinement Using Transduction. 129-149
  
• Peter B. Ladkin, Leslie Lamport, Bryan Olivier, Denis Roegel:
  Lazy Caching in TLA. 151-174
  

Volume 12, Number 4, 1999

• Monika Kapus-Kolar:
  Comments on Deriving Protocol Specifications from Service Specifications Written in LOTOS. 175-177
  
• Francisco J. Torres-Rojas, Mustaque Ahamad:
  Plausible Clocks: Constant Size Logical Clocks for Distributed Systems. 179-195
  
• Wim H. Hesselink:
  Progress Under Bounded Fairness. 197-207
  
• Michel Hurfin, Michel Raynal:
  A Simple and Fast Asynchronous Consensus Protocol Based on a Weak Failure Detector. 209-223