{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:39:37Z","timestamp":1780994377679,"version":"3.54.1"},"reference-count":54,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-009"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-001"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1947889,CNS-2046425,CNS-2040215,CNS-2040249,CCF-1947889,CCF-1909612"],"award-info":[{"award-number":["CCF-1947889,CNS-2046425,CNS-2040215,CNS-2040249,CCF-1947889,CCF-1909612"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1109\/csf54842.2022.9919653","type":"proceedings-article","created":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T01:29:20Z","timestamp":1667525360000},"page":"396-411","source":"Crossref","is-referenced-by-count":6,"title":["The Complexity of Verifying Boolean Programs as Differentially Private"],"prefix":"10.1109","author":[{"given":"Mark","family":"Bun","sequence":"first","affiliation":[{"name":"Boston University,Department of Computer Science,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Gaboardi","sequence":"additional","affiliation":[{"name":"Boston University,Department of Computer Science,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ludmila","family":"Glinskih","sequence":"additional","affiliation":[{"name":"Boston University,Department of Computer Science,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54792-8_6"},{"key":"ref12","first-page":"635","article-title":"Concentrated differential privacy: Simplifications, extensions, and lower bounds","author":"bun","year":"2016","journal-title":"Theory of Cryptography - 14th International Conference TCC 2016-B Beijing China October 31 - November 3 2016 Proceedings Part I volume 9985 of Lecture Notes in Computer Science"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01090-412"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LICS52264.2021.9470708"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009884"},{"key":"ref52","author":"wegener","year":"1987","journal-title":"The Complexity of Boolean Functions"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188946"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(83)80060-6"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3428233"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210339"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CONCUR.2019.10"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368295"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243818"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417282"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.12"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/0215017"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863568"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(81)90032-3"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(70)80006-X"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.11"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382264"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3360598"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49096-9_7"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.09.015"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2103621.2103670"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934554"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243863"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3373718.3394796"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.679"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2677000"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2014.36"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055331"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-018-0321-1"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10856-4_101"},{"key":"ref37","article-title":"Guidelines for implementing and auditing differentially private systems","author":"kifer","year":"2020","journal-title":"CoRR abs\/2002 04049"},{"key":"ref36","article-title":"The sparse vector technique, revisited","author":"kaplan","year":"2020","journal-title":"Advances in Neural Information Processing Systems 33 Annual Conference on Neural Information Processing Systems NeurIPS 2020"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808660"},{"key":"ref30","first-page":"214","article-title":"Analysis of boolean pro-grams","author":"godefroid","year":"2013","journal-title":"Tools and Algorithms for the Construction and Analysis of Systems - 19th International Conference TACAS 2013 Held as Part of the European Joint Conferences on Theory and Practice of Software ETAPS 2013"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417269"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60449-0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3158146"},{"key":"ref1","year":"0","journal-title":"Quantified Boolean Formulas Satisfiability Library"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-02768-1_21"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)91022-1"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603097"},{"key":"ref23","article-title":"Coupled relational symbolic execution for differential privacy","author":"pietro farina","year":"2020","journal-title":"ESOP"},{"key":"ref26","first-page":"129:1","article-title":"The complexity of verifying loop-free programs as differentially private","volume":"168","author":"gaboardi","year":"2020","journal-title":"47th International Colloquium on Automata Languages and Programming ICALP 2020 July 8–11 2020 Saarbrucken Germany (Virtual Conference)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429113"},{"key":"ref20","first-page":"265","article-title":"Calibrating noise to sensitivity in private data analysis","author":"dwork","year":"2006","journal-title":"Theory of Cryptography Third Theory of Cryptography Conference TCC 2006 New York NY USA March 4–7 2006 Proceedings volume 3876 of Lecture Notes in Computer Science"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1462153.1462154"},{"key":"ref21","article-title":"Concentrated differential privacy","author":"dwork","year":"2016","journal-title":"CoRR abs\/1603 01887"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/09076828X"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.01.015"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636068"}],"event":{"name":"2022 IEEE 35th Computer Security Foundations Symposium (CSF)","location":"Haifa, Israel","start":{"date-parts":[[2022,8,7]]},"end":{"date-parts":[[2022,8,10]]}},"container-title":["2022 IEEE 35th Computer Security Foundations Symposium (CSF)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9919409\/9919636\/09919653.pdf?arnumber=9919653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T23:23:55Z","timestamp":1699485835000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9919653\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":54,"URL":"https:\/\/doi.org\/10.1109\/csf54842.2022.9919653","relation":{},"subject":[],"published":{"date-parts":[[2022,8]]}}}