{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T15:53:33Z","timestamp":1777305213932,"version":"3.51.4"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031986673","type":"print"},{"value":"9783031986680","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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T00:00:00Z","timestamp":1753142400000},"content-version":"vor","delay-in-days":202,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Many security- and performance-critical domains, such as cryptography, rely on low-level verification to minimize the trusted computing surface and allow code to be written directly in assembly. However, verifying assembly code against a realistic machine model is a challenging task. Furthermore, certain security properties\u2014such as constant-time behavior\u2014require relational reasoning that goes beyond traditional correctness by linking multiple execution traces within a single specification. Yet, relational verification has been extensively explored at a higher level of abstraction. In this work, we introduce a Hoare-style logic that provides low-level, expressive relational verification. We demonstrate our approach on the s2n-bignum library, proving both constant-time discipline and equivalence between optimized and verification-friendly routines. Formalized in HOL Light, our results confirm the real-world applicability of relational verification in large assembly codebases.<\/jats:p>","DOI":"10.1007\/978-3-031-98668-0_19","type":"book-chapter","created":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T20:46:18Z","timestamp":1753130778000},"page":"389-413","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Relational Hoare Logic for\u00a0Realistically Modelled Machine Code"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3613-2035","authenticated-orcid":false,"given":"Denis","family":"Mazzucato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1414-7073","authenticated-orcid":false,"given":"Abdalrhman","family":"Mohamed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8152-9330","authenticated-orcid":false,"given":"Juneyoung","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9522-3084","authenticated-orcid":false,"given":"Clark","family":"Barrett","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5072-9520","authenticated-orcid":false,"given":"Jim","family":"Grundy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Harrison","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5579-6961","authenticated-orcid":false,"given":"Corina S.","family":"P\u0103s\u0103reanu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,22]]},"reference":[{"key":"19_CR1","unstructured":"Abdulrahman, A., Becker, H., Kannwischer, M.J., Klein, F.: Fast and Clean: Auditable high-performance assembly via constraint solving. Cryptology ePrint Archive, Paper 2022\/1303 (2022)"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Affeldt, R.: On construction of a library of formally verified low-level arithmetic functions. In: Proceedings of the 27th Annual ACM Symposium on Applied Computing, SAC 2012, pp. 1326\u20131331. Association for Computing Machinery, New York (2012). ISBN 978-1-4503-0857-1. https:\/\/doi.org\/10.1145\/2245276.2231986","DOI":"10.1145\/2245276.2231986"},{"key":"19_CR3","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. In: Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2017, pp. 362\u2013375. Association for Computing Machinery, New York (2017). ISBN 978-1-4503-4988-8. https:\/\/doi.org\/10.1145\/3062341.3062378","DOI":"10.1145\/3062341.3062378"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-319-06200-6_8","volume-title":"NASA Formal Methods","author":"B Bartels","year":"2014","unstructured":"Bartels, B., J\u00e4hnig, N.: Mechanized, compositional verification of low-level code. In: Badger, J.M., Rozier, K.Y. (eds.) NFM 2014. LNCS, vol. 8430, pp. 98\u2013112. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06200-6_8"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-642-21437-0_17","volume-title":"FM 2011: Formal Methods","author":"G Barthe","year":"2011","unstructured":"Barthe, G., Crespo, J.M., Kunz, C.: Relational verification using product programs. In: Butler, M., Schulte, W. (eds.) FM 2011. LNCS, vol. 6664, pp. 200\u2013214. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21437-0_17"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Barthe, G., Gregoire, B., Laporte, V.: Secure compilation of side-channel countermeasures: the case of cryptographic \u201cconstant-time\u201d. In: 2018 IEEE 31st Computer Security Foundations Symposium (CSF 2018), pp. 328\u2013343. IEEE (2018)","DOI":"10.1109\/CSF.2018.00031"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/11679219_9","volume-title":"Formal Aspects in Security and Trust","author":"G Barthe","year":"2006","unstructured":"Barthe, G., Rezk, T., Saabas, A.: Proof obligations preserving compilation. In: Dimitrakos, T., Martinelli, F., Ryan, P., Schneider, S. (eds.) FAST 2005. LNCS, vol. 3866, pp. 112\u2013126. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11679219_9"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11575467_24","volume-title":"Programming Languages and Systems","author":"N Benton","year":"2005","unstructured":"Benton, N.: A typed, compositional logic for a stack-based abstract machine. In: Yi, K. (ed.) APLAS 2005. LNCS, vol. 3780, pp. 364\u2013380. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11575467_24"},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Benton, N.: Simple relational correctness proofs for static analyses and program transformations. In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2004, pp. 14\u201325. Association for Computing Machinery, New York (2004). ISBN 978-1-58113-729-3. https:\/\/doi.org\/10.1145\/964001.964003","DOI":"10.1145\/964001.964003"},{"key":"19_CR10","doi-asserted-by":"publisher","unstructured":"Benton, N.: Semantic equivalence checking for HHVM bytecode. In: Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, PPDP 2018, pp. 1\u20138. Association for Computing Machinery, New York (2018). ISBN 978-1-4503-6441-6. https:\/\/doi.org\/10.1145\/3236950.3236975","DOI":"10.1145\/3236950.3236975"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-22863-6_6","volume-title":"Interactive Theorem Proving","author":"L Beringer","year":"2011","unstructured":"Beringer, L.: Relational decomposition. In: van Eekelen, M., Geuvers, H., Schmaltz, J., Wiedijk, F. (eds.) ITP 2011. LNCS, vol. 6898, pp. 39\u201354. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22863-6_6"},{"key":"19_CR12","doi-asserted-by":"publisher","unstructured":"Blatter, L., Kosmatov, N., Prevosto, V., Le\u00a0Gall, P.: Certified verification of\u00a0relational properties. In: Integrated Formal Methods: 17th International Conference, IFM 2022, Lugano, Switzerland, 7\u201310 June 2022, Proceedings, pp. 86\u2013105. Springer, Heidelberg (2022). ISBN 978-3-031-07726-5. https:\/\/doi.org\/10.1007\/978-3-031-07727-2_6","DOI":"10.1007\/978-3-031-07727-2_6"},{"key":"19_CR13","unstructured":"Bond, B., et al.: Vale: verifying high-performance cryptographic assembly code. In: 26th USENIX Security Symposium (USENIX Security 2017), pp. 917\u2013934 (2017). ISBN 978-1-931971-40-9"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-030-63618-0_7","volume-title":"Software Verification","author":"J Bosamiya","year":"2020","unstructured":"Bosamiya, J., Gibson, S., Li, Y., Parno, B., Hawblitzel, C.: Verified transformations and hoare logic: beautiful proofs for ugly assembly language. In: Christakis, M., Polikarpova, N., Duggirala, P.S., Schrammel, P. (eds.) NSV\/VSTTE -2020. LNCS, vol. 12549, pp. 106\u2013123. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63618-0_7"},{"key":"19_CR15","doi-asserted-by":"publisher","unstructured":"Cauligi, S., Disselkoen, C., Moghimi, D., Barthe, G., Stefan, D.: SoK: practical foundations for software spectre defenses. In: 2022 IEEE Symposium on Security and Privacy (SP), pp. 666\u2013680. IEEE Computer Society (2022). ISBN 978-1-66541-316-9. https:\/\/doi.org\/10.1109\/SP46214.2022.9833707","DOI":"10.1109\/SP46214.2022.9833707"},{"key":"19_CR16","doi-asserted-by":"publisher","unstructured":"Clarkson, M.R., Schneider, F.B.: Hyperproperties. In: 2008 21st IEEE Computer Security Foundations Symposium, pp. 51\u201365 (2008). https:\/\/doi.org\/10.1109\/CSF.2008.7","DOI":"10.1109\/CSF.2008.7"},{"key":"19_CR17","doi-asserted-by":"publisher","unstructured":"Erbsen, A., Philipoom, J., Gross, J., Sloan, R., Chlipala, A.: Simple high-level code for cryptographic arithmetic - with proofs, without compromises. In: 2019 IEEE Symposium on Security and Privacy (SP), pp. 1202\u20131219 (2019). https:\/\/doi.org\/10.1109\/SP.2019.00005","DOI":"10.1109\/SP.2019.00005"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-03359-9_4","volume-title":"Theorem Proving in Higher Order Logics","author":"J Harrison","year":"2009","unstructured":"Harrison, J.: HOL light: an overview. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 60\u201366. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03359-9_4"},{"key":"19_CR19","unstructured":"Harrison, J.: HOL Light Tutorial (for Version 2.20) (2011)"},{"issue":"10","key":"19_CR20","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C Hoare","year":"1969","unstructured":"Hoare, C.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580 (1969)","journal-title":"Commun. ACM"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"J\u00e4hnig, N., Gothel, T., Glesner, S.: A denotational semantics for communicating unstructured code (2015)","DOI":"10.4204\/EPTCS.178.2"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-41591-8_5","volume-title":"Software Engineering and Formal Methods","author":"N J\u00e4hnig","year":"2016","unstructured":"J\u00e4hnig, N., G\u00f6thel, T., Glesner, S.: Refinement-based verification of communicating unstructured code. In: De Nicola, R., K\u00fchn, E. (eds.) SEFM 2016. LNCS, vol. 9763, pp. 61\u201375. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41591-8_5"},{"key":"19_CR23","doi-asserted-by":"publisher","unstructured":"Jensen, J.B., Benton, N., Kennedy, A.: High-level separation logic for low-level code. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2013, pp. 301\u2013314. Association for Computing Machinery, New York (2013). ISBN 978-1-4503-1832-7. https:\/\/doi.org\/10.1145\/2429069.2429105","DOI":"10.1145\/2429069.2429105"},{"key":"19_CR24","doi-asserted-by":"publisher","unstructured":"Kang, J., et al.: Crellvm: verified credible compilation for LLVM. In: Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018, pp. 631\u2013645. Association for Computing Machinery, New York (2018). ISBN 978-1-4503-5698-5. https:\/\/doi.org\/10.1145\/3192366.3192377","DOI":"10.1145\/3192366.3192377"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Klein, G., et al.: Formal verification of an OS kernel. In: Proceedings of the ACM SIGOPS 22nd Symposium on Operating Systems Principles, pp. 207\u2013220 (2009)","DOI":"10.1145\/1629575.1629596"},{"key":"19_CR26","doi-asserted-by":"publisher","unstructured":"Kocher, P., et al.: Spectre attacks: exploiting speculative execution. In: 2019 IEEE Symposium on Security and Privacy (SP), pp. 1\u201319 (2019). ISSN 2375-1207. https:\/\/doi.org\/10.1109\/SP.2019.00002","DOI":"10.1109\/SP.2019.00002"},{"issue":"1","key":"19_CR27","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1145\/2578855.2535841","volume":"49","author":"R Kumar","year":"2014","unstructured":"Kumar, R., Myreen, M., Norrish, M., Owens, S.: Cakeml: a verified implementation of ml. ACM SIGPLAN Not. 49(1), 179\u2013191 (2014)","journal-title":"ACM SIGPLAN Not."},{"issue":"1","key":"19_CR28","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.entcs.2007.02.059","volume":"190","author":"H Lehner","year":"2007","unstructured":"Lehner, H.: Muller: formal translation of bytecode into BoogiePL. Electron. Notes Theor. Comput. Sci. 190(1), 35\u201350 (2007)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-030-58768-0_11","volume-title":"Software Engineering and Formal Methods","author":"D Lundberg","year":"2020","unstructured":"Lundberg, D., Guanciale, R., Lindner, A., Dam, M.: Hoare-style logic for unstructured programs. In: de Boer, F., Cerone, A. (eds.) SEFM 2020. LNCS, vol. 12310, pp. 193\u2013213. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58768-0_11"},{"key":"19_CR30","unstructured":"Marti, N.: Formal verification of low-level software. Ph.D. thesis, University of Tokyo (2008)"},{"key":"19_CR31","doi-asserted-by":"publisher","unstructured":"Mazzucato, D., Campion, M., Urban, C.: Quantitative static timing analysis. In: 31st Static Analysis Symposium (SAS 2024), Roberto Giacobazzi and Alessandra Gorla and Marco Campion, Pasadena, CA, United States (2024). https:\/\/doi.org\/10.1007\/978-3-031-74776-2_11","DOI":"10.1007\/978-3-031-74776-2_11"},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"Mazzucato, D., et al.: Relational hoare logic for realistically modelled machine code (2025). https:\/\/arxiv.org\/abs\/2505.14348","DOI":"10.1007\/978-3-031-98668-0_19"},{"key":"19_CR33","unstructured":"Myreen, M., Curello, G.: Formal verification of machine-code programs. In: Lundberg, D. (ed.) International Conference on Certified Programs and Proofs, p.\u00a020. University of Cambridge, Computer Laboratory (2009)"},{"key":"19_CR34","unstructured":"Myreen, M., Gordon, M.: Verification of machine code implementations of arithmetic functions for cryptography. In: Theorem Proving in Higher Order Logics: Emerging Trends Proceedings, Department of Computer Science, University of Kaiserslautern (2007)"},{"key":"19_CR35","doi-asserted-by":"crossref","unstructured":"Myreen, M., Gordon, M., Slind, K.: Machine-code verification for multiple architectures-an application of decompilation into logic. In: 2008 Formal Methods in Computer-Aided Design, pp. 1\u20138. IEEE (2008)","DOI":"10.1109\/FMCAD.2008.ECP.24"},{"key":"19_CR36","unstructured":"Myreen, M., Gordon, M., Slind, K.: Decompilation into logic\u2014improved. In: 2012 Formal Methods in Computer-Aided Design (FMCAD, pp. 78\u201381. IEEE (2012)"},{"key":"19_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-540-75698-9_18","volume-title":"International Symposium on Fundamentals of Software Engineering","author":"MO Myreen","year":"2007","unstructured":"Myreen, M.O., Fox, A., Gordon, M.: Hoare logic for ARM machine code. In: Arbab, F., Sirjani, M. (eds.) FSEN 2007. LNCS, vol. 4767, pp. 272\u2013286. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75698-9_18"},{"key":"19_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-540-71209-1_44","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"MO Myreen","year":"2007","unstructured":"Myreen, M.O., Gordon, M.: Hoare logic for realistically modelled machine\u00a0code. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 568\u2013582. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71209-1_44"},{"key":"19_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-030-61470-6_7","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation: Engineering Principles","author":"DA Naumann","year":"2020","unstructured":"Naumann, D.A.: Thirty-seven years of relational hoare logic: remarks on its principles and\u00a0history. In: Margaria, T., Steffen, B. (eds.) ISoLA 2020. LNCS, vol. 12477, pp. 93\u2013116. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61470-6_7"},{"key":"19_CR40","doi-asserted-by":"crossref","unstructured":"O\u2019Hearn, P., Reynolds, J., Yang, H.: Local reasoning about programs that alter data structures. In: Proceedings of Computer Science Logic (2001)","DOI":"10.1007\/3-540-44802-0_1"},{"key":"19_CR41","doi-asserted-by":"publisher","unstructured":"Pit-Claudel, C., Philipoom, J., Jamner, D., Erbsen, A., Chlipala, A.: Relational compilation for performance-critical applications: extensible proof-producing translation of functional models into low-level code. In: Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, PLDI 2022, pp. 918\u2013933. Association for Computing Machinery, New York (2022). ISBN 978-1-4503-9265-5. https:\/\/doi.org\/10.1145\/3519939.3523706","DOI":"10.1145\/3519939.3523706"},{"key":"19_CR42","doi-asserted-by":"publisher","unstructured":"Protzenko, J., et al.: EverCrypt: a fast, verified, cross-platform cryptographic provider. In: 2020 IEEE Symposium on Security and Privacy (SP), pp. 983\u20131002 (2020). ISSN 2375-1207. https:\/\/doi.org\/10.1109\/SP40000.2020.00114","DOI":"10.1109\/SP40000.2020.00114"},{"key":"19_CR43","doi-asserted-by":"publisher","unstructured":"Ray, S., Hunt, W.A., Matthews, J., Moore, J.S.: A mechanical analysis of program verification strategies. J. Autom. Reason. 40(4), 245\u2013269 (2008). ISSN 1573-0670. https:\/\/doi.org\/10.1007\/s10817-008-9098-1","DOI":"10.1007\/s10817-008-9098-1"},{"key":"19_CR44","unstructured":"Reynolds, J.: Separation logic: a logic for shared mutable data structures. In: Proceedings of 17th IEEE Symposium on Logic in Computer Science (LICS) (2002)"},{"key":"19_CR45","unstructured":"Rinard, M.: Credible Compilation (1999)"},{"key":"19_CR46","doi-asserted-by":"crossref","unstructured":"Sewell, T., Myreen, M., Klein, G.: Translation validation for a verified OS kernel. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 471\u2013482 (2013)","DOI":"10.1145\/2491956.2462183"},{"key":"19_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-29613-5_12","volume-title":"Verified Software: Theories, Tools, and Experiments","author":"J Tan","year":"2016","unstructured":"Tan, J., Tay, H.J., Gandhi, R., Narasimhan, P.: AUSPICE: automatic safety property verification for unmodified executables. In: Gurfinkel, A., Seshia, S.A. (eds.) VSTTE 2015. LNCS, vol. 9593, pp. 202\u2013222. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29613-5_12"},{"key":"19_CR48","doi-asserted-by":"publisher","unstructured":"Wang, A.: An axiomatic basis for proving total correctness of goto-programs. BIT Numer. Math. 16(1), 88\u2013102 (1976). ISSN 1572-9125. https:\/\/doi.org\/10.1007\/BF01940782","DOI":"10.1007\/BF01940782"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-98668-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T15:11:53Z","timestamp":1777302713000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-98668-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031986673","9783031986680"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-98668-0_19","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":"22 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Research reported in this publication was supported by an Amazon Research Award, Fall 2023.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zagreb","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","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":"21 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.i-cav.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}