We argue that it is possible, and sometimes useful, to reason about nonatomic programs within the conventional atomic model of concurrency.
Cites work
- Adequate proof principles for invariance and liveness properties of concurrent programs
- An axiomatic proof technique for parallel programs
- scientific article; zbMATH DE number 3541913 (Why is no real title available?)
- On interprocess communication. II: Algorithms
- Proving the Correctness of Multiprocess Programs
- The ``Hoare Logic of CSP, and All That
Cited in
(8)- Global serializability of concurrent programs
- A fine-grained solution to the mutual exclusion problem
- Partial order and contextual net semantics for atomic and locally atomic CC programs
- Nonatomic mutual exclusion with local spinning
- Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
- scientific article; zbMATH DE number 1761891 (Why is no real title available?)
- Atomic polymorphism
- Process-algebraic models of multi-writer multi-reader non-atomic registers
This page was built for publication: Atomic semantics of nonatomic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111361)