On library correctness under weak memory consistency: specifying and verifying concurrent libraries under declarative consistency models
- Submitting institution
-
Imperial College of Science, Technology and Medicine
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 2317
- Type
- E - Conference contribution
- DOI
-
10.1145/3290381
- Title of conference / published proceedings
- Proceedings of the ACM on Programming Languages
- First page
- 68: 1
- Volume
- 3
- Issue
- POPL
- ISSN
- 2475-1421
- Open access status
- Compliant
- Month of publication
- January
- Year of publication
- 2019
- URL
-
-
- Supplementary information
-
10.1145/3290381
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
4
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The first general theory for specifying and verifying concurrent libraries under real-world concurrency conditions present in mainstream CPUs. It bridges the gap between two concurrency settings: sequential consistency (idealised and non-realistic) and weak-memory consistency (real-world CPUs). We assume no pre-existing theory so it is standalone, compositional and fully mechanised in the Coq theorem prover (see http://plv.mpi-sws.org/yacovet/ for appendix and artefact). This work underpins the development of the GenMC automated model-checking tool for concurrent industry code (PLDI'19; https://plv.mpi-sws.org/genmc/) and led to a keynote at APLAS'18 (http://aplas2018.org/speakers/). POPL'19 acceptance rate: 28.8%/267.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
