Amaryllis is the first general-purpose probabilistic separation logic supporting dynamic memory allocation, independence, and conditioning, with a mechanized soundness proof in Rocq.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
cs.LO 3years
2026 3roles
background 2polarities
background 2representative citing papers
APPL is a sound, relatively complete abstract program logic that subsumes Hoare, incorrectness, and hyperproperty logics via lattice semantics and a non-idempotent monoidal operator for nondeterminism.
Evidence-tracked tape semantics yields a higher-order logic for randomized programs in which entailments are witnessed by uniform evidence transformers and quantitative probabilities arise by interpretation under a chosen tape measure.
citing papers explorer
-
First Steps Towards Probabilistic Iris: Harmonizing Independence, Conditioning, and Dynamic Heap Allocation
Amaryllis is the first general-purpose probabilistic separation logic supporting dynamic memory allocation, independence, and conditioning, with a mechanized soundness proof in Rocq.
-
A Program Logic for Abstract (Hyper)Properties
APPL is a sound, relatively complete abstract program logic that subsumes Hoare, incorrectness, and hyperproperty logics via lattice semantics and a non-idempotent monoidal operator for nondeterminism.
-
Evidence-Tracked Tape Semantics for Probabilistic Computation
Evidence-tracked tape semantics yields a higher-order logic for randomized programs in which entailments are witnessed by uniform evidence transformers and quantitative probabilities arise by interpretation under a chosen tape measure.