Global serializability of concurrent programs
From MaRDI portal
Publication:1318722
DOI10.1016/0304-3975(94)90053-1zbMath0795.68132OpenAlexW2084848907MaRDI QIDQ1318722
Publication date: 5 April 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90053-1
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Unnamed Item
- A theorem on atomicity in distributed algorithms
- On interprocess communication. II: Algorithms
- Atomic semantics of nonatomic programs
- On describing the behavior and implementation of distributed systems
- Myths about the mutual exclusion problem
- Multilevel atomicity—a new correctness criterion for database concurrency control
- The serializability of concurrent database updates
- Formal Aspects of Serializability in Database Concurrency Control
This page was built for publication: Global serializability of concurrent programs