BibTeX record conf/icalp/GaboardiNP20

download as .bib file

@inproceedings{DBLP:conf/icalp/GaboardiNP20,
  author       = {Marco Gaboardi and
                  Kobbi Nissim and
                  David Purser},
  editor       = {Artur Czumaj and
                  Anuj Dawar and
                  Emanuela Merelli},
  title        = {The Complexity of Verifying Loop-Free Programs as Differentially Private},
  booktitle    = {47th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
                  Conference)},
  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    = {Thu, 16 Sep 2021 18:08:34 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/GaboardiNP20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.