Freeze after writing: Quasi-deterministic parallel programming with LVars
- Submitting institution
-
University of Cambridge
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 9086
- Type
- E - Conference contribution
- DOI
-
10.1145/2535838.2535842
- Title of conference / published proceedings
- Conference Record of the Annual ACM Symposium on Principles of Programming Languages
- First page
- 257
- Volume
- -
- Issue
- -
- ISSN
- 0730-8566
- Open access status
- Out of scope for open access requirements
- Month of publication
- January
- Year of publication
- 2014
- URL
-
-
- Supplementary information
-
-
- 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
-
3
- Research group(s)
-
-
- Citation count
- 14
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper introduced a model language for concurrent computation. It popularised the idea of using lattice operations to resolve conflicts between writes to shared resources. This fact had been regarded as a theoretical curiosity until we demonstrated that it both simplified proofs and was amenable to high performance implementation. Slightly surprisingly, its biggest impact has been in the distributed systems community, which adopted the lattice-based framework first as the basis of the Lasp programming language, and then subsequently it has become the standard method for establishing the correctness of "conflict-free replicated datatypes", including via machine-checked proofs.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -