The Complexity of Predicting Atomicity Violations

DOI10.1007/978-3-642-00768-2_14zbMath1234.68076OpenAlexW1522958625MaRDI QIDQ3617757

P. Madhusudan, Azadeh Farzan

Publication date: 31 March 2009

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00768-2_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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 (5)

Symbolic predictive analysis for concurrent programs ⋮ Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency ⋮ The Complexity of Predicting Atomicity Violations ⋮ Fine-grained complexity of safety verification ⋮ On the Complexity of Bounded Context Switching.

Uses Software

• Atomizer
• Velodrome
• jPredictor
• AVIO

Cites Work

• Unnamed Item
• A high-performance, portable implementation of the MPI message passing interface standard
• On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\)
• Atomizer
• Monitoring Atomicity in Concurrent Programs
• The Complexity of Predicting Atomicity Violations
• Reduction
• Software transactional memory
• Computer Aided Verification
• Causal Atomicity

This page was built for publication: The Complexity of Predicting Atomicity Violations