{"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":1776317046320,"version":"3.50.1"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031747755","type":"print"},{"value":"9783031747762","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-74776-2_11","type":"book-chapter","created":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T05:35:43Z","timestamp":1737351343000},"page":"268-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Quantitative Static Timing 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":[[2025,1,21]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Antonopoulos, T., Gazzillo, P., Hicks, M., Koskinen, E., Terauchi, T., Wei, S.: Decomposition instead of self-composition for proving the absence of timing channels. PLDI (2017). https:\/\/doi.org\/10.1145\/3140587.3062378","DOI":"10.1145\/3140587.3062378"},{"key":"11_CR2","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. ACM SIGPLAN Notices (2017). https:\/\/doi.org\/10.1145\/3009837.3009889","DOI":"10.1145\/3009837.3009889"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Barthe, G., D\u2019Argento, P.R., Rezk, T.: Secure information flow by self-composition. IEEE (2011). https:\/\/doi.org\/10.1017\/S0960129511000193","DOI":"10.1017\/S0960129511000193"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Cadek, P., Danninger, C., Sinn, M., Zuleger, F.: Using loop bound analysis for invariant generation. FMCAD (2018). https:\/\/doi.org\/10.23919\/FMCAD.2018.8603005","DOI":"10.23919\/FMCAD.2018.8603005"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Campion, M., Dalla\u00a0Preda, M., Giacobazzi, R.: Partial (in)completeness in abstract interpretation: limiting the imprecision in program analysis. POPL (2022). https:\/\/doi.org\/10.1145\/3498721","DOI":"10.1145\/3498721"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Campion, M., Urban, C., Dalla\u00a0Preda, M., Giacobazzi, R.: A formal framework to measure the incompleteness of abstract interpretations. SAS (2023). https:\/\/doi.org\/10.1007\/978-3-031-44245-2_7","DOI":"10.1007\/978-3-031-44245-2_7"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Carbonneaux, Q., Hoffmann, J., Shao, Z.: Compositional certified resource bounds. PLDI (2015). https:\/\/doi.org\/10.1145\/2737924.2737955","DOI":"10.1145\/2737924.2737955"},{"key":"11_CR8","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":"11_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. POPL (1977). https:\/\/doi.org\/10.1145\/512950.512973","DOI":"10.1145\/512950.512973"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. POPL (1978). https:\/\/doi.org\/10.1145\/512760.512770","DOI":"10.1145\/512760.512770"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Cousot, P., Monerau, M.: Probabilistic abstract interpretation. ESOP (2012). https:\/\/doi.org\/10.1007\/978-3-642-28869-2_9","DOI":"10.1007\/978-3-642-28869-2_9"},{"key":"11_CR12","unstructured":"Denning, D.E.: Cryptography and Data Security. Addison-Wesley (1982). ISBN 0201101505"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Dhem, J.-F., Koeune, F., Leroux, P.-A., Mestr\u00e9, P., Quisquater, J.-J., Willems, J.-L.: A practical implementation of the timing attack. CARDIS (2000). https:\/\/doi.org\/10.1007\/10721064_15","DOI":"10.1007\/10721064_15"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Ermedahl, A., Sandberg, C., Gustafsson, J., Bygde, S., Lisper, B.: Loop bound analysis based on a combination of program slicing, abstract interpretation, and invariant analysis. WCET (2007). https:\/\/doi.org\/10.4230\/OASICS.WCET.2007.1194","DOI":"10.4230\/OASICS.WCET.2007.1194"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Gonnord, L., Monniaux, D., Radanne, G.: Synthesis of ranking functions using extremal counterexamples. PLDI (2015). https:\/\/doi.org\/10.1145\/2813885.2737976","DOI":"10.1145\/2813885.2737976"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Granger, P.: Improving the results of static analyses of programs by local decreasing iterations. FSTTCS (1992). https:\/\/doi.org\/10.1007\/3-540-56287-7_95","DOI":"10.1007\/3-540-56287-7_95"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Gray, J.W.: Toward a mathematical foundation for information flow security. IEEE (1991). https:\/\/doi.org\/10.1109\/RISP.1991.130769","DOI":"10.1109\/RISP.1991.130769"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Harrison, J.: HOL light: an overview. TPHOLs (2009). https:\/\/doi.org\/10.1007\/978-3-642-03359-9_4","DOI":"10.1007\/978-3-642-03359-9_4"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Jeannet, B., Min\u00e9, A.: Apron: a library of numerical abstract domains for static analysis (2009). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_52","DOI":"10.1007\/978-3-642-02658-4_52"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Kocher, P., et al.: Spectre attacks: exploiting speculative execution (2019). https:\/\/doi.org\/10.1109\/SP.2019.00002","DOI":"10.1109\/SP.2019.00002"},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: CRYPTO (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_9","DOI":"10.1007\/3-540-68697-5_9"},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"Kocher, P.C., Jaffe, J., Jun, B.: Differential power analysis. In: CRYPTO (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_25","DOI":"10.1007\/3-540-48405-1_25"},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"K\u00f6pf, B., Basin, D.A.: An information-theoretic model for adaptive side-channel attacks. CCS (2007). https:\/\/doi.org\/10.1145\/1315245.1315282","DOI":"10.1145\/1315245.1315282"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"K\u00f6pf, B., Rybalchenko, A.: Automation of quantitative information-flow analysis. In: SFM (2013). https:\/\/doi.org\/10.1007\/978-3-642-38874-3_1","DOI":"10.1007\/978-3-642-38874-3_1"},{"key":"11_CR25","doi-asserted-by":"publisher","unstructured":"Kwiatkowska, M.: Advances and challenges of quantitative verification and synthesis for cyber-physical systems. SOSCYPS (2016). https:\/\/doi.org\/10.1109\/SOSCYPS.2016.7579999","DOI":"10.1109\/SOSCYPS.2016.7579999"},{"key":"11_CR26","doi-asserted-by":"publisher","unstructured":"Lipp, M., et al.: Meltdown: reading kernel memory from user space. In: USENIX Security Symposium (2018). https:\/\/doi.org\/10.1145\/3357033","DOI":"10.1145\/3357033"},{"key":"11_CR27","doi-asserted-by":"publisher","unstructured":"Mazzucato, D., Urban, C.: Reduced products of abstract domains for fairness certification of neural networks. In: SAS (2021). https:\/\/doi.org\/10.1007\/978-3-030-88806-0_15","DOI":"10.1007\/978-3-030-88806-0_15"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Mazzucato, D., Campion, M., Urban, C.: Quantitative input usage static analysis. NFM (2024). https:\/\/hal.science\/hal-04339001","DOI":"10.1007\/978-3-031-60698-4_5"},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Min\u00e9, A.: The octagon abstract domain. In: Working Conference on Reverse Engineering (2001). https:\/\/doi.org\/10.1109\/WCRE.2001.957836","DOI":"10.1109\/WCRE.2001.957836"},{"key":"11_CR30","doi-asserted-by":"publisher","unstructured":"Omar, H., Ahmad, M., Khan, O.: Graphtuner: an input dependence aware loop perforation scheme for efficient execution of approximated graph algorithms. ICCD (2017). https:\/\/doi.org\/10.1109\/ICCD.2017.38","DOI":"10.1109\/ICCD.2017.38"},{"key":"11_CR31","doi-asserted-by":"publisher","unstructured":"Parolini, F., Min\u00e9, A.: Sound abstract nonexploitability analysis. In: VMCAI (2024). https:\/\/doi.org\/10.1007\/978-3-031-50521-8_15","DOI":"10.1007\/978-3-031-50521-8_15"},{"key":"11_CR32","doi-asserted-by":"publisher","unstructured":"Phan, Q., Bang, L., Pasareanu, C.S., Malacaria, P., Bultan, T.: Synthesis of adaptive side-channel attacks. IEEE (2017). https:\/\/doi.org\/10.1109\/CSF.2017.8","DOI":"10.1109\/CSF.2017.8"},{"key":"11_CR33","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":"11_CR34","doi-asserted-by":"publisher","unstructured":"Podelski, A., Rybalchenko, A.: A complete method for the synthesis of linear ranking functions. In: VMCAI (2004). https:\/\/doi.org\/10.1007\/978-3-540-24622-0_20","DOI":"10.1007\/978-3-540-24622-0_20"},{"key":"11_CR35","doi-asserted-by":"publisher","unstructured":"Rival, X.: Understanding the origin of alarms in astr\u00e9e. In: SAS (2005). https:\/\/doi.org\/10.1007\/11547662_21","DOI":"10.1007\/11547662_21"},{"key":"11_CR36","doi-asserted-by":"publisher","unstructured":"Saha, S., Barbara, U.S., Ghentiyala, U.S., Shihua, U.L.: Obtaining information leakage bounds via approximate model counting. PLDI (2023). https:\/\/doi.org\/10.1145\/3591281","DOI":"10.1145\/3591281"},{"key":"11_CR37","doi-asserted-by":"publisher","unstructured":"Sinn, M., Zuleger, F., Veith, H.: Complexity and resource bound analysis of imperative programs using difference constraints. J. Autom. Reason. (2017). https:\/\/doi.org\/10.1007\/S10817-016-9402-4","DOI":"10.1007\/S10817-016-9402-4"},{"key":"11_CR38","doi-asserted-by":"publisher","unstructured":"Steensgaard, B.: Points-to analysis in almost linear time. POPL (1996). https:\/\/doi.org\/10.1145\/237721.237727","DOI":"10.1145\/237721.237727"},{"key":"11_CR39","doi-asserted-by":"publisher","unstructured":"Terauchi, T., Aiken, A.: Secure information flow as a safety problem. In: SAS (2005). https:\/\/doi.org\/10.1007\/11547662_24","DOI":"10.1007\/11547662_24"},{"key":"11_CR40","doi-asserted-by":"publisher","unstructured":"Urban, C., Min\u00e9, A.: An abstract domain to infer ordinal-valued ranking functions. In: ESOP (2014). https:\/\/doi.org\/10.1007\/978-3-642-54833-8_22","DOI":"10.1007\/978-3-642-54833-8_22"},{"key":"11_CR41","doi-asserted-by":"publisher","unstructured":"Urban, C., Min\u00e9, A.: A decision tree abstract domain for proving conditional termination. In: SAS (2014). https:\/\/doi.org\/10.1007\/978-3-319-10936-7_19","DOI":"10.1007\/978-3-319-10936-7_19"},{"key":"11_CR42","doi-asserted-by":"publisher","unstructured":"Urban, C., M\u00fcller, P.: An abstract interpretation framework for input data usage. In: ESOP (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_24","DOI":"10.1007\/978-3-319-89884-1_24"},{"key":"11_CR43","doi-asserted-by":"publisher","unstructured":"Urban, C., Christakis, M., W\u00fcstholz, V., Zhang, F.: Perfectly parallel fairness certification of neural networks. OOPSLA (2020). https:\/\/doi.org\/10.1145\/3428253","DOI":"10.1145\/3428253"},{"key":"11_CR44","doi-asserted-by":"publisher","unstructured":"Wilhelm, R., et al.: The worst-case execution-time problem-overview of methods and survey of tools. ACM Trans. Embed. Comput. Syst. (2008). https:\/\/doi.org\/10.1145\/1347375.1347389","DOI":"10.1145\/1347375.1347389"},{"key":"11_CR45","doi-asserted-by":"publisher","unstructured":"Wong, W.H.: Timing attacks on RSA: revealing your secrets through the fourth dimension. ACM (2005). https:\/\/doi.org\/10.1145\/1144396.1144401","DOI":"10.1145\/1144396.1144401"}],"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-031-74776-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T05:35:47Z","timestamp":1737351347000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74776-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031747755","9783031747762"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74776-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"21 January 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":"Pasadena, 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":"20 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sas2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2024.splashcon.org\/home\/sas-2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}