Taming Confusion for Modeling and Implementing Probabilistic Concurrent Systems
Abstract elided by the publisher.
Related papers
- A relational model of types-and-effects in higher-order concurrent separation logic POPL 2017
- A Domain-Specific Probabilistic Programming Language for Reasoning about Reasoning (Or: A Memo on memo) OOPSLA 2025
- Fair Termination for Parameterized Probabilistic Concurrent Systems TACAS 2017
- Taming Delays in Dynamical Systems - Unbounded Verification of Delay Differential Equations CAV 2019
- GPS: navigating weak memory with ghosts, protocols, and separation OOPSLA 2014
- Don't race the memory bus: taming the GC leadfoot ISMM 2015
- Taming release-acquire consistency POPL 2016
- A concurrency model for JavaScript with cooperative cancellation SLE 2021