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: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
years
2026 5verdicts
UNVERDICTED 5roles
method 1polarities
use method 1representative citing papers
Proof nets are defined for PiL with a correctness criterion, sequentialization procedure, and translation algorithm, establishing a canonical representation of sequent calculus derivations modulo rule permutations.
Graphical Algebraic Geometry creates universal diagrammatic languages for commutative algebras and affine varieties that also characterize the qudit ZH calculus for quantum computation.
dARL supplies a sound deductive refinement calculus with trace semantics for verifying and simplifying differential-algebraic programs, shown complete for index reduction certification.
All control systems perform computation according to ART, including purely mechanical ones like the centrifugal governor, which therefore cannot serve as a counter-example in cognitive computationalism.
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.
-
Proof Nets for PiL (Full Version)
Proof nets are defined for PiL with a correctness criterion, sequentialization procedure, and translation algorithm, establishing a canonical representation of sequent calculus derivations modulo rule permutations.
-
Graphical Algebraic Geometry: From Ideals and Varieties to Quantum Calculi
Graphical Algebraic Geometry creates universal diagrammatic languages for commutative algebras and affine varieties that also characterize the qudit ZH calculus for quantum computation.
-
A Deductive Refinement Calculus for Differential-Algebraic Programs
dARL supplies a sound deductive refinement calculus with trace semantics for verifying and simplifying differential-algebraic programs, shown complete for index reduction certification.
-
When does a control system compute? Digital, mechanical and open-loop systems
All control systems perform computation according to ART, including purely mechanical ones like the centrifugal governor, which therefore cannot serve as a counter-example in cognitive computationalism.