A Deadlock-Free Semantics for Shared Memory Concurrency

DOI10.1007/978-3-642-03466-4_9MaRDI QIDQ3393404zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 3890713
• A promising semantics for relaxed-memory concurrency
• Semantics of Deterministic Shared-Memory Systems
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Deterministic concurrency: a clock-synchronised shared memory approach
• A denotational semantics for shared-memory parallelism and nondeterminism
• Verification, Model Checking, and Abstract Interpretation
• Distributed Computing – IWDC 2005
• Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion

Cited in

(17)

• Deterministic concurrency: a clock-synchronised shared memory approach
• Structural lock correlation with ownership types
• Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
• Thread-Local Semantics and Its Efficient Sequential Abstractions for Race-Free Programs
• Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies
• A specification structure for deadlock-freedom of synchronous processes
• On grainless footprint semantics for shared-memory programs
• Shared-memory mutual exclusion: major research trends since 1986
• How to share concurrent wait-free variables
• Deadlock checking by data race detection
• Effect-polymorphic behaviour inference for deadlock checking
• Deadlock Analysis of Wait-Notify Coordination
• Verification, Model Checking, and Abstract Interpretation
• Bounds on shared memory for mutual exclusion
• Semantics of Deterministic Shared-Memory Systems
• CONCUR 2005 – Concurrency Theory
• Corrigendum to: ``Mutual exclusion in fully anonymous shared memory systems

Describes a project that uses

Uses Software

• Ynot
• Autolocker

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3393404)