{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:36:48Z","timestamp":1742935008546,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031765537"},{"type":"electronic","value":"9783031765544"}],"license":[{"start":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T00:00:00Z","timestamp":1731456000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T00:00:00Z","timestamp":1731456000000},"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-76554-4_13","type":"book-chapter","created":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T12:03:21Z","timestamp":1731413001000},"page":"237-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Correct and\u00a0Complete Symbolic Execution for\u00a0Free"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-9712-3224","authenticated-orcid":false,"given":"Erik","family":"Voogd","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5382-3949","authenticated-orcid":false,"given":"Einar Broch","family":"Johnsen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0007-1957-4409","authenticated-orcid":false,"given":"\u00c5smund Aqissiaq Arild","family":"Kl\u00f8vstad","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1404-6232","authenticated-orcid":false,"given":"Jurriaan","family":"Rot","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5014-9784","authenticated-orcid":false,"given":"Alexandra","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,13]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Ahrendt, W., Beckert, B., Bubel, R., H\u00e4hnle, R., Schmitt, P.H., Ulbrich, M. (eds.): Deductive Software Verification - The KeY Book - From Theory to Practice. LNCS, vol. 10001. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-49812-6","DOI":"10.1007\/978-3-319-49812-6"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-319-02654-1_16","volume-title":"Software Language Engineering","author":"A Arusoaie","year":"2013","unstructured":"Arusoaie, A., Lucanu, D., Rusu, V.: A generic framework for symbolic execution. In: Erwig, M., Paige, R.F., Van Wyk, E. (eds.) SLE 2013. LNCS, vol. 8225, pp. 281\u2013301. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-02654-1_16"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3182657","volume":"51","author":"R Baldoni","year":"2018","unstructured":"Baldoni, R., Coppa, E., D\u2019elia, D.C., Demetrescu, C., Finocchi, I.: A survey of symbolic execution techniques. ACM Comput. Surv. (CSUR) 51(3), 1\u201339 (2018)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11575467_5","volume-title":"Programming Languages and Systems","author":"J Berdine","year":"2005","unstructured":"Berdine, J., Calcagno, C., O\u2019Hearn, P.W.: Symbolic execution with separation logic. In: Yi, K. (ed.) APLAS 2005. LNCS, vol. 3780, pp. 52\u201368. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11575467_5"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B Bloom","year":"1995","unstructured":"Bloom, B., Istrail, S., Meyer, A.R.: Bisimulation can\u2019t be traced. J. ACM 42(1), 232\u2013268 (1995). https:\/\/doi.org\/10.1145\/200836.200876","journal-title":"J. ACM"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Bodin, M., Gardner, P., Jensen, T., Schmitt, A.: Skeletal semantics and their interpretations. Proc. ACM Program. Lang. 3(POPL) (2019). https:\/\/doi.org\/10.1145\/3290357","DOI":"10.1145\/3290357"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Bodin, M., Jensen, T., Schmitt, A.: Certified abstract interpretation with pretty-big-step semantics. In: Proceedings of the 2015 Conference on Certified Programs and Proofs, CPP 2015, pp. 29\u201340. Association for Computing Machinery (2015). https:\/\/doi.org\/10.1145\/2676724.2693174","DOI":"10.1145\/2676724.2693174"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-30942-8_6","volume-title":"Formal Methods - The Next 30 Years","author":"FS de Boer","year":"2019","unstructured":"de Boer, F.S., Bonsangue, M.: On the nature of symbolic execution. In: ter Beek, M.H., McIver, A., Oliveira, J.N. (eds.) Formal Methods - The Next 30 Years, pp. 64\u201380. Springer, Cham (2019)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"de Boer, F.S., Bonsangue, M.: Symbolic execution formally explained. Formal Aspects Comput.33(4), 617\u2013636 (2021)","DOI":"10.1007\/s00165-020-00527-y"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Boyer, R.S., Elspas, B., Levitt, K.N.: SELECT - a formal system for testing and debugging programs by symbolic execution. In: Shooman, M.L., Yeh, R.T. (eds.) Proc. International Conference on Reliable Software 1975, pp. 234\u2013245. ACM (1975). https:\/\/doi.org\/10.1145\/800027.808445","DOI":"10.1145\/800027.808445"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Fragoso\u00a0Santos, J., Maksimovi\u0107, P., Ayoun, S.\u00c9., Gardner, P.: Gillian, part i: a multi-language platform for symbolic execution. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 927\u2013942 (2020)","DOI":"10.1145\/3385412.3386014"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: The meaning of negative premises in transition system specifications II. J. Log. Algebraic Methods Program. 60-61, 229\u2013258 (2004). https:\/\/doi.org\/10.1016\/J.JLAP.2004.03.007","DOI":"10.1016\/J.JLAP.2004.03.007"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Goncharov, S., Milius, S., Schr\u00f6der, L., Tsampas, S., Urbat, H.: Stateful Structural Operational Semantics. In: Felty, A.P. (ed.) 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0228, pp. 30:1\u201330:19. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2022). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2022.30","DOI":"10.4230\/LIPIcs.FSCD.2022.30"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Groote, J.F.: Transition system specifications with negative premises. Theor. Comput. Sci. 118(2), 263\u2013299 (1993). https:\/\/doi.org\/10.1016\/0304-3975(93)90111-6","DOI":"10.1016\/0304-3975(93)90111-6"},{"issue":"6","key":"13_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/390016.808434","volume":"10","author":"S Katz","year":"1975","unstructured":"Katz, S., Manna, Z.: Towards automatic debugging of programs. ACM SIGPLAN Notices 10(6), 143\u2013155 (1975)","journal-title":"ACM SIGPLAN Notices"},{"issue":"7","key":"13_CR16","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/360248.360252","volume":"19","author":"JC King","year":"1976","unstructured":"King, J.C.: Symbolic execution and program testing. Commun. ACM 19(7), 385\u2013394 (1976)","journal-title":"Commun. ACM"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Klin, B., Nachyla, B.: Some undecidable properties of SOS specifications. J. Log. Algebraic Methods Program. 87, 94\u2013109 (2017). https:\/\/doi.org\/10.1016\/J.JLAMP.2016.08.005","DOI":"10.1016\/J.JLAMP.2016.08.005"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.jsc.2016.07.012","volume":"80","author":"D Lucanu","year":"2017","unstructured":"Lucanu, D., Rusu, V., Arusoaie, A.: A generic framework for symbolic execution: a coinductive approach. J. Symb. Comput. 80, 125\u2013163 (2017)","journal-title":"J. Symb. Comput."},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/978-3-030-81688-9_38","volume-title":"Computer Aided Verification","author":"P Maksimovi\u0107","year":"2021","unstructured":"Maksimovi\u0107, P., Ayoun, S.\u00c9., Santos, J.F., Gardner, P.: Gillian, Part II: real-world verification for JavaScript and C. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021. LNCS, vol. 12760, pp. 827\u2013850. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81688-9_38"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. J. Log. Algebraic Methods Program. 60-61, 17\u2013139 (2004). originally a tech. report from Aarhus University, 1981","DOI":"10.1016\/j.jlap.2004.05.001"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Porncharoenwase, S., Nelson, L., Wang, X., Torlak, E.: A formal foundation for symbolic evaluation with merging. Proc. ACM Program. Lang. 6(POPL), January 2022. https:\/\/doi.org\/10.1145\/3498709","DOI":"10.1145\/3498709"},{"key":"13_CR22","volume-title":"Dependable Software Systems Engineering","author":"G Rosu","year":"2017","unstructured":"Rosu, G.: K - a semantic framework for programming languages and formal analysis tools. In: Peled, D., Pretschner, A. (eds.) Dependable Software Systems Engineering. IOS Press, NATO Science for Peace and Security (2017)"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-319-08918-8_29","volume-title":"Rewriting and Typed Lambda Calculi","author":"A \u015etef\u0103nescu","year":"2014","unstructured":"\u015etef\u0103nescu, A., Ciob\u00e2c\u0103, \u015e, Mereuta, R., Moore, B.M., \u015eerb\u0103nut\u0103, T.F., Ro\u015fu, G.: All-path reachability logic. In: Dowek, G. (ed.) RTA 2014. LNCS, vol. 8560, pp. 425\u2013440. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08918-8_29"},{"key":"13_CR24","unstructured":"Steinh\u00f6fel, D.: Abstract execution: automatically proving infinitely many programs. Ph.D. thesis, Technische Universit\u00e4t Darmstadt (2020)"},{"key":"13_CR25","doi-asserted-by":"publisher","unstructured":"Turi, D., Plotkin, G.: Towards a mathematical operational semantics. In: Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp. 280\u2013291 (1997). https:\/\/doi.org\/10.1109\/LICS.1997.614955","DOI":"10.1109\/LICS.1997.614955"},{"key":"13_CR26","doi-asserted-by":"publisher","unstructured":"Voogd, E., Johnsen, E.B., Silva, A., Susag, Z.J., Wasowski, A.: Symbolic semantics for probabilistic programs. In: Proc. 20th Intl. Conf. on Quantitative Evaluation of SysTems (QEST 2023). Lecture Notes in Computer Science, vol. 14287, pp. 329\u2013345. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-43835-6_23","DOI":"10.1007\/978-3-031-43835-6_23"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-76554-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T11:38:32Z","timestamp":1737200312000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-76554-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,13]]},"ISBN":["9783031765537","9783031765544"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-76554-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,13]]},"assertion":[{"value":"13 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integrated Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Manchester","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":"11 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ifm2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ifm2024.cs.manchester.ac.uk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}