{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T08:58:47Z","timestamp":1767085127092,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,29]]},"DOI":"10.1109\/lics52264.2021.9470708","type":"proceedings-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T20:14:07Z","timestamp":1625688847000},"page":"1-13","source":"Crossref","is-referenced-by-count":4,"title":["On Linear Time Decidability of Differential Privacy for Programs with Unbounded Inputs"],"prefix":"10.1109","author":[{"given":"Rohit","family":"Chadha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. Prasad","family":"Sistla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahesh","family":"Viswanathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978391"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009884"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2019.8785715"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3158146"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314619"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417282"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243818"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243863"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.08.004"},{"key":"ref19","article-title":"On linear time decidability of differential privacy for programs with unbounded inputs","author":"chadha","year":"2021","journal-title":"CoRR"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055331"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.90"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536467"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863568"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3373718.3394796"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2492061"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429113"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1561\/0400000042","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"dwork","year":"2014","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934554"},{"key":"ref1","first-page":"265","article-title":"Calibrating noise to sensitivity in private data analysis","author":"dwork","year":"2006","journal-title":"IACR Theory of Cryptography Conference (TCC)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2746325.2746335"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44584-6_4"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.09.015"},{"key":"ref24","first-page":"41:1","article-title":"The big-o problem for labelled markov chains and weighted automata","volume":"171","author":"chistikov","year":"2020","journal-title":"31st International Conference on Concurrency Theory (CONCUR) ser LIPIcs"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-02768-1_21"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2043621.2043626"},{"key":"ref25","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) ser LIPIcs"}],"event":{"name":"2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2021,6,29]]},"location":"Rome, Italy","end":{"date-parts":[[2021,7,2]]}},"container-title":["2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9470497\/9470501\/09470708.pdf?arnumber=9470708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:46:20Z","timestamp":1652197580000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9470708\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/lics52264.2021.9470708","relation":{},"subject":[],"published":{"date-parts":[[2021,6,29]]}}}