1. PODC 1982: Ottawa, Canada

ACM SIGACT-SIGOPS Symposium on Princiles of Distributed Computing, August 18-20, 1982, Ottawa, Canada. ACM, ISBN 0-89791-081-8

Session 1

Carla Schlatter Ellis, Jerome A. Feldman, James E. Heliotis: Language Constructs and Support Systems for Distributed Computing. 1-9
David Gelernter, Arthur J. Bernstein: Distributed Communication via Global Buffer. 10-18
Piyush Mehrotra, Terrence W. Pratt: Language Concepts for Distributed Processing of Large Arrays. 19-28
Shimon Cohen, Daniel J. Lehmann: Dynamic Systems and Their Distributed Termination. 29-33
Paul J. Leach, Bernard L. Stumpf, James A. Hamilton, Paul H. Levine: UIDS as Internal Names in a Distributed File System. 34-41
Pamela Zave: Testing Incomplete Specifications of Distributed Systems. 42-48

Jeffrey M. Jaffe: Distributed Multi-Destination Routing: The Constraints of Local Information. 49-54
Eli Upfal: Efficient Schemes for Parallel Communication. 55-59
Romas Aleliunas: Randomized Parallel Communication (Preliminary Version). 60-72
Gregory R. Andrews, David P. Dobkin, Peter J. Downey: Distributed Allocation with Pools of Servers. 73-83
John H. Reif, Paul G. Spirakis: Real Time Resource Allocation in Distributed Systems. 84-94
Danny Dolev, José Meseguer, Marshall C. Pease: Finding Safe Paths in a Faulty Environment. 95-103

Robin Milner: Four Combinators for Concurrency. 104-110
Ralph-Johan Back, Heikki Mannila: A Refinement of Kahn's Semantic to Handle Non-Determinism and Communication (Extended Abstract). 111-120
Osvaldo Carvalho, Gérard Roucairol: On the Distribution of an Assertion. 121-131
Danny Dolev, Rüdiger Reischuk: Bounds on Information Exchange for Byzantine Agreement. 132-140
Richard D. Schlichting, Fred B. Schneider: Understanding and Using Asynchronous Message Passing (Preliminary Version). 141-147
A. Prasad Sistla, Edmund M. Clarke, Nissim Francez, Yuri Gurevich: Can Message Buffers be Characterized in Linear Temporal Logic? 148-156

K. Mani Chandy, Jayadev Misra: A Distributed Algorithm for Detecting Resource Deadlocks in Distributed Systems. 157-164
Gregory R. Andrews, Gary Levin: On-the-fly Deadlock Prevention. 165-172
Henry F. Korth: Edge Locks and Deadlock Avoidance in Distributed Systems. 173-182
R. Balter, P. Berard, Paul Decitre: Why Control of the Concurrency Level in Distributed Systems is More Fundamental Than Deadlock Management. 183-193
Marie-Paule Flé, Gérard Roucairol: On Serializability of Iterated Transactions. 194-200
Jayadev Misra, K. Mani Chandy, Todd Smith: Proving Safety and Liveness of Communicating Processes with Examples. 201-208

Arthur J. Bernstein, Nathan Goodman: Concurrency Control Algorithms for Multiversion Database Systems. 209-215
Abraham Silberschatz: A Multi-Version Concurrency Scheme With No Rollbacks. 216-223
H. Breitwieser, M. Leszak: A Distributed Transaction Processing Protocol Based on Majority Consensus. 224-237
Eli Shamir, Eli Upfal: N-Processors Graph Distributively Achieve Perfect Matchings in O(log²N) Beats. 238-241
Marc Snir: On Parallel Searching (Extended Abstract). 242-253
Karel Culik II, Jan K. Pachl: Folding and Unrolling Systolic Arrays (Preliminary Version). 254-261