{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:52:40Z","timestamp":1743015160334,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031505201"},{"type":"electronic","value":"9783031505218"}],"license":[{"start":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T00:00:00Z","timestamp":1703894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T00:00:00Z","timestamp":1703894400000},"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-50521-8_14","type":"book-chapter","created":{"date-parts":[[2023,12,29]],"date-time":"2023-12-29T08:03:15Z","timestamp":1703836995000},"page":"291-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automatic and\u00a0Incremental Repair for\u00a0Speculative Information Leaks"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Bard","sequence":"first","affiliation":[]},{"given":"Swen","family":"Jacobs","sequence":"additional","affiliation":[]},{"given":"Yakir","family":"Vizel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,30]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-642-28756-5_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"PA Abdulla","year":"2012","unstructured":"Abdulla, P.A., Atig, M.F., Chen, Y.-F., Leonardsson, C., Rezine, A.: Counter-example guided fence insertion under TSO. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 204\u2013219. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28756-5_15"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Bard, J., Jacobs, S., Vizel, Y.: Artifact of automatic and incremental repair for speculative information leaks. https:\/\/doi.org\/10.5281\/zenodo.8348711","DOI":"10.5281\/zenodo.8348711"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11502760_3","volume-title":"Fast Software Encryption","author":"DJ Bernstein","year":"2005","unstructured":"Bernstein, D.J.: The Poly1305-AES message-authentication code. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 32\u201349. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11502760_3"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11745853_14","volume-title":"Public Key Cryptography - PKC 2006","author":"DJ Bernstein","year":"2006","unstructured":"Bernstein, D.J.: Curve25519: new Diffie-Hellman speed records. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 207\u2013228. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11745853_14"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Bhattacharyya, A., et al.: Smotherspectre: exploiting speculative execution through port contention. In: CCS, pp. 785\u2013800. ACM (2019)","DOI":"10.1145\/3319535.3363194"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-38856-9_8","volume-title":"Static Analysis","author":"N Bj\u00f8rner","year":"2013","unstructured":"Bj\u00f8rner, N., McMillan, K., Rybalchenko, A.: On solving universally quantified horn clauses. In: Logozzo, F., F\u00e4hndrich, M. (eds.) SAS 2013. LNCS, vol. 7935, pp. 105\u2013125. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38856-9_8"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-030-31784-3_29","volume-title":"Automated Technology for Verification and Analysis","author":"R Bloem","year":"2019","unstructured":"Bloem, R., Jacobs, S., Vizel, Y.: Efficient information-flow verification under speculative execution. In: Chen, Y.-F., Cheng, C.-H., Esparza, J. (eds.) ATVA 2019. LNCS, vol. 11781, pp. 499\u2013514. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31784-3_29"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-642-37036-6_29","volume-title":"Programming Languages and Systems","author":"A Bouajjani","year":"2013","unstructured":"Bouajjani, A., Derevenetc, E., Meyer, R.: Checking and enforcing robustness against TSO. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 533\u2013553. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37036-6_29"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-18275-4_7","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"AR Bradley","year":"2011","unstructured":"Bradley, A.R.: SAT-based model checking without unrolling. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 70\u201387. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18275-4_7"},{"key":"14_CR10","unstructured":"Canella, C., et al.: A systematic evaluation of transient execution attacks and defenses. In: USENIX Security Symposium, pp. 249\u2013266 (2019)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Cauligi, S., et al.: Constant-time foundations for the new spectre era. In: PLDI, pp. 913\u2013926. ACM (2020)","DOI":"10.1145\/3385412.3385970"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Cauligi, S., Disselkoen, C., Moghimi, D., Barthe, G., Stefan, D.: Sok: practical foundations for software spectre defenses. In: SP, pp. 666\u2013680. IEEE (2022)","DOI":"10.1109\/SP46214.2022.9833707"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Cheang, K., Rasmussen, C., Seshia, S.A., Subramanyan, P.: A formal approach to secure speculation. In: CSF, pp. 288\u2013303. IEEE (2019)","DOI":"10.1109\/CSF.2019.00027"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E Clarke","year":"2000","unstructured":"Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 154\u2013169. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722167_15"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Daniel, L., Bardin, S., Rezk, T.: Hunting the haunter - efficient relational symbolic execution for spectre with haunted relse. In: 28th Annual Network and Distributed System Security Symposium, NDSS 2021, virtually, 21\u201325 February 2021. The Internet Society (2021). https:\/\/www.ndss-symposium.org\/ndss-paper\/hunting-the-haunter-efficient-relational-symbolic-execution-for-spectre-with-haunted-relse\/","DOI":"10.14722\/ndss.2021.24286"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Daniel, L., Bardin, S., Rezk, T.: Binsec\/Rel: symbolic binary analyzer for security with applications to constant-time and secret-erasure. ACM Trans. Priv. Secur. 26(2), 11:1\u201311:42 (2023)","DOI":"10.1145\/3563037"},{"issue":"7","key":"14_CR17","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1145\/359636.359712","volume":"20","author":"DE Denning","year":"1977","unstructured":"Denning, D.E., Denning, P.J.: Certification of programs for secure information flow. Commun. ACM 20(7), 504\u2013513 (1977)","journal-title":"Commun. ACM"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Fabian, X., Guarnieri, M., Patrignani, M.: Automatic detection of speculative execution combinations. In: CCS, pp. 965\u2013978. ACM (2022)","DOI":"10.1145\/3548606.3560555"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Guarnieri, M., K\u00f6pf, B., Morales, J.F., Reineke, J., S\u00e1nchez, A.: Spectector: principled detection of speculative information flows. In: IEEE Symposium on Security and Privacy, pp. 1\u201319. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00011"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-319-21690-4_20","volume-title":"Computer Aided Verification","author":"A Gurfinkel","year":"2015","unstructured":"Gurfinkel, A., Kahsai, T., Komuravelli, A., Navas, J.A.: The SeaHorn verification framework. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 343\u2013361. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_20"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-31612-8_13","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"K Hoder","year":"2012","unstructured":"Hoder, K., Bj\u00f8rner, N.: Generalized property directed reachability. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 157\u2013171. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31612-8_13"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Khasawneh, K.N., Koruyeh, E.M., Song, C., Evtyushkin, D., Ponomarev, D., Abu-Ghazaleh, N.B.: Safespec: banishing the spectre of a meltdown with leakage-free speculation. In: DAC, p. 60. ACM (2019)","DOI":"10.1145\/3316781.3317903"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Kiriansky, V., Lebedev, I.A., Amarasinghe, S.P., Devadas, S., Emer, J.S.: DAWG: a defense against cache timing attacks in speculative execution processors. In: MICRO, pp. 974\u2013987. IEEE Computer Society (2018)","DOI":"10.1109\/MICRO.2018.00083"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Kocher, P., et al.: Spectre attacks: exploiting speculative execution. In: IEEE Symposium on Security and Privacy, pp. 1\u201319. IEEE (2019)","DOI":"10.1109\/SP.2019.00002"},{"issue":"3","key":"14_CR25","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10703-016-0249-4","volume":"48","author":"A Komuravelli","year":"2016","unstructured":"Komuravelli, A., Gurfinkel, A., Chaki, S.: SMT-based model checking for recursive programs. Formal Methods Syst. Des. 48(3), 175\u2013205 (2016)","journal-title":"Formal Methods Syst. Des."},{"key":"14_CR26","unstructured":"Kuperstein, M., Vechev, M.T., Yahav, E.: Automatic inference of memory fences. In: Bloem, R., Sharygina, N. (eds.) Proceedings of 10th International Conference on Formal Methods in Computer-Aided Design, FMCAD 2010, Lugano, Switzerland, 20\u201323 October, pp. 111\u2013119. IEEE (2010)"},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"de Le\u00f3n, H.P., Kinder, J.: Cats vs. spectre: an axiomatic approach to modeling speculative execution attacks. In: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, 22\u201326 May 2022, pp. 235\u2013248. IEEE (2022). https:\/\/doi.org\/10.1109\/SP46214.2022.9833774","DOI":"10.1109\/SP46214.2022.9833774"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"14_CR29","unstructured":"Oleksenko, O., Trach, B., Silberstein, M., Fetzer, C.: Specfuzz: bringing spectre-type vulnerabilities to the surface. In: USENIX Security Symposium, pp. 1481\u20131498. USENIX Association (2020)"},{"key":"14_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-030-29959-0_14","volume-title":"Computer Security \u2013 ESORICS 2019","author":"M Schwarz","year":"2019","unstructured":"Schwarz, M., Schwarzl, M., Lipp, M., Masters, J., Gruss, D.: NetSpectre: read arbitrary memory over network. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS 2019. LNCS, vol. 11735, pp. 279\u2013299. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29959-0_14"},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"Shivakumar, B.A., et al.: Typing high-speed cryptography against spectre v1. In: SP, pp. 1094\u20131111. IEEE (2023)","DOI":"10.1109\/SP46215.2023.10179418"},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"Vassena, M., et al.: Automatically eliminating speculative leaks from cryptographic code with blade. Proc. ACM Program. Lang. 5(POPL), 1\u201330 (2021)","DOI":"10.1145\/3434330"},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Wang, G., Chattopadhyay, S., Biswas, A.K., Mitra, T., Roychoudhury, A.: Kleespectre: detecting information leakage through speculative cache attacks via symbolic execution. ACM Trans. Softw. Eng. Methodol. 29(3), 14:1\u201314:31 (2020)","DOI":"10.1145\/3385897"},{"issue":"11","key":"14_CR34","doi-asserted-by":"publisher","first-page":"2504","DOI":"10.1109\/TSE.2019.2953709","volume":"47","author":"G Wang","year":"2021","unstructured":"Wang, G., Chattopadhyay, S., Gotovchits, I., Mitra, T., Roychoudhury, A.: oo7: Low-overhead defense against spectre attacks via program analysis. IEEE Trans. Softw. Eng. 47(11), 2504\u20132519 (2021)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"14_CR35","doi-asserted-by":"crossref","unstructured":"Yan, M., Choi, J., Skarlatos, D., Morrison, A., Fletcher, C.W., Torrellas, J.: Invisispec: making speculative execution invisible in the cache hierarchy (corrigendum). In: MICRO, p. 1076. ACM (2019)","DOI":"10.1145\/3352460.3361129"},{"key":"14_CR36","unstructured":"Zhang, Z., Barthe, G., Chuengsatiansup, C., Schwabe, P., Yarom, Y.: Ultimate SLH: taking speculative load hardening to the next level. In: USENIX Security Symposium, pp. 7125\u20137142. USENIX Association (2023)"},{"key":"14_CR37","doi-asserted-by":"publisher","unstructured":"Zinzindohou\u00e9, J.K., Bhargavan, K., Protzenko, J., Beurdouche, B.: Hacl*: a verified modern cryptographic library. In: Thuraisingham, B., Evans, D., Malkin, T., Xu, D. (eds.) Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, 30 October\u201303 November 2017, pp. 1789\u20131806. ACM (2017). https:\/\/doi.org\/10.1145\/3133956.3134043","DOI":"10.1145\/3133956.3134043"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-50521-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,3]],"date-time":"2024-01-03T00:09:56Z","timestamp":1704240596000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50521-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,30]]},"ISBN":["9783031505201","9783031505218"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50521-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,30]]},"assertion":[{"value":"30 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VMCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Verification, Model Checking, and Abstract Interpretation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"15 January 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2024","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":"vmcai2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl24.sigplan.org\/home\/VMCAI-2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"74","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}