Tournaments for mutual exclusion: verification and concurrent complexity

DOI10.1007/s00165-016-0407-xzbMath1375.68079OpenAlexW2581540022WikidataQ59513603 ScholiaQ59513603MaRDI QIDQ1682286

Wim H. Hesselink

Publication date: 29 November 2017

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-016-0407-x

zbMATH Keywords

concurrencymutual exclusionconcurrent complexityshared variables\textsc{unity}

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)

Uses Software

• UNITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correctness and concurrent complexity of the black-white bakery algorithm
• Verification of sequential and concurrent programs
• Arbitration without common modifiable variables
• Myths about the mutual exclusion problem
• An axiomatic proof technique for parallel programs
• The Rely-Guarantee method for verifying shared variable concurrent programs
• A new solution of Dijkstra's concurrent programming problem
• The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
• The mutual exclusion problem

This page was built for publication: Tournaments for mutual exclusion: verification and concurrent complexity