Pages that link to "Item:Q1158954"
From MaRDI portal
The following pages link to Myths about the mutual exclusion problem (Q1158954):
Displaying 50 items.
- Event-based proof of the mutual exclusion property of Peterson's algorithm (Q271900) (← links)
- Topological abstraction of higher-dimensional automata (Q278749) (← links)
- Mutex needs fairness (Q287028) (← links)
- Property transformation under specification change (Q352027) (← links)
- Finding and fixing faults (Q414907) (← links)
- Implementing sequentially consistent programs on processor consistent platforms (Q436746) (← links)
- Bounded semantics (Q483292) (← links)
- Queue based mutual exclusion with linearly bounded overtaking (Q532419) (← links)
- Efficient approximate verification of B and Z models via symmetry markers (Q622591) (← links)
- CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
- Nonatomic dual bakery algorithm with bounded tokens (Q766163) (← links)
- Initializing memory shared by several processors (Q915433) (← links)
- A more efficient generalization of Peterson's mutual exclusion algorithm (Q918655) (← links)
- On the constructive orbit problem (Q976988) (← links)
- A queue based mutual exclusion algorithm (Q1006897) (← links)
- A mutual exclusion algorithm with optimally bounded bypasses (Q1044699) (← links)
- An efficient solution to the mutual exclusion problem using weak semaphores (Q1091125) (← links)
- The behavior of shared objects: Concept, pitfalls, and a new model (Q1119023) (← links)
- Arbitration without common modifiable variables (Q1156675) (← links)
- Theories for mechanical proofs of imperative programs (Q1267030) (← links)
- Global serializability of concurrent programs (Q1318722) (← links)
- A fine-grained solution to the mutual exclusion problem (Q1323338) (← links)
- Limitations of fast consistency conditions for distributed shared memories (Q1351602) (← links)
- Tournaments for mutual exclusion: verification and concurrent complexity (Q1682286) (← links)
- Stateless model checking for TSO and PSO (Q1683934) (← links)
- A new generalization of Dekker's algorithm for mutual exclusion (Q1819931) (← links)
- A simple group mutual \(l\)-exclusion algorithm. (Q1853185) (← links)
- Temporal-logic property preservation under Z refinement (Q1941860) (← links)
- To compose, or not to compose, that is the question: an analysis of compositional state space generation (Q2024367) (← links)
- A visit to mutual exclusion in seven dates (Q2136281) (← links)
- Off-the-shelf automated analysis of liveness properties for just paths (Q2182670) (← links)
- Leader-based de-anonymization of an anonymous read/write memory (Q2193278) (← links)
- The assignment problem (Q2232588) (← links)
- RGITL: a temporal logic framework for compositional reasoning about interleaved programs (Q2251128) (← links)
- Compositional reasoning using intervals and time reversal (Q2251129) (← links)
- Mutual exclusion in fully anonymous shared memory systems (Q2308458) (← links)
- Labeled homology of higher-dimensional automata (Q2324599) (← links)
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions (Q2340255) (← links)
- Speedup of Vidyasankar's algorithm for the group \(k\)-exclusion problem (Q2390288) (← links)
- An application of temporal projection to interleaving concurrency (Q2403529) (← links)
- From model checking to equilibrium checking: reactive modules for rational verification (Q2407463) (← links)
- Streamlining progress-based derivations of concurrent programs (Q2481207) (← links)
- Compositional analysis of C/C++ programs with veriSoft (Q2502271) (← links)
- Towards a Thread-Local Proof Technique for Starvation Freedom (Q2814127) (← links)
- (Q2851053) (← links)
- Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions (Q2961579) (← links)
- A High-Level Language for Modeling Algorithms and Their Properties (Q2999308) (← links)
- Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation (Q3003492) (← links)
- Temporal Logic and Fair Discrete Systems (Q3176360) (← links)
- Combining Model Checking and Deduction (Q3176378) (← links)
