Pages that link to "Item:Q4766565"
From MaRDI portal
The following pages link to A new solution of Dijkstra's concurrent programming problem (Q4766565):
Displaying 23 items.
- Towards a Thread-Local Proof Technique for Starvation Freedom (Q2814127) (← links)
- The space complexity of long-lived and one-shot timestamp implementations (Q2943392) (← links)
- Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions (Q2961579) (← links)
- (Q3130545) (← links)
- SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM (Q3146520) (← links)
- Model Checking Parameterized Systems (Q3176379) (← links)
- Full Abstraction Without Synchronization Primitives (Q3178268) (← links)
- Verification of Concurrent Programs on Weak Memory Models (Q3179387) (← links)
- Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority (Q3460731) (← links)
- (Q5014797) (← links)
- (Q5020945) (← links)
- Adaptive solutions to the mutual exclusion problem (Q5136975) (← links)
- Linearizable counting networks (Q5137016) (← links)
- Adaptive and efficient mutual exclusion (Q5138379) (← links)
- Shared-memory mutual exclusion: major research trends since 1986 (Q5138486) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Convex Invariant Refinement by Control Node Splitting: a Heuristic Approach (Q5170180) (← links)
- The Spotlight Principle (Q5452606) (← links)
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking (Q5458321) (← links)
- Verification by augmented abstraction: The automata-theoretic view (Q5946060) (← links)
- A first order logic for specification of timed algorithms: Basic properties and a decidable class (Q5957904) (← links)
- Self-stabilizing \(\ell\)-exclusion (Q5958773) (← links)
- Modelling mutual exclusion in a process algebra with time-outs (Q6053409) (← links)
