The complexity of verifying loop-free programs as differentially private

DOI10.4230/LIPICS.ICALP.2020.129MaRDI QIDQ6842441zbMATH OpenFDO

Authors Marco Gaboardi, Kobbi Nissim, David Purser

Publication date 18 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

zbMATH Keywords

differential privacyprogram verificationprobabilistic programs

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

This page was built for publication: The complexity of verifying loop-free programs as differentially private

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842441)