Automatic Mutual Exclusion and Atomicity Checks

DOI10.1007/978-3-540-68679-8_32MaRDI QIDQ3507386zbMATH OpenOpenAlexFDO

Authors Martín Abadi

Publication date 19 June 2008

Published in Concurrency, Graphs and Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-68679-8_32

Mathematics Subject Classification ID

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

Recommendations

• Semantics of transactional memory and automatic mutual exclusion
• The mutual exclusion problem. I: A theory of interprocess communication
• The mutual exclusion problem
• Model checking transactional memories
• Automated analysis of mutual exclusion algorithms using CCS

Cited in

(3)

• Automatic Refinement of Split Binary Semaphore
• Semantics of transactional memory and automatic mutual exclusion
• Monitoring Atomicity in Concurrent Programs

This page was built for publication: Automatic Mutual Exclusion and Atomicity Checks

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