{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:24:03Z","timestamp":1776317043536,"version":"3.50.1"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032071057","type":"print"},{"value":"9783032071064","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T00:00:00Z","timestamp":1759708800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T00:00:00Z","timestamp":1759708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-07106-4_11","type":"book-chapter","created":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:37:59Z","timestamp":1759847879000},"page":"249-277","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Relating Distances and\u00a0Abstractions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1099-3494","authenticated-orcid":false,"given":"Marco","family":"Campion","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1213-536X","authenticated-orcid":false,"given":"Isabella","family":"Mastroeni","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8127-9642","authenticated-orcid":false,"given":"Caterina","family":"Urban","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,6]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Bruni, R., Giacobazzi, R., Gori, R., Ranzato, F.: A logic for locally complete abstract interpretations. In: 36th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2021, pp. 1\u201313. IEEE (2021). https:\/\/doi.org\/10.1109\/LICS52264.2021.9470608","DOI":"10.1109\/LICS52264.2021.9470608"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Bruni, R., Giacobazzi, R., Gori, R., Ranzato, F.: Abstract interpretation repair. In: Jhala, R., Dillig, I. (eds.) PLDI \u201922: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation. pp. 426\u2013441. ACM (2022). https:\/\/doi.org\/10.1145\/3519939.3523453","DOI":"10.1145\/3519939.3523453"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Bruni, R., Giacobazzi, R., Gori, R., Ranzato, F.: A correctness and incorrectness program logic. J. ACM 70(2), 15:1\u201315:45 (2023). https:\/\/doi.org\/10.1145\/3582267","DOI":"10.1145\/3582267"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Campion, M., Dalla\u00a0Preda, M., Giacobazzi, R.: Abstract interpretation of indexed grammars. In: Chang, B.E. (ed.) 26th Static Analysis Symposium (SAS 2019). Lecture Notes in Computer Science, vol. 11822, pp. 121\u2013139. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-32304-2_7","DOI":"10.1007\/978-3-030-32304-2_7"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Campion, M., Dalla Preda, M., Giacobazzi, R.: Partial (in)completeness in abstract interpretation: limiting the imprecision in program analysis. Proc. ACM Program. Lang. 6(POPL), 1\u201331 (2022). https:\/\/doi.org\/10.1145\/3498721","DOI":"10.1145\/3498721"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Campion, M., Dalla Preda, M., Giacobazzi, R., Urban, C.: Monotonicity and the precision of program analysis. Proc. ACM Program. Lang. 8(POPL), 1629\u20131662 (2024). https:\/\/doi.org\/10.1145\/3632897","DOI":"10.1145\/3632897"},{"key":"11_CR7","unstructured":"Campion, M., Preda, M.D., Giacobazzi, R.: On the properties of partial completeness in abstract interpretation. In: Lago, U.D., Gorla, D. (eds.) Proceedings of the 23rd Italian Conference on Theoretical Computer Science, ICTCS 2022, Rome, Italy, September 7-9, 2022. CEUR Workshop Proceedings, vol.\u00a03284, pp. 79\u201385. CEUR-WS.org (2022). https:\/\/ceur-ws.org\/Vol-3284\/8665.pdf"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Campion, M., Urban, C., Preda, M.D., Giacobazzi, R.: A formal framework to measure the incompleteness of abstract interpretations. In: Hermenegildo, M.V., Morales, J.F. (eds.) Static Analysis - 30th International Symposium, SAS 2023. Lecture Notes in Computer Science, vol. 14284, pp. 114\u2013138. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-44245-2_7","DOI":"10.1007\/978-3-031-44245-2_7"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Chaudhuri, S., Gulwani, S., Lublinerman, R.: Continuity analysis of programs. In: Proceedings of the 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 57\u201370. POPL \u201910, Association for Computing Machinery (2010). https:\/\/doi.org\/10.1145\/1706299.1706308","DOI":"10.1145\/1706299.1706308"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Chaudhuri, S., Gulwani, S., Lublinerman, R.: Continuity and robustness of programs 55(8), 107\u2013115 (2012). https:\/\/doi.org\/10.1145\/2240236.2240262","DOI":"10.1145\/2240236.2240262"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Chaudhuri, S., Gulwani, S., Lublinerman, R., NavidPour, S.: Proving programs robust. In: Gyim\u00f3thy, T., Zeller, A. (eds.) SIGSOFT\/FSE\u201911 19th ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE-19), pp. 102\u2013112. ACM (2011). https:\/\/doi.org\/10.1145\/2025113.2025131","DOI":"10.1145\/2025113.2025131"},{"issue":"6","key":"11_CR12","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.3233\/JCS-2009-0393","volume":"18","author":"MR Clarkson","year":"2010","unstructured":"Clarkson, M.R., Schneider, F.B.: Hyperproperties. J. Comput. Secur. 18(6), 1157\u20131210 (2010). https:\/\/doi.org\/10.3233\/JCS-2009-0393","journal-title":"J. Comput. Secur."},{"key":"11_CR13","volume-title":"Principles of Abstract Interpretation","author":"P Cousot","year":"2021","unstructured":"Cousot, P.: Principles of Abstract Interpretation. The MIT Press, Cambridge, Mass (2021)"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Graham, R.M., Harrison, M.A., Sethi, R. (eds.) Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, California, USA, January 1977, pp. 238\u2013252. ACM (1977). https:\/\/doi.org\/10.1145\/512950.512973","DOI":"10.1145\/512950.512973"},{"key":"11_CR15","unstructured":"Cousot, P., Cousot, R.: A constructive characterization of the lattices of all retractions, preclosure, quasi-closure and closure operators on a complete lattice. Portugaliae Mathematica 38(1-2), 185\u2013198 (1979). http:\/\/eudml.org\/doc\/115380"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Aho, A.V., Zilles, S.N., Rosen, B.K. (eds.) Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, pp. 269\u2013282. ACM Press (1979). https:\/\/doi.org\/10.1145\/567752.567778","DOI":"10.1145\/567752.567778"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Geometry of Cuts and Metrics. AC, vol. 15. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-04295-9","DOI":"10.1007\/978-3-642-04295-9"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"37","DOI":"10.3233\/JCS-2004-12103","volume":"12","author":"A Di Pierro","year":"2004","unstructured":"Di Pierro, A., Hankin, C., Wiklicky, H.: Approximate non-interference. J. Comput. Secur. 12(1), 37\u201382 (2004). https:\/\/doi.org\/10.3233\/JCS-2004-12103","journal-title":"J. Comput. Secur."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Di Pierro, A., Wiklicky, H.: Measuring the precision of abstract interpretations. In: Lau, K. (ed.) 10th Logic Based Program Synthesis and Transformation (LOPSTR\u201900). LNCS, vol.\u00a02042, pp. 147\u2013164. Springer (2000)","DOI":"10.1007\/3-540-45142-0_9"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.D.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) Theory of Cryptography, Third Theory of Cryptography Conference, TCC 2006. LNCS, vol.\u00a03876, pp. 265\u2013284. Springer (2006). https:\/\/doi.org\/10.1007\/11681878_14","DOI":"10.1007\/11681878_14"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-30124-0_23","volume-title":"Computer Science Logic","author":"R Giacobazzi","year":"2004","unstructured":"Giacobazzi, R., Mastroeni, I.: Proving abstract non-interference. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol. 3210, pp. 280\u2013294. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30124-0_23"},{"issue":"5","key":"11_CR22","doi-asserted-by":"publisher","first-page":"751","DOI":"10.3233\/JCS-2009-0382","volume":"18","author":"R Giacobazzi","year":"2010","unstructured":"Giacobazzi, R., Mastroeni, I.: Adjoining classified and unclassified information by abstract interpretation. J. Comput. Secur. 18(5), 751\u2013797 (2010)","journal-title":"J. Comput. Secur."},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Giacobazzi, R., Logozzo, F., Ranzato, F.: Analyzing program analyses. In: Rajamani, S.K., Walker, D. (eds.) Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, pp. 261\u2013273. ACM (2015). https:\/\/doi.org\/10.1145\/2676726.2676987","DOI":"10.1145\/2676726.2676987"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Giacobazzi, R., Mastroeni, I.: Abstract non-interference: a unifying framework for weakening information-flow. ACM Trans. Priv. Secur. 21(2), 9:1\u20139:31 (2018). https:\/\/doi.org\/10.1145\/3175660","DOI":"10.1145\/3175660"},{"issue":"2","key":"11_CR25","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/3649309","volume":"46","author":"R Giacobazzi","year":"2024","unstructured":"Giacobazzi, R., Mastroeni, I., Perantoni, E.: Adversities in abstract interpretation - accommodating robustness by abstract interpretation. ACM Trans. Program. Lang. Syst. 46(2), 5 (2024). https:\/\/doi.org\/10.1145\/3649309","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"11_CR26","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/333979.333989","volume":"47","author":"R Giacobazzi","year":"2000","unstructured":"Giacobazzi, R., Ranzato, F., Scozzari, F.: Making abstract interpretations complete. J. ACM 47(2), 361\u2013416 (2000). https:\/\/doi.org\/10.1145\/333979.333989","journal-title":"J. ACM"},{"key":"11_CR27","doi-asserted-by":"publisher","unstructured":"Goguen, J.A., Meseguer, J.: Security policies and security models. In: 1982 IEEE Symposium on Security and Privacy, Oakland, CA, USA, April 26-28, 1982, pp. 11\u201320. IEEE Computer Society (1982). https:\/\/doi.org\/10.1109\/SP.1982.10014","DOI":"10.1109\/SP.1982.10014"},{"key":"11_CR28","unstructured":"Gr\u00fcnbaum, B., Klee, V., Perles, M.A., Shephard, G.C.: Convex polytopes, vol.\u00a016. Springer (1967)"},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Hunt, S., Mastroeni, I.: The PER model of abstract non-interference. In: Hankin, C., Siveroni, I. (eds.) Static Analysis, 12th International Symposium, SAS 2005, London, UK, September 7-9, 2005, Proceedings. Lecture Notes in Computer Science, vol.\u00a03672, pp. 171\u2013185. Springer (2005). https:\/\/doi.org\/10.1007\/11547662_13","DOI":"10.1007\/11547662_13"},{"issue":"OOPSLA2","key":"11_CR30","doi-asserted-by":"publisher","first-page":"2434","DOI":"10.1145\/3689797","volume":"8","author":"D Liew","year":"2024","unstructured":"Liew, D., Cogumbreiro, T., Lange, J.: Sound and partially-complete static analysis of data-races in GPU programs. Proc. ACM Program. Lang. 8(OOPSLA2), 2434\u20132461 (2024). https:\/\/doi.org\/10.1145\/3689797","journal-title":"Proc. ACM Program. Lang."},{"key":"11_CR31","unstructured":"Logozzo, F.: Towards a quantitative estimation of abstract interpretations. In: Workshop on Quantitative Analysis of Software. Microsoft (2009). https:\/\/www.microsoft.com\/en-us\/research\/publication\/towards-a-quantitative-estimation-of-abstract-interpretations\/"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Mastroeni, I.: On the role of abstract non-interference in language-based security. In: Yi, K. (ed.) 3rd Asian Symp. on Programming Languages and Systems (APLAS\u00a0\u201905). Lecture Notes in Computer Science, vol.\u00a03780, pp. 418\u2013433. Springer","DOI":"10.1007\/11575467_27"},{"key":"11_CR33","doi-asserted-by":"publisher","first-page":"41","DOI":"10.4204\/eptcs.129.4","volume":"129","author":"I Mastroeni","year":"2013","unstructured":"Mastroeni, I.: Abstract interpretation-based approaches to security - a survey on abstract non-interference and its challenging applications. Electron. Proc. Theoretical Comput. Sci. 129, 41\u201365 (2013). https:\/\/doi.org\/10.4204\/eptcs.129.4","journal-title":"Electron. Proc. Theoretical Comput. Sci."},{"key":"11_CR34","doi-asserted-by":"publisher","unstructured":"Mastroeni, I.: Abstract local completeness - a local form of abstract non-interference. In: Krishna, S., Sankaranarayanan, S., Trivedi, A. (eds.) 26th Verification, Model Checking, and Abstract Interpretation (VMCAI 2025). Lecture Notes in Computer Science, vol. 15530, pp. 3\u201325. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-031-82703-7_1","DOI":"10.1007\/978-3-031-82703-7_1"},{"key":"11_CR35","doi-asserted-by":"publisher","unstructured":"Mastroeni, I., Pasqua, M.: Domain precision in galois connection-less abstract interpretation. In: Hermenegildo, M.V., Morales, J.F. (eds.) Static Analysis - 30th International Symposium, SAS 2023, Cascais, Portugal, October 22-24, 2023, Proceedings. Lecture Notes in Computer Science, vol. 14284, pp. 434\u2013459. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-44245-2_19","DOI":"10.1007\/978-3-031-44245-2_19"},{"key":"11_CR36","unstructured":"Mazzucato, D.: Static analysis by abstract interpretation of quantitative program properties. (Analyse Statique par Interpr\u00e9tation Abstraite de Propri\u00e9t\u00e9s Quantitatives de Programmes). Ph.D. thesis, \u00c9cole Normale Sup\u00e9rieure, Paris, France (2024). https:\/\/tel.archives-ouvertes.fr\/tel-04886659"},{"key":"11_CR37","doi-asserted-by":"publisher","unstructured":"Mazzucato, D., Campion, M., Urban, C.: Quantitative input usage static analysis. In: Benz, N., Gopinath, D., Shi, N. (eds.) NASA Formal Methods - 16th International Symposium, NFM 2024, Moffett Field, CA, USA, June 4-6, 2024, Proceedings. Lecture Notes in Computer Science, vol. 14627, pp. 79\u201398. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-60698-4_5","DOI":"10.1007\/978-3-031-60698-4_5"},{"key":"11_CR38","doi-asserted-by":"publisher","unstructured":"Mazzucato, D., Campion, M., Urban, C.: Quantitative static timing analysis. In: Giacobazzi, R., Gorla, A. (eds.) Static Analysis - 31st International Symposium, SAS 2024, Pasadena, CA, USA, October 20-22, 2024, Proceedings. Lecture Notes in Computer Science, vol. 14995, pp. 268\u2013299. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-74776-2_11","DOI":"10.1007\/978-3-031-74776-2_11"},{"key":"11_CR39","doi-asserted-by":"publisher","unstructured":"Min\u00e9, A.: The octagon abstract domain. In: Burd, E., Aiken, P., Koschke, R. (eds.) Proc. of the 8th Working Conf. on Reverse Engineering, WCRE\u201901. p.\u00a0310. IEEE Computer Society (2001). https:\/\/doi.org\/10.1109\/WCRE.2001.957836","DOI":"10.1109\/WCRE.2001.957836"},{"key":"11_CR40","doi-asserted-by":"publisher","unstructured":"O\u2019Hearn, P.W.: Incorrectness logic. Proc. ACM Program. Lang. 4(POPL), 10:1\u201310:32 (2020). https:\/\/doi.org\/10.1145\/3371078","DOI":"10.1145\/3371078"},{"key":"11_CR41","unstructured":"Sotin, P.: Quantifying the precision of numerical abstract domains. Research Report (2010). https:\/\/inria.hal.science\/inria-00457324"},{"key":"11_CR42","doi-asserted-by":"publisher","unstructured":"Urban, C., M\u00fcller, P.: An abstract interpretation framework for input data usage. In: Ahmed, A. (ed.) 27th European Symposium on Programming, ESOP 2018. Lecture Notes in Computer Science, vol. 10801, pp. 683\u2013710. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_24","DOI":"10.1007\/978-3-319-89884-1_24"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-07106-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T22:03:13Z","timestamp":1760047393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07106-4_11"}},"subtitle":["An Abstract Interpretation Perspective"],"short-title":[],"issued":{"date-parts":[[2025,10,6]]},"ISBN":["9783032071057","9783032071064"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07106-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,6]]},"assertion":[{"value":"6 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Static Analysis Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sas2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2025.splashcon.org\/home\/sas-2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}