The Complexity of Verifying Loop-Free Programs as Differentially Private

Marco Gaboardi, Kobbi Nissim, David Purser

47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, Saarbrücken, Germany (Virtual Conference), July 8-11, 2020 — 2020

DOI Link

BibTeX

@inproceedings{DBLP:conf/icalp/GaboardiNP20,
  author = {Gaboardi, Marco and Nissim, Kobbi and Purser, David},
  editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
  title = {The Complexity of Verifying Loop-Free Programs as Differentially Private},
  booktitle = {47th International Colloquium on Automata, Languages, and Programming,
                    {ICALP} 2020, Saarbr{\"{u}}cken, Germany (Virtual Conference), July
                    8-11, 2020},
  series = {LIPIcs},
  volume = {168},
  pages = {129:1--129:17},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year = {2020},
  url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.129},
  doi = {10.4230/LIPICS.ICALP.2020.129},
  timestamp = {Fri, 21 Nov 2025 23:44:11 +0100},
  biburl = {https://dblp.org/rec/conf/icalp/GaboardiNP20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}