{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:13:40Z","timestamp":1770293620262,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T00:00:00Z","timestamp":1732147200000},"content-version":"vor","delay-in-days":372,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1900924, 1553548, 1901069, 2007428"],"award-info":[{"award-number":["1900924, 1553548, 1901069, 2007428"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,15]]},"DOI":"10.1145\/3576915.3623170","type":"proceedings-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:35:13Z","timestamp":1700570113000},"page":"1761-1775","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Deciding Differential Privacy of Online Algorithms with Multiple Variables"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1674-1650","authenticated-orcid":false,"given":"Rohit","family":"Chadha","sequence":"first","affiliation":[{"name":"University of Missouri, Columbia, MO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8331-7912","authenticated-orcid":false,"given":"A. Prasad","family":"Sistla","sequence":"additional","affiliation":[{"name":"University of Illinois at Chicago, Chicago, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7977-0080","authenticated-orcid":false,"given":"Mahesh","family":"Viswanathan","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7522-5878","authenticated-orcid":false,"given":"Bishnu","family":"Bhusal","sequence":"additional","affiliation":[{"name":"University of Missouri, Columbia, MO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158146"},{"key":"e_1_3_2_1_2_1","volume-title":"Deciding Differential Privacy for Programs with Finite Inputs and Outputs. In 35th Annual ACM\/IEEE Symposium on Logic in Computer Science. 141--154","author":"Barthe Gilles","year":"2020","unstructured":"Gilles Barthe, Rohit Chadha, Vishal Jagannath, A. Prasad Sistla, and Mahesh Viswanathan. 2020. Deciding Differential Privacy for Programs with Finite Inputs and Outputs. In 35th Annual ACM\/IEEE Symposium on Logic in Computer Science. 141--154."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978391"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934554"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492061"},{"key":"e_1_3_2_1_6_1","unstructured":"David Beazley. 2022. GitHub - dabeaz\/ply: Python Lex-Yacc -- github.com. https:\/\/github.com\/dabeaz\/ply. [Accessed 24-Jan-2023]."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.8332275"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (CCS). 508--524","author":"Bichsel Benjamin","unstructured":"Benjamin Bichsel, Timon Gehr, Dana Drachsler-Cohen, Petar Tsankov, and Martin T. Vechev. 2018. DP-Finder: Finding Differential Privacy Violations by Sampling and Optimization. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (CCS). 508--524."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF54842.2022.9919653"},{"key":"e_1_3_2_1_10_1","volume-title":"On Linear Time Decidability of Differential Privacy for Programs with Unbounded Inputs. In 36th Annual IEEE Symposium on Logic in Computer Science (LICS). 1--13","author":"Chadha Rohit","year":"2021","unstructured":"Rohit Chadha, A. Prasad Sistla, and Mahesh Viswanathan. 2021. On Linear Time Decidability of Differential Privacy for Programs with Unbounded Inputs. In 36th Annual IEEE Symposium on Logic in Computer Science (LICS). 1--13."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Rohit Chadha A. Prasad Sistla Mahesh Viswanathan and Bishnu Bhusal. 2023. Deciding Differential Privacy of Online Algorithms with Multiple Variables. http:\/\/arxiv.org\/","DOI":"10.1145\/3576915.3623170"},{"key":"e_1_3_2_1_12_1","volume-title":"Generalized Bisimulation Metrics. In 35th International Conference on Concurrency Theory (CONCUR). 32--46","author":"Chatzikokolakis Konstantinos","year":"2014","unstructured":"Konstantinos Chatzikokolakis, Daniel Gebler, Catuscia Palamidessi, and Lili Xu. 2014. Generalized Bisimulation Metrics. In 35th International Conference on Concurrency Theory (CONCUR). 32--46."},{"key":"e_1_3_2_1_13_1","volume-title":"The Big-O Problem for Labelled Markov Chains and Weighted Automata. In 31st International Conference on Concurrency Theory (CONCUR) (LIPIcs)","volume":"171","author":"Chistikov Dmitry","year":"2020","unstructured":"Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, and David Purser. 2020. The Big-O Problem for Labelled Markov Chains and Weighted Automata. In 31st International Conference on Concurrency Theory (CONCUR) (LIPIcs), Vol. 171. 41:1--41:19."},{"key":"e_1_3_2_1_14_1","volume-title":"The igraph software package for complex network research. InterJournal","author":"Csardi Gabor","unstructured":"Gabor Csardi and Tamas Nepusz. 2006. The igraph software package for complex network research. InterJournal , Vol. Complex Systems (2006), 1695. https:\/\/igraph.org"},{"key":"e_1_3_2_1_15_1","volume-title":"Really Natural Linear Indexed Type Checking. In 26th 2014 International Symposium on Implementation and Application of Functional Languages (IFL). 5:1--5:12","author":"de Amorim Arthur Azevedo","year":"2014","unstructured":"Arthur Azevedo de Amorim, Marco Gaboardi, Emilio Jes\u00fa s Gallego Arias, and Justin Hsu. 2014. Really Natural Linear Indexed Type Checking. In 26th 2014 International Symposium on Implementation and Application of Functional Languages (IFL). 5:1--5:12."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/3470152.3470192"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243818"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_1_19_1","volume-title":"ACM SIGACT Symposium on Theory of Computing (STOC). 381--390","author":"Dwork Cynthia","unstructured":"Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, and Salil P. Vadhan. 2009. On the complexity of differentially private data release: efficient algorithms and hardness results. In ACM SIGACT Symposium on Theory of Computing (STOC). 381--390."},{"key":"e_1_3_2_1_20_1","first-page":"3","article-title":"The Algorithmic Foundations of Differential Privacy","volume":"9","author":"Dwork Cynthia","year":"2014","unstructured":"Cynthia Dwork and Aaron Roth. 2014. The Algorithmic Foundations of Differential Privacy. Foundations and Trends in Theoretical Computer Science, Vol. 9, 3--4 (2014), 211--407.","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"e_1_3_2_1_21_1","unstructured":"Python Software Foundation. 2023. pyperf: A toolkit to write run and analyze benchmarks. https:\/\/github.com\/psf\/pyperf. Accessed on 24-Jan-2023."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429113"},{"key":"e_1_3_2_1_23_1","volume-title":"47th International Colloquium on Automata, Languages, and Programming, (ICALP) (LIPIcs)","volume":"168","author":"Gaboardi Marco","year":"2020","unstructured":"Marco Gaboardi, Kobbi Nissim, and David Purser. 2020. The Complexity of Verifying Loop-Free Programs as Differentially Private. In 47th International Colloquium on Automata, Languages, and Programming, (ICALP) (LIPIcs), Vol. 168. 129:1--129:17."},{"key":"e_1_3_2_1_24_1","volume-title":"PSI: Exact Symbolic Inference for Probabilistic Programs. In International Conference on Computer Aided Verification. Springer, 62--83","author":"Gehr Timon","year":"2016","unstructured":"Timon Gehr, Sasa Misailovic, and Martin Vechev. 2016. PSI: Exact Symbolic Inference for Probabilistic Programs. In International Conference on Computer Aided Verification. Springer, 62--83."},{"key":"e_1_3_2_1_25_1","volume-title":"Programming Languages and Systems - 16th Asian Symposium, (APLAS) (Lecture Notes in Computer Science)","author":"Liu Depeng","unstructured":"Depeng Liu, Bow-Yaw Wang, and Lijun Zhang. 2018. Model Checking Differentially Private Properties. In Programming Languages and Systems - 16th Asian Symposium, (APLAS) (Lecture Notes in Computer Science), Vol. 11275. 394--414."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055331"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming (ICFP). 157--168","author":"Reed Jason","unstructured":"Jason Reed and Benjamin C. Pierce. 2010. Distance Makes the Types Grow Stronger: A Calculus for Differential Privacy. In Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming (ICFP). 157--168."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.09.015"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417282"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314619"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009884"}],"event":{"name":"CCS '23: ACM SIGSAC Conference on Computer and Communications Security","location":"Copenhagen Denmark","acronym":"CCS '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623170","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3623170","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3623170","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T01:48:14Z","timestamp":1755740894000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623170"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":31,"alternative-id":["10.1145\/3576915.3623170","10.1145\/3576915"],"URL":"https:\/\/doi.org\/10.1145\/3576915.3623170","relation":{},"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"2023-11-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}