Formal Verification of a Lazy Concurrent List-Based Set Algorithm
No abstract available.
DOI 10.1007/11817963_44
Related papers
- Fragment Abstraction for Concurrent Shape Analysis ESOP 2018
- Modular verification of linearizability with non-fixed linearization points PLDI 2013
- Modular Verification of Safe Memory Reclamation in Concurrent Separation Logic OOPSLA 2023
- A program logic for concurrent objects under fair scheduling POPL 2016
- Automated Verification of Concurrent Linked Lists with Counters SAS 2002
- Streaming transducers for algorithmic verification of single-pass list-processing programs POPL 2011
- Lazy Type Inference for the Strictness Analysis of Lists ESOP 1994
- Stratified Commutativity in Verification Algorithms for Concurrent Programs POPL 2023