{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:27:57Z","timestamp":1762298877058,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030010898"},{"type":"electronic","value":"9783030010904"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-01090-4_12","type":"book-chapter","created":{"date-parts":[[2018,9,29]],"date-time":"2018-09-29T11:23:23Z","timestamp":1538220203000},"page":"194-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Bisimilarity Distances\u00a0for\u00a0Approximate Differential Privacy"],"prefix":"10.1007","author":[{"given":"Dmitry","family":"Chistikov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej S.","family":"Murawski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Purser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,30]]},"reference":[{"issue":"POPL","key":"12_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3158146","volume":"2","author":"Aws Albarghouthi","year":"2017","unstructured":"Albarghouthi, A., Hsu, J.: Synthesizing coupling proofs of differential privacy. Proc. ACM Program. Lang. 2, 58:1\u201358:30 (2018)","journal-title":"Proceedings of the ACM on Programming Languages"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-36742-7_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Bacci","year":"2013","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Mardare, R.: On-the-fly exact computation of bisimilarity distances. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 1\u201315. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36742-7_1"},{"key":"12_CR3","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-662-48899-7_27","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"G Barthe","year":"2015","unstructured":"Barthe, G., Espitau, T., Gr\u00e9goire, B., Hsu, J., Stefanesco, L., Strub, P.-Y.: Relational reasoning via probabilistic coupling. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds.) LPAR 2015. LNCS, vol. 9450, pp. 387\u2013401. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48899-7_27"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Barthe, G., K\u00f6pf, B., Olmedo, F., Zanella B\u00e9guelin, S.: Probabilistic relational reasoning for differential privacy. In: POPL, pp. 97\u2013110. ACM (2012)","DOI":"10.1145\/2103621.2103670"},{"key":"12_CR6","unstructured":"Billingsley, P.: Probability and Measure, 2nd edn. Wiley, New York (1986)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"van Breugel, F.: Probabilistic bisimilarity distances. ACM SIGLOG News 4(4), 33\u201351 (2017)","DOI":"10.1145\/3157831.3157837"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-71389-0_10","volume-title":"Foundations of Software Science and Computational Structures","author":"F Breugel van","year":"2007","unstructured":"van Breugel, F., Sharma, B., Worrell, J.: Approximating a behavioural pseudometric without discount for probabilistic systems. In: Seidl, H. (ed.) FoSSaCS 2007. LNCS, vol. 4423, pp. 123\u2013137. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71389-0_10"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/3-540-44685-0_23","volume-title":"CONCUR 2001 \u2014 Concurrency Theory","author":"F Breugel van","year":"2001","unstructured":"van Breugel, F., Worrell, J.: An algorithm for quantitative verification of probabilistic transition systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 336\u2013350. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44685-0_23"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-319-06880-0_10","volume-title":"Horizons of the Mind. A Tribute to Prakash Panangaden","author":"F Breugel van","year":"2014","unstructured":"van Breugel, F., Worrell, J.: The complexity of computing a bisimilarity pseudometric on probabilistic automata. In: van Breugel, F., Kashefi, E., Palamidessi, C., Rutten, J. (eds.) Horizons of the Mind. A Tribute to Prakash Panangaden. LNCS, vol. 8464, pp. 191\u2013213. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06880-0_10"},{"issue":"4","key":"12_CR11","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/2852040.2852053","volume":"46","author":"Jean Cardinal","year":"2015","unstructured":"Cardinal, J.: Computational geometry column 62. SIGACT News 46(4), 69\u201378 (2015)","journal-title":"ACM SIGACT News"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-662-44584-6_4","volume-title":"CONCUR 2014 \u2013 Concurrency Theory","author":"K Chatzikokolakis","year":"2014","unstructured":"Chatzikokolakis, K., Gebler, D., Palamidessi, C., Xu, L.: Generalized bisimulation metrics. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 32\u201346. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44584-6_4"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. J. Cryptol. 1(1), 65\u201375 (1988)","journal-title":"J. Cryptol."},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-642-28729-9_29","volume-title":"Foundations of Software Science and Computational Structures","author":"D Chen","year":"2012","unstructured":"Chen, D., van Breugel, F., Worrell, J.: On the complexity of computing probabilistic bisimilarity. In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 437\u2013451. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28729-9_29"},{"issue":"3","key":"12_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.entcs.2009.10.006","volume":"253","author":"Y Deng","year":"2009","unstructured":"Deng, Y., Du, W.: The Kantorovich metric in computer science: a brief survey. Electron Notes Theor. Comput. Sci. 253(3), 73\u201382 (2009)","journal-title":"Electron Notes Theor. Comput. Sci."},{"issue":"3","key":"12_CR16","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.tcs.2003.09.013","volume":"318","author":"J Desharnais","year":"2004","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for labelled Markov processes. Theor. Comput. Sci. 318(3), 323\u2013354 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Desharnais, J., Jagadeesan, R., Gupta, V., Panangaden, P.: The metric analogue of weak bisimulation for probabilistic processes. In: LICS, pp. 413\u2013422. IEEE (2002)","DOI":"10.1109\/LICS.2002.1029849"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265\u2013284. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_14"},{"issue":"6","key":"12_CR19","doi-asserted-by":"publisher","first-page":"2531","DOI":"10.1137\/080720826","volume":"39","author":"K Etessami","year":"2010","unstructured":"Etessami, K., Yannakakis, M.: On the complexity of Nash equilibria and other fixed points. SIAM J. Comput. 39(6), 2531\u20132597 (2010)","journal-title":"SIAM J. Comput."},{"key":"12_CR20","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"Martin Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, vol. 2. Springer, Berlin (1988)"},{"issue":"7\u20138","key":"12_CR21","first-page":"227","volume":"37","author":"LV Kantorovich","year":"1942","unstructured":"Kantorovich, L.V.: On the translocation of masses. Doklady Akademii Nauk SSSR 37(7\u20138), 227\u2013229 (1942)","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"12_CR22","unstructured":"Kiefer, S.: On computing the total variation distance of hidden Markov models. In: ICALP, pp. 130:1\u2013130:13 (2018)"},{"issue":"1","key":"12_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"KG Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput. 94(1), 1\u201328 (1991)","journal-title":"Inf. Comput."},{"issue":"2","key":"12_CR24","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s00224-015-9662-0","volume":"60","author":"M Schaefer","year":"2017","unstructured":"Schaefer, M., Stefankovic, D.: Fixed points, Nash equilibria, and the existential theory of the reals. Theory Comput. Syst. 60(2), 172\u2013193 (2017)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"12_CR25","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(85)90076-6","volume":"20","author":"ED Sontag","year":"1985","unstructured":"Sontag, E.D.: Real addition and the polynomial hierarchy. IPL 20(3), 115\u2013120 (1985)","journal-title":"IPL"},{"key":"12_CR26","unstructured":"Tang, Q., van Breugel, F.: Computing probabilistic bisimilarity distances via policy iteration. In: CONCUR, pp. 22:1\u201322:15. Leibniz-Zentrum (2016)"},{"issue":"2","key":"12_CR27","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5(2), 285\u2013309 (1955)","journal-title":"Pac. J. Math."},{"key":"12_CR28","first-page":"61","volume":"276","author":"MC Tschantz","year":"2011","unstructured":"Tschantz, M.C., Kaynar, D., Datta, A.: Formal verification of differential privacy for interactive systems. ENTCS 276, 61\u201379 (2011)","journal-title":"ENTCS"},{"key":"12_CR29","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-319-57048-8_7","volume-title":"Tutorials on the Foundations of Cryptography","author":"Salil Vadhan","year":"2017","unstructured":"Vadhan, S.P.: The complexity of differential privacy. In: Tutorials on the Foundations of Cryptography, pp. 347\u2013450. Springer, Berlin (2017)"},{"key":"12_CR30","unstructured":"Xu, L.: Formal verification of differential privacy in concurrent systems. Ph.D. thesis, Ecole Polytechnique (Palaiseau, France) (2015)"},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-662-43613-4_13","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"L Xu","year":"2014","unstructured":"Xu, L., Chatzikokolakis, K., Lin, H.: Metrics for differential privacy in concurrent systems. In: \u00c1brah\u00e1m, E., Palamidessi, C. (eds.) FORTE 2014. LNCS, vol. 8461, pp. 199\u2013215. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43613-4_13"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01090-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T14:48:09Z","timestamp":1761058089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01090-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030010898","9783030010904"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01090-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Los Angeles, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/atva-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}