The Complexity of Verifying Loop-Free Programs as Differentially Private

Marco Gaboardi, Kobbi Nissim, David Purser. The Complexity of Verifying Loop-Free Programs as Differentially Private. In Artur Czumaj, Anuj Dawar, Emanuela Merelli, editors, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference). Volume 168 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

@inproceedings{GaboardiNP20,
  title = {The Complexity of Verifying Loop-Free Programs as Differentially Private},
  author = {Marco Gaboardi and Kobbi Nissim and David Purser},
  year = {2020},
  doi = {10.4230/LIPIcs.ICALP.2020.129},
  url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.129},
  researchr = {https://researchr.org/publication/GaboardiNP20},
  cites = {0},
  citedby = {0},
  booktitle = {47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)},
  editor = {Artur Czumaj and Anuj Dawar and Emanuela Merelli},
  volume = {168},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-138-2},
}