{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:24:06Z","timestamp":1776317046426,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031606977","type":"print"},{"value":"9783031606984","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-60698-4_5","type":"book-chapter","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T00:01:51Z","timestamp":1716768111000},"page":"79-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Quantitative Input Usage Static Analysis"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3613-2035","authenticated-orcid":false,"given":"Denis","family":"Mazzucato","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1099-3494","authenticated-orcid":false,"given":"Marco","family":"Campion","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":[[2024,5,26]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Assaf, M., Naumann, D.A., Signoles, J., Totel, \u00c9., Tronel, F.: Hypercollecting semantics and its application to static analysis of information flow (2017). https:\/\/doi.org\/10.1145\/3009837.3009889","DOI":"10.1145\/3009837.3009889"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Barowy, D.W., Gochev, D., Berger, E.D.: Checkcell: data debugging for spreadsheets. In: OOPSLA (2014). https:\/\/doi.org\/10.1145\/2660193.2660207","DOI":"10.1145\/2660193.2660207"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph (algorithm 457). ACM Commun. (1973)","DOI":"10.1145\/362342.362367"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Campion, M., Dalla\u00a0Preda, M., Giacobazzi, R.: Partial (in)completeness in abstract interpretation: limiting the imprecision in program analysis. In: POPL (2022). https:\/\/doi.org\/10.1145\/3498721","DOI":"10.1145\/3498721"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-031-44245-2_7","volume-title":"Static Analysis","author":"M Campion","year":"2023","unstructured":"Campion, M., Urban, C., Dalla Preda, M., Giacobazzi, R.: A formal framework to measure the incompleteness of abstract interpretations. In: Hermenegildo, M.V., Morales, J.F. (eds.) SAS 2023. LNCS, vol. 14284, pp. 114\u2013138. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-44245-2_7"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-319-11212-1_13","volume-title":"Computer Security - ESORICS 2014","author":"T Chothia","year":"2014","unstructured":"Chothia, T., Kawamoto, Y., Novakovic, C.: LeakWatch: estimating information leakage from Java programs. In: Kuty\u0142owski, M., Vaidya, J. (eds.) ESORICS 2014. LNCS, vol. 8713, pp. 219\u2013236. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11212-1_13"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Clark, D., Hunt, S., Malacaria, P.: A static analysis for quantifying information flow in a simple imperative language. J. Comput. Secur. (2007). https:\/\/doi.org\/10.3233\/JCS-2007-15302","DOI":"10.3233\/JCS-2007-15302"},{"key":"5_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00313-3","author":"P Cousot","year":"2002","unstructured":"Cousot, P.: Constructive design of a hierarchy of semantics of a transition system by abstract interpretation. Theor. Comput. Sci. (2002). https:\/\/doi.org\/10.1016\/S0304-3975(00)00313-3","journal-title":"Theor. Comput. Sci."},{"key":"5_CR9","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: POPL (1977). https:\/\/doi.org\/10.1145\/512950.512973","DOI":"10.1145\/512950.512973"},{"key":"5_CR10","unstructured":"Denning, D.E.: Cryptography and Data Security. Addison-Wesley (1982)"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Gray, J.W.: Toward a mathematical foundation for information flow security. IEEE Computer Society (1991). https:\/\/doi.org\/10.1109\/RISP.1991.130769","DOI":"10.1109\/RISP.1991.130769"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Herndon, T., Ash, M., Pollin, R.: Does high public debt consistently stifle economic growth? A critique of Reinhart and Rogoff. Camb. J. Econ. (2014). https:\/\/doi.org\/10.1093\/cje\/bet075","DOI":"10.1093\/cje\/bet075"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38874-3_1","volume-title":"Formal Methods for Dynamical Systems","author":"B K\u00f6pf","year":"2013","unstructured":"K\u00f6pf, B., Rybalchenko, A.: Automation of quantitative information-flow analysis. In: Bernardo, M., de Vink, E., Di Pierro, A., Wiklicky, H. (eds.) SFM 2013. LNCS, vol. 7938, pp. 1\u201328. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38874-3_1"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Kwiatkowska, M.: Advances and challenges of quantitative verification and synthesis for cyber-physical systems. In: 2016 Science of Security for Cyber-Physical Systems Workshop (SOSCYPS) (2016). https:\/\/doi.org\/10.1109\/SOSCYPS.2016.7579999","DOI":"10.1109\/SOSCYPS.2016.7579999"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-030-88806-0_15","volume-title":"Static Analysis","author":"D Mazzucato","year":"2021","unstructured":"Mazzucato, D., Urban, C.: Reduced products of abstract domains for fairness certification of neural networks. In: Dr\u0103goi, C., Mukherjee, S., Namjoshi, K. (eds.) SAS 2021. LNCS, vol. 12913, pp. 308\u2013322. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88806-0_15"},{"key":"5_CR16","unstructured":"Mazzucato, D., Campion, M., Urban, C.: Quantitative Input Usage Static Analysis (2023). https:\/\/hal.science\/hal-04339001. Supplementary material"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"McCamant, S., Ernst, M.D.: Quantitative information flow as network flow capacity. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) (2008). https:\/\/doi.org\/10.1145\/1375581.1375606","DOI":"10.1145\/1375581.1375606"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Phan, Q.-S., Malacaria, P., Tkachuk, O., P\u0103s\u0103reanu, C.S.: Symbolic quantitative information flow. ACM SIGSOFT Softw. Eng. Notes (2012). https:\/\/doi.org\/10.1145\/2382756.2382791","DOI":"10.1145\/2382756.2382791"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Reinhart, C.M., Rogoff, K.S.: Growth in a time of debt. Am. Econ. Rev. (2010). https:\/\/doi.org\/10.1257\/AER.100.2.573","DOI":"10.1257\/AER.100.2.573"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Saha, S., Barbara, U.S., Ghentiyala, U.S., Shihua, U.L.: Obtaining information leakage bounds via approximate model counting (2023). https:\/\/doi.org\/10.1145\/3591281","DOI":"10.1145\/3591281"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-00596-1_21","volume-title":"Foundations of Software Science and Computational Structures","author":"G Smith","year":"2009","unstructured":"Smith, G.: On the foundations of quantitative information flow. In: de Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 288\u2013302. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00596-1_21"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/978-3-319-89884-1_24","volume-title":"Programming Languages and Systems","author":"C Urban","year":"2018","unstructured":"Urban, C., M\u00fcller, P.: An abstract interpretation framework for input data usage. In: Ahmed, A. (ed.) ESOP 2018. LNCS, vol. 10801, pp. 683\u2013710. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_24"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Urban, C., Christakis, M., W\u00fcstholz, V., Zhang, F.: Perfectly parallel fairness certification of neural networks. In: OOPSLA (2020). https:\/\/doi.org\/10.1145\/3428253","DOI":"10.1145\/3428253"},{"key":"5_CR24","doi-asserted-by":"publisher","unstructured":"Wong, W.H.: Timing attacks on RSA: revealing your secrets through the fourth dimension. ACM Crossroads (2005). https:\/\/doi.org\/10.1145\/1144396.1144401","DOI":"10.1145\/1144396.1144401"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60698-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T00:02:31Z","timestamp":1716768151000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60698-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031606977","9783031606984"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60698-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"26 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moffett Field, 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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2024","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":"nfm2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}