Myths about the mutual exclusion problem
From MaRDI portal
Publication:1158954
DOI10.1016/0020-0190(81)90106-XzbMath0474.68031OpenAlexW2036267700MaRDI QIDQ1158954
Publication date: 1981
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(81)90106-x
Related Items
Event-based proof of the mutual exclusion property of Peterson's algorithm ⋮ Weak equivalence of higher-dimensional automata ⋮ Topological abstraction of higher-dimensional automata ⋮ Mutex needs fairness ⋮ A visit to mutual exclusion in seven dates ⋮ An efficient solution to the mutual exclusion problem using weak semaphores ⋮ Temporal Logic and Fair Discrete Systems ⋮ Combining Model Checking and Deduction ⋮ Full Abstraction Without Synchronization Primitives ⋮ Verification of Concurrent Programs on Weak Memory Models ⋮ Limitations of fast consistency conditions for distributed shared memories ⋮ Speedup of Vidyasankar's algorithm for the group \(k\)-exclusion problem ⋮ Property transformation under specification change ⋮ The behavior of shared objects: Concept, pitfalls, and a new model ⋮ An application of temporal projection to interleaving concurrency ⋮ From model checking to equilibrium checking: reactive modules for rational verification ⋮ Off-the-shelf automated analysis of liveness properties for just paths ⋮ Tournaments for mutual exclusion: verification and concurrent complexity ⋮ Stateless model checking for TSO and PSO ⋮ Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting ⋮ Modelling mutual exclusion in a process algebra with time-outs ⋮ Efficient approximate verification of B and Z models via symmetry markers ⋮ Leader-based de-anonymization of an anonymous read/write memory ⋮ Finding and fixing faults ⋮ Temporal-logic property preservation under Z refinement ⋮ Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions ⋮ Implementing sequentially consistent programs on processor consistent platforms ⋮ Arbitration without common modifiable variables ⋮ Unnamed Item ⋮ Initializing memory shared by several processors ⋮ A more efficient generalization of Peterson's mutual exclusion algorithm ⋮ Unnamed Item ⋮ Causal memory: definitions, implementation, and programming ⋮ Asynchronous group mutual exclusion ⋮ Adaptive and efficient mutual exclusion ⋮ Shared-memory mutual exclusion: major research trends since 1986 ⋮ Bounded semantics ⋮ A High-Level Language for Modeling Algorithms and Their Properties ⋮ The assignment problem ⋮ Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation ⋮ Search strategies for resolution in temporal logics ⋮ Unnamed Item ⋮ RGITL: a temporal logic framework for compositional reasoning about interleaved programs ⋮ Compositional reasoning using intervals and time reversal ⋮ Queue based mutual exclusion with linearly bounded overtaking ⋮ Streamlining progress-based derivations of concurrent programs ⋮ Unnamed Item ⋮ On the constructive orbit problem ⋮ To compose, or not to compose, that is the question: an analysis of compositional state space generation ⋮ Compositional analysis of C/C++ programs with veriSoft ⋮ Removing irrelevant information in temporal resolution proofs ⋮ Self-stabilizing \(\ell\)-exclusion ⋮ Optimized Colored Nets Unfolding ⋮ A queue based mutual exclusion algorithm ⋮ Towards a Thread-Local Proof Technique for Starvation Freedom ⋮ CEGAR for compositional analysis of qualitative properties in Markov decision processes ⋮ Theories for mechanical proofs of imperative programs ⋮ Mutual exclusion in fully anonymous shared memory systems ⋮ A new generalization of Dekker's algorithm for mutual exclusion ⋮ Nonatomic dual bakery algorithm with bounded tokens ⋮ Labeled homology of higher-dimensional automata ⋮ A mutual exclusion algorithm with optimally bounded bypasses ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions ⋮ A simple group mutual \(l\)-exclusion algorithm. ⋮ Global serializability of concurrent programs ⋮ A fine-grained solution to the mutual exclusion problem
Cites Work
