Reachability is undecidable in the RMW-free fragment of Release/Acquire, but decidable when both context switches and RMWs are bounded.
InProceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
verdicts
UNVERDICTED 5representative citing papers
A dependent linear type theory is constructed by embedding linear logic into dependent type theory, yielding multiplicities that depend on variables, supporting W-types, with semantics in indexed Categories with Families and an Agda implementation.
Introduces the quantum instrument monad I_A as a strong monad for quantum effects, with finitary and measure-theoretic constructions based on a new integral notion.
Establishes a complete axiomatization for probabilistic Boolean circuits via Markov kernel semantics, using intermediate completeness theorems for partial Boolean circuits and probabilistic Boolean tapes in rig categories.
The paper establishes treewidth bounds and MSO-axiomatizability results for weak memory models, introduces reads-from robustness, and derives algorithmic implications for verification.
citing papers explorer
-
On the Decidability of Verification under Release/Acquire
Reachability is undecidable in the RMW-free fragment of Release/Acquire, but decidable when both context switches and RMWs are bounded.
-
Dependent Multiplicities in Dependent Linear Type Theory
A dependent linear type theory is constructed by embedding linear logic into dependent type theory, yielding multiplicities that depend on variables, supporting W-types, with semantics in indexed Categories with Families and an Agda implementation.
-
The quantum instrument monad
Introduces the quantum instrument monad I_A as a strong monad for quantum effects, with finitary and measure-theoretic constructions based on a new integral notion.
-
Completeness for Probabilistic Boolean Tapes
Establishes a complete axiomatization for probabilistic Boolean circuits via Markov kernel semantics, using intermediate completeness theorems for partial Boolean circuits and probabilistic Boolean tapes in rig categories.
-
An MSO Framework for Weak-Memory Verification and Robustness
The paper establishes treewidth bounds and MSO-axiomatizability results for weak memory models, introduces reads-from robustness, and derives algorithmic implications for verification.