The Complexity of Predicting Atomicity Violations
From MaRDI portal
Recommendations
- Trace-based symbolic analysis for atomicity violations
- Meta-analysis for Atomicity Violations under Nested Locking
- Monitoring Atomicity in Concurrent Programs
- Symbolic predictive analysis for concurrent programs
- Detecting errors in multithreaded programs by generalized predictive analysis of executions
Cites work
- A high-performance, portable implementation of the MPI message passing interface standard
- Atomizer: a dynamic atomicity checker for multithreaded programs
- Causal Atomicity
- Computer Aided Verification
- scientific article; zbMATH DE number 3986679 (Why is no real title available?)
- Monitoring Atomicity in Concurrent Programs
- On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\)
- Reduction
- Software transactional memory
- The Complexity of Predicting Atomicity Violations
Cited in
(11)- Verifying robustness of event-driven asynchronous programs against concurrency
- Trace-based symbolic analysis for atomicity violations
- Tight failure detection bounds on atomic object implementations
- The Complexity of Predicting Atomicity Violations
- Meta-analysis for Atomicity Violations under Nested Locking
- Symbolic predictive analysis for concurrent programs
- Detecting errors in multithreaded programs by generalized predictive analysis of executions
- On the Complexity of Bounded Context Switching.
- Fine-grained complexity of safety verification
- Parameterized complexity of safety of threshold automata
- On synthesis of distributed monitors (invited talk)
This page was built for publication: The Complexity of Predicting Atomicity Violations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617757)