Multivalued Possibilities Mappings

Abstraction mappings are one of the major tools used to construct correctness proofs for concurrent algorithms. Several examples are given of situations in which it is useful to allow the abstraction mappings to be multivalued. The examples involve algorithm optimization, algorithm distribution, and proofs of time bounds.

[1]  Barbara T. Blaustein,et al.  System architecture for partition-tolerant distributed databases , 1985, IEEE Transactions on Computers.

[2]  Nancy A. Lynch,et al.  A Theory of Timestamp-Based Concurrency Control for Nested Transactions , 1988, VLDB.

[3]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[4]  Maurice Herlihy.  Extending Multiversion Time-Stamping Protocols to Exploit Type Information , 1987, IEEE Transactions on Computers.

[5]  N. Lynch,et al.  A Lattice-Structured Proof Technique Applied to a Minimum Spanning Tree Algorithm , 1988 .

[6]  Leslie Lamport,et al.  Specifying Concurrent Program Modules , 1983, TOPL.

[7]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[8]  Arthur J. Bernstein,et al.  Proving real-time properties of programs with temporal logic , 1981, SOSP.

[9]  Nancy A. Lynch,et al.  Commutativity-Based Locking for Nested Transactions , 1990, J. Comput. Syst. Sci..

[10]  Martín Abadi,et al.  The Existence of Refinement Mappings , 1988, LICS.

[11]  Doug Terry,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[12]  Roger M. Needham,et al.  Grapevine: an exercise in distributed computing , 1982, CACM.

[13]  Ming Li,et al.  Tape versus Queue and Stacks: The Lower Bounds , 1988, Inf. Comput..

[14]  A. Udaya Shankar,et al.  Protocol Verification via Projections , 1984, IEEE Transactions on Software Engineering.

[15]  Keith A. Bartlett,et al.  A note on reliable full-duplex transmission over half-duplex links , 1969, Commun. ACM.

[16]  Russel Schaffer,et al.  On the correctness of atomic multi-writer registers , 1988 .

[17]  David P. Reed,et al.  Implementing atomic actions on decentralized data , 1983, TOCS.

[18]  Michael Merritt,et al.  Time-Constrained Automata (Extended Abstract) , 1991, CONCUR.

[19]  Nancy A. Lynch,et al.  Hierarchical correctness proofs for distributed algorithms , 1987, PODC '87.

[20]  Bard Bloom.  Constructing Two-Writer Atomic Registers , 1988, IEEE Trans. Computers.

[21]  Joseph Y. Halpern,et al.  A little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols , 1992, JACM.

[22]  Nancy A. Lynch,et al.  Concurrency control for resilient nested transactions , 1983, PODS '83.