A Deadlock-Free Semantics for Shared Memory Concurrency

DOI10.1007/978-3-642-03466-4_9zbMath1250.68207OpenAlexW2099973379MaRDI QIDQ3393404

Gérard Boudol

Publication date: 20 August 2009

Published in: Theoretical Aspects of Computing - ICTAC 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03466-4_9

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Effect-polymorphic behaviour inference for deadlock checking ⋮ Deadlock checking by data race detection

Uses Software

• Autolocker
• Ynot

This page was built for publication: A Deadlock-Free Semantics for Shared Memory Concurrency