Distributed Computing 1999: Vol 12 Table of Contents

1 Pages·1999·0.14 MB·English

Contents of volume 12
No. 1: pp 1-54 published March 1999
No. 2/3: pp 55-174 published June 1999
No. 4: pp 175-224 published September 1999
Ahamad M ^ Torres-Rojas FJ 179 Hurfin M, Raynal M: A simple and fast Merritt M: Introduction 55
asynchronous consensus protocol based
Brinksma E: Cache consistency by design on a weak failure detector 209 Olivier B Ladkin P 151
61
Janssen W, Poel M, Zwiers J: Pnueli A ^ Jonsson B 129
Chaudhuri P -> Karaata MH 47 The compositional approach to sequential Poel M ^ Janssen W 1C5
consistency and lazy caching 105
Davies J ^ Lowe G 91 Jonsson B, Pnueli A, Rump C: Proving Raynal M ^ Hurfin M 209
refinement using transduction 129 Roegel D ^ Ladkin P 151
Feijs LMG: Generating FSMs from Rump C Jonsson B 129
interworkings 31 Kapus-Kolar M: Comments on deriving
protocol specifications from service Singh G: Constraint-based structuring of
Garcia-Molina H Ketchpel SP 13 specifications written in LOTOS 175 network protocols 1
Gerth R; Sequential consistency and the Karaata MH, Chaudhuri P: A self-stabilizing
lazy caching algorithm 57 algorithm for bridge finding 47 Torres-Rojas FJ, Ahamad M;
Graf S: Characterization of a sequentially Ketchpel SP, Garcia-Molina H: A sound and Plausible clocks: constant size
consistent memory and verification complete algorithm for distributed logical clocks for distributed
of a cache memory by abstraction 75 commerce transactions 13 systems 179
Hesselink WH: Progress under bounded Ladkin P, Lamport L, Olivier B, Roegel D: Zwiers J -> Janssen W 105
fairness 197 Lazy caching in TLA 151
Huang S-T, Liu T-J: Self-stabilizing Lamport L ^ Ladkin P 151
2'”-clock for unidirectional rings of odd Liu T-J Huang S-T 41
size 41 Lowe G, Davies J: Using CSP to verify
sequential consistency 91 Indexed in Current Contents