{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T21:49:49Z","timestamp":1755035389390,"version":"3.28.0"},"reference-count":36,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"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":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785668","type":"proceedings-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T01:15:55Z","timestamp":1565054155000},"page":"1-14","source":"Crossref","is-referenced-by-count":17,"title":["Approximate Span Liftings: Compositional Semantics for Relaxations of Differential Privacy"],"prefix":"10.1109","author":[{"given":"Tetsuya","family":"Sato","sequence":"first","affiliation":[]},{"given":"Gilles","family":"Barthe","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Gaboardi","sequence":"additional","affiliation":[]},{"given":"Justin","family":"Hsu","sequence":"additional","affiliation":[]},{"given":"Shin-ya","family":"Katsumata","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2746325.2746335"},{"key":"ref32","first-page":"102: 1","article-title":"*-liftings for differential privacy","volume":"80","author":"barthe","year":"2017","journal-title":"International Colloquium on Automata Languages and Programming (ICALP)"},{"key":"ref31","first-page":"156","article-title":"Codensity liftings of monads","volume":"35","author":"katsumata","year":"2015","journal-title":"6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015) ser Leibniz International Proceedings in Informatics"},{"key":"ref30","first-page":"87","article-title":"A semantic formulation of TT-lifting and logical predicates for computational metalanguage","volume":"3634","author":"katsumata","year":"2005","journal-title":"Int Workshop on Computer Science and Logic (CSL 99)"},{"key":"ref36","first-page":"5295","article-title":"Renyi differential privacy mechanisms for posterior sampling","author":"geumlek","year":"2017","journal-title":"Conference on Neural Information Processing Systems (NIPS)"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2014.36"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/2893582.2893591","article-title":"Programming language techniques for differential privacy","volume":"3","author":"barthe","year":"2016","journal-title":"ACM SIGLOG News"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53641-4_24"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188946"},{"key":"ref14","first-page":"547","article-title":"On measures of entropy and information","author":"renyi","year":"1961","journal-title":"Berkeley Symposium on Mathematical Statistics and Probability Volume 1 Contributions to the Theory of Statistics"},{"key":"ref15","first-page":"49","article-title":"Beyond differential privacy: Composition theorems and relational logic for f-divergences between probabilistic programs","volume":"7966","author":"barthe","year":"2013","journal-title":"International Colloquium on Automata Languages and Programming (ICALP)"},{"journal-title":"Approximate relational reasoning for probabilistic programs","year":"2014","author":"olmedo","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2320500"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2016.09.043"},{"key":"ref19","first-page":"277","article-title":"Approximate and probabilistic differential privacy definitions","volume":"2018","author":"meiser","year":"2018","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978371"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2492061"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_14"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2677000"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559850"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978391"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429113"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3110254"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863568"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1145\/3158146","article-title":"Synthesizing coupling proofs of differential privacy","volume":"2","author":"albarghouthi","year":"2018","journal-title":"Proceedings of the ACM on Programming Languages"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009884"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881731"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49630-5_30"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535846"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0092872"},{"journal-title":"Real and Complex Analysis","year":"1987","author":"rudin","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.605597"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2019,6,24]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785668.pdf?arnumber=8785668","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:20:37Z","timestamp":1658262037000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785668\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785668","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}