A corrected, machine-checked proof shows that relational safety implies epistemic security for reactive programs with declassification annotations.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Assuming You Knew: Fixing an Epistemic Semantics for Flow Policies Using Agentic AI
A corrected, machine-checked proof shows that relational safety implies epistemic security for reactive programs with declassification annotations.