Automatic Atomicity Verification for Clients of Concurrent Data Structures
Abstract elided by the publisher.
Related papers
- RELINCHE: Automatically Checking Linearizability under Relaxed Memory Consistency POPL 2025
- Automatic scalable atomicity via semantic locking PPoPP 2015
- Automatic semantic locking PPoPP 2014
- Symbolic abstract data type inference POPL 2016
- Model-based, event-driven programming paradigm for interactive web applications Onward! 2013
- Automated Robustness Verification of Concurrent Data Structure Libraries against Relaxed Memory Models OOPSLA 2024
- Concurrent libraries with foresight PLDI 2013
- Testing atomicity of composed concurrent operations OOPSLA 2011