A new solution of Dijkstra's concurrent programming problem
From MaRDI portal
Publication:4766565
Cited in
(80)- Solvability of the asynchronous ranking problem
- Starvation-free mutual exclusion with semaphores
- Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
- Note on an extremal problem arising for unreliable networks in parallel computing
- Causality-based game solving
- Implementing sequentially consistent programs on processor consistent platforms
- Model checking parameterized systems
- Nonatomic mutual exclusion with local spinning
- Nonatomic dual bakery algorithm with bounded tokens
- Group mutual exclusion in linear time and space
- Logical classification of distributed algorithms (Bakery algorithms as an example)
- Abstractions of data types
- A first order logic for specification of timed algorithms: Basic properties and a decidable class
- Highly-fair bakery algorithm using symmetric tokens
- Adaptive mutual exclusion with local spinning
- Verification by augmented abstraction: The automata-theoretic view
- A visit to mutual exclusion in seven dates
- Waiting in concurrent algorithms
- Equational abstractions
- Correctness and concurrent complexity of the black-white bakery algorithm
- The assignment problem
- Analysing mutual exclusion using process algebra with signals
- The space complexity of unbounded timestamps
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
- A distributed resource allocation algorithm for many processes
- The Spotlight Principle
- Hundreds of impossibility results for distributed computing
- A more efficient generalization of Peterson's mutual exclusion algorithm
- Shared-memory mutual exclusion: major research trends since 1986
- Verification of Concurrent Programs on Weak Memory Models
- Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
- Bounded time-stamps
- Linearizable counting networks
- Concurrent abstract state machines
- The complexity of problems in systems of communicating sequential processes
- Mutual exclusion as a matter of priority
- Specification and verification of concurrent programs through refinements
- Tournaments for mutual exclusion: verification and concurrent complexity
- Adaptive solutions to the mutual exclusion problem
- Adaptive and efficient mutual exclusion
- Convex invariant refinement by control node splitting: a heuristic approach
- What is a ``good encoding of guarded choice?
- The mailbox problem
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
- Precise thread-modular abstract interpretation of concurrent programs using relational interference abstractions
- A new generalization of Dekker's algorithm for mutual exclusion
- Proof assistance for real-time systems using an interactive theorem prover
- Real-time verification techniques for untimed systems
- From model checking to equilibrium checking: reactive modules for rational verification
- An efficient subsumption test pipeline for BS(LRA) clauses
- Self-stabilizing \(\ell\)-exclusion
- Approximated parameterized verification of infinite-state processes with global conditions
- Off-the-shelf automated analysis of liveness properties for just paths
- Symmetric and economical solutions to the mutual exclusion problem in a distributed system
- Self-stabilizing timestamps
- Queue based mutual exclusion with linearly bounded overtaking
- Recoverable mutual exclusion
- Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
- Under the hood of the bakery algorithm: mutual exclusion as a matter of priority
- The synchronization of independent processes
- A queue based mutual exclusion algorithm
- Stabilizing mobile philosophers
- Towards a thread-local proof technique for starvation freedom
- Mending fences with self-invalidation and self-downgrade
- Full abstraction without synchronization primitives
- Opportunistic monitoring of multithreaded programs
- Efficient Bounded Timestamping from Standard Synchronization Primitives
- AutoHyper: explicit-state model checking for HyperLTL
- Modelling mutual exclusion in a process algebra with time-outs
- Decision procedures for sequence theories
- Towards an automatic proof of the bakery algorithm
- SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM
- Threshold graphs and synchronization protocols
- Recoverable mutual exclusion with abortability
- scientific article; zbMATH DE number 7453963 (Why is no real title available?)
- Runtime enforcement of hyperproperties
- Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems
- About informatics, distributed computing, and our job: a personal view
- Extending the wait-free hierarchy to multi-threaded systems
- Sound concurrent traces for online monitoring
This page was built for publication: A new solution of Dijkstra's concurrent programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4766565)
