SuperDP refutes ε-DP via simultaneous synthesis of input pairs and witness functions using upper expectation supermartingales and lower expectation submartingales, delivering the first fully automated, sound, and semi-complete method applicable to both discrete and continuous stochastic mechanisms.
In: Chaudhuri, S., Farzan, A
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.PL 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Caesar introduces a deductive verifier for probabilistic programs using the HeyVL language, Z3 SMT solving, and a probabilistic model-checking backend after five years of development.
citing papers explorer
-
SuperDP: Differential Privacy Refutation via Supermartingales
SuperDP refutes ε-DP via simultaneous synthesis of input pairs and witness functions using upper expectation supermartingales and lower expectation submartingales, delivering the first fully automated, sound, and semi-complete method applicable to both discrete and continuous stochastic mechanisms.
-
Caesar: A Deductive Verifier for Probabilistic Programs
Caesar introduces a deductive verifier for probabilistic programs using the HeyVL language, Z3 SMT solving, and a probabilistic model-checking backend after five years of development.