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.
Probabilistic Concurrent Reasoning in Outcome Logic: Independence, Conditioning, and Invariants,
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.LO 3years
2026 3representative citing papers
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.
Connects noninterference to conditional independence to enable verification of probing security for masked algorithms via Lilac separation logic and new proof rules.
citing papers explorer
-
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.
-
Formal Verification of Probing Security via Conditional Independence
Connects noninterference to conditional independence to enable verification of probing security for masked algorithms via Lilac separation logic and new proof rules.