{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T03:11:54Z","timestamp":1775790714030,"version":"3.50.1"},"reference-count":63,"publisher":"Association for Computing Machinery (ACM)","issue":"OOPSLA2","license":[{"start":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T00:00:00Z","timestamp":1667174400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"name":"DARPA","award":["HR001120C0087"],"award-info":[{"award-number":["HR001120C0087"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1901278"],"award-info":[{"award-number":["1901278"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004944","name":"Department of Energy, Labor and Economic Growth","doi-asserted-by":"publisher","award":["DE-SC0022396"],"award-info":[{"award-number":["DE-SC0022396"]}],"id":[{"id":"10.13039\/100004944","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2022,10,31]]},"abstract":"<jats:p>Existing approaches for statically enforcing differential privacy in higher order languages use either linear or relational refinement types. A barrier to adoption for these approaches is the lack of support for expressing these \u201cfancy types\u201d in mainstream programming languages. For example, no mainstream language supports relational refinement types, and although Rust and modern versions of Haskell both employ some linear typing techniques, they are inadequate for embedding enforcement of differential privacy, which requires \u201cfull\u201d linear types. We propose a new type system that enforces differential privacy, avoids the use of linear and relational refinement types, and can be easily embedded in richly typed programming languages like Haskell. We demonstrate such an embedding in Haskell, demonstrate its expressiveness on case studies, and prove soundness of our type-based enforcement of differential privacy.<\/jats:p>","DOI":"10.1145\/3563313","type":"journal-article","created":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T20:23:35Z","timestamp":1667247815000},"page":"699-728","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Solo: a lightweight static analysis for differential privacy"],"prefix":"10.1145","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1860-2360","authenticated-orcid":false,"given":"Chik\u00e9","family":"Abuah","sequence":"first","affiliation":[{"name":"University of Vermont, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2314-0287","authenticated-orcid":false,"given":"David","family":"Darais","sequence":"additional","affiliation":[{"name":"Galois, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3203-3742","authenticated-orcid":false,"given":"Joseph P.","family":"Near","sequence":"additional","affiliation":[{"name":"University of Vermont, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,10,31]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3226070"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.7079930"},{"key":"e_1_2_1_3_1","volume-title":"Solo: A Lightweight Static Analysis for Differential Privacy. arXiv preprint arXiv:2105.01632.","author":"Abuah Chike","year":"2021","unstructured":"Chike Abuah , David Darais , and Joseph P Near . 2021 . Solo: A Lightweight Static Analysis for Differential Privacy. arXiv preprint arXiv:2105.01632. Chike Abuah, David Darais, and Joseph P Near. 2021. Solo: A Lightweight Static Analysis for Differential Privacy. arXiv preprint arXiv:2105.01632."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF51468.2021.00043"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158146"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2666356.2594299"},{"key":"e_1_2_1_7_1","volume-title":"Justin Hsu, Aaron Roth, and Pierre-Yves Strub.","author":"Barthe Gilles","year":"2015","unstructured":"Gilles Barthe , Marco Gaboardi , Emilio Jes\u00fas Gallego Arias , Justin Hsu, Aaron Roth, and Pierre-Yves Strub. 2015 . Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy. In POPL. ACM , 55\u201368. Gilles Barthe, Marco Gaboardi, Emilio Jes\u00fas Gallego Arias, Justin Hsu, Aaron Roth, and Pierre-Yves Strub. 2015. Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy. In POPL. ACM, 55\u201368."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934554"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103670"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492061"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243863"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2784731.2784733"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2784731.2784758"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53641-4_24"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243828"},{"key":"e_1_2_1_16_1","volume-title":"Marco Gaboardi, and Justin Hsu.","author":"de Amorim Arthur Azevedo","year":"2015","unstructured":"Arthur Azevedo de Amorim , Emilio Jes\u00fas Gallego Arias , Marco Gaboardi, and Justin Hsu. 2015 . Really Natural Linear Indexed Type Checking. CoRR , abs\/1503.04522 (2015), arxiv:1503.04522. arxiv:1503.04522 Arthur Azevedo de Amorim, Emilio Jes\u00fas Gallego Arias, Marco Gaboardi, and Justin Hsu. 2015. Really Natural Linear Indexed Type Checking. CoRR, abs\/1503.04522 (2015), arxiv:1503.04522. arxiv:1503.04522"},{"key":"e_1_2_1_17_1","volume-title":"Metric Semantics for Probabilistic Relational Reasoning. CoRR, abs\/1807.05091","author":"de Amorim Arthur Azevedo","year":"2018","unstructured":"Arthur Azevedo de Amorim , Marco Gaboardi , Justin Hsu , and Shin-ya Katsumata. 2018. Metric Semantics for Probabilistic Relational Reasoning. CoRR, abs\/1807.05091 ( 2018 ), arxiv:1807.05091. arxiv:1807.05091 Arthur Azevedo de Amorim, Marco Gaboardi, Justin Hsu, and Shin-ya Katsumata. 2018. Metric Semantics for Probabilistic Relational Reasoning. CoRR, abs\/1807.05091 (2018), arxiv:1807.05091. arxiv:1807.05091"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2019.8785715"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243818"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork Frank McSherry Kobbi Nissim and Adam Smith. 2006. Calibrating noise to sensitivity in private data analysis. In Theory of cryptography conference. 265\u2013284. \t\t\t\t  Cynthia Dwork Frank McSherry Kobbi Nissim and Adam Smith. 2006. Calibrating noise to sensitivity in private data analysis. In Theory of cryptography conference. 265\u2013284.","DOI":"10.1007\/11681878_14"},{"key":"e_1_2_1_21_1","volume-title":"The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science, 9, 3\u20134","author":"Dwork Cynthia","year":"2014","unstructured":"Cynthia Dwork and Aaron Roth . 2014. The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science, 9, 3\u20134 ( 2014 ), 211\u2013407. Cynthia Dwork and Aaron Roth. 2014. The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science, 9, 3\u20134 (2014), 211\u2013407."},{"key":"e_1_2_1_22_1","volume-title":"The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science, 9, 3\u20134","author":"Dwork Cynthia","year":"2014","unstructured":"Cynthia Dwork and Aaron Roth . 2014. The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science, 9, 3\u20134 ( 2014 ), 211\u2013407. Cynthia Dwork and Aaron Roth. 2014. The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science, 9, 3\u20134 (2014), 211\u2013407."},{"key":"e_1_2_1_23_1","unstructured":"Hamid Ebadi and David Sands. 2015. Featherweight PINQ. arxiv:1505.02642. \t\t\t\t  Hamid Ebadi and David Sands. 2015. Featherweight PINQ. arxiv:1505.02642."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2677005"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429113"},{"key":"e_1_2_1_26_1","unstructured":"Grenade. 2020. Grenade Machine Learning Library. https:\/\/github.com\/HuwCampbell\/grenade \t\t\t\t  Grenade. 2020. Grenade Machine Learning Library. https:\/\/github.com\/HuwCampbell\/grenade"},{"key":"e_1_2_1_27_1","unstructured":"Moritz Hardt Katrina Ligett and Frank McSherry. 2012. A simple and practical algorithm for differentially private data release. In Advances in Neural Information Processing Systems. 2339\u20132347. \t\t\t\t  Moritz Hardt Katrina Ligett and Frank McSherry. 2012. A simple and practical algorithm for differentially private data release. In Advances in Neural Information Processing Systems. 2339\u20132347."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.85"},{"key":"e_1_2_1_29_1","volume-title":"P\u00f3l Mac Aonghusa, and Killian Levacher","author":"Holohan Naoise","year":"2019","unstructured":"Naoise Holohan , Stefano Braghin , P\u00f3l Mac Aonghusa, and Killian Levacher . 2019 . Diffprivlib: the IBM differential privacy library. arXiv preprint arXiv:1907.02444. Naoise Holohan, Stefano Braghin, P\u00f3l Mac Aonghusa, and Killian Levacher. 2019. Diffprivlib: the IBM differential privacy library. arXiv preprint arXiv:1907.02444."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535846"},{"key":"e_1_2_1_31_1","volume-title":"Steven Arzt, Siegfried Rasthofer, Eric Bodden, Damien Octeau, and Patrick McDaniel.","author":"Li Li","year":"2014","unstructured":"Li Li , Alexandre Bartel , Jacques Klein , Yves Le Traon , Steven Arzt, Siegfried Rasthofer, Eric Bodden, Damien Octeau, and Patrick McDaniel. 2014 . I know what leaked in your pocket: uncovering privacy leaks on Android Apps with Static Taint Analysis . arxiv:1404.7431. Li Li, Alexandre Bartel, Jacques Klein, Yves Le Traon, Steven Arzt, Siegfried Rasthofer, Eric Bodden, Damien Octeau, and Patrick McDaniel. 2014. I know what leaked in your pocket: uncovering privacy leaks on Android Apps with Static Taint Analysis. arxiv:1404.7431."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00086"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055331"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851199"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.66"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559850"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.11"},{"key":"e_1_2_1_38_1","volume-title":"Principles of Security and Trust, Lujo Bauer and Ralf K\u00fcsters (Eds.)","author":"Munz Reinhard","unstructured":"Reinhard Munz , Fabienne Eigner , Matteo Maffei , Paul Francis , and Deepak Garg . 2018. UniTraX: Protecting Data Privacy with Discoverable Biases . In Principles of Security and Trust, Lujo Bauer and Ralf K\u00fcsters (Eds.) . Springer International Publishing , Cham . 278\u2013299. Reinhard Munz, Fabienne Eigner, Matteo Maffei, Paul Francis, and Deepak Garg. 2018. UniTraX: Protecting Data Privacy with Discoverable Biases. In Principles of Security and Trust, Lujo Bauer and Ralf K\u00fcsters (Eds.). Springer International Publishing, Cham. 278\u2013299."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292561"},{"key":"e_1_2_1_40_1","unstructured":"Chaya Nayak. 2020. New privacy-protected Facebook data for independent research on social media\u2019s impact on democracy. https:\/\/research.fb.com\/blog\/2020\/02\/new-privacy-protected-facebook-data-for-independent-research-on-social-medias-impact-on-democracy\/ \t\t\t\t  Chaya Nayak. 2020. New privacy-protected Facebook data for independent research on social media\u2019s impact on democracy. https:\/\/research.fb.com\/blog\/2020\/02\/new-privacy-protected-facebook-data-for-independent-research-on-social-medias-impact-on-democracy\/"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3360598"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341714"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2775050.2633368"},{"key":"e_1_2_1_44_1","unstructured":"D. Orchard Tomas Petricek and A. Mycroft. 2014. The semantic marriage of monads and effects. ArXiv abs\/1401.5391 (2014). \t\t\t\t  D. Orchard Tomas Petricek and A. Mycroft. 2014. The semantic marriage of monads and effects. ArXiv abs\/1401.5391 (2014)."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290388"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2006.13"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863568"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411286.1411289"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2048066.2048145"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364506.2364524"},{"key":"e_1_2_1_52_1","unstructured":"Mat\u00edas Toro David Darais Chike Abuah Joe Near Dami\u00e1n \u00c1rquez Federico Olmedo and \u00c9ric Tanter. 2020. Contextual Linear Types for Differential Privacy. arXiv preprint arXiv:2010.11342. \t\t\t\t  Mat\u00edas Toro David Darais Chike Abuah Joe Near Dami\u00e1n \u00c1rquez Federico Olmedo and \u00c9ric Tanter. 2020. Contextual Linear Types for Differential Privacy. arXiv preprint arXiv:2010.11342."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542486"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/601775.601776"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSAC.2008.37"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417282"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314619"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2020-0025"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3110254"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCSE.2012.26"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009884"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196921"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341697"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660348"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3563313","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3563313","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3563313","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:38:10Z","timestamp":1750178290000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3563313"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,31]]},"references-count":63,"journal-issue":{"issue":"OOPSLA2","published-print":{"date-parts":[[2022,10,31]]}},"alternative-id":["10.1145\/3563313"],"URL":"https:\/\/doi.org\/10.1145\/3563313","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,31]]},"assertion":[{"value":"2022-10-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}