A Separation Logic for a Promising Semantics
- Submitting institution
-
University of Cambridge
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1893
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-319-89884-1_13
- Title of conference / published proceedings
- LNCS 10801
- First page
- 357
- Volume
- LNCS 10801
- Issue
- -
- ISSN
- 0302-9743
- Open access status
- Compliant
- Month of publication
- -
- Year of publication
- 2018
- 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
-
4
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The "thin-air problem" is a major open problem in programming-language semantics: currently no mainstream language that aims to support high-performance concurrent code has a satisfactory definition, as it has proved very challenging to define an envelope of allowed behaviour that admits established hardware and compiler optimisations while still ruling out values appearing "out of thin air". This paper demonstrated a technique to compositionally reason about one of the memory models designed to address the out-of-thin-air problem.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -