{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:38:00Z","timestamp":1742920680308,"version":"3.40.3"},"publisher-location":"Cham","reference-count":61,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031505232"},{"type":"electronic","value":"9783031505249"}],"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-50524-9_4","type":"book-chapter","created":{"date-parts":[[2023,12,29]],"date-time":"2023-12-29T15:02:28Z","timestamp":1703862148000},"page":"74-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Correctness Witness Validation by\u00a0Abstract Interpretation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4553-1350","authenticated-orcid":false,"given":"Simmo","family":"Saan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9828-0308","authenticated-orcid":false,"given":"Michael","family":"Schwarz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1729-3925","authenticated-orcid":false,"given":"Julian","family":"Erhard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2135-1593","authenticated-orcid":false,"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9644-7475","authenticated-orcid":false,"given":"Sarah","family":"Tilscher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4336-7980","authenticated-orcid":false,"given":"Vesal","family":"Vojdani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,30]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11799573_14","volume-title":"Logic Programming","author":"E Albert","year":"2006","unstructured":"Albert, E., Arenas, P., Puebla, G., Hermenegildo, M.: Reduced certificates for abstraction-carrying code. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 163\u2013178. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11799573_14"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-540-32275-7_25","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"E Albert","year":"2005","unstructured":"Albert, E., Puebla, G., Hermenegildo, M.: Abstraction-carrying code. In: Baader, F., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3452, pp. 380\u2013397. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-32275-7_25"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-38856-9_4","volume-title":"Static Analysis","author":"G Amato","year":"2013","unstructured":"Amato, G., Scozzari, F.: Localizing widening and narrowing. In: Logozzo, F., F\u00e4hndrich, M. (eds.) SAS 2013. LNCS, vol. 7935, pp. 25\u201342. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38856-9_4"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.scico.2015.12.005","volume":"120","author":"G Amato","year":"2016","unstructured":"Amato, G., Scozzari, F., Seidl, H., Apinis, K., Vojdani, V.: Efficiently intertwining widening and narrowing. Sci. Comput. Program. 120, 1\u201324 (2016). https:\/\/doi.org\/10.1016\/j.scico.2015.12.005","journal-title":"Sci. Comput. Program."},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-35182-2_12","volume-title":"Programming Languages and Systems","author":"K Apinis","year":"2012","unstructured":"Apinis, K., Seidl, H., Vojdani, V.: Side-effecting constraint systems: a swiss army knife for program analysis. In: Jhala, R., Igarashi, A. (eds.) APLAS 2012. LNCS, vol. 7705, pp. 157\u2013172. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35182-2_12"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Arceri, V., Mastroeni, I., Zaffanella, E.: Decoupling the ascending and descending phases in abstract interpretation. In: Programming Languages and Systems, pp. 25\u201344. Springer, Switzerland (2022), https:\/\/doi.org\/10.1007\/978-3-031-21037-2_2","DOI":"10.1007\/978-3-031-21037-2_2"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-030-99527-0_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P Ayaziov\u00e1","year":"2022","unstructured":"Ayaziov\u00e1, P., Chalupa, M., Strej\u010dek, J.: Symbiotic-Witch: a Klee-based violation witness checker. In: TACAS 2022. LNCS, vol. 13244, pp. 468\u2013473. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99527-0_33"},{"issue":"1\u20132","key":"4_CR8","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.scico.2005.02.003","volume":"58","author":"R Bagnara","year":"2005","unstructured":"Bagnara, R., Hill, P.M., Ricci, E., Zaffanella, E.: Precise widening operators for convex polyhedra. Sci. Comput. Program. 58(1\u20132), 28\u201356 (2005). https:\/\/doi.org\/10.1016\/j.scico.2005.02.003","journal-title":"Sci. Comput. Program."},{"issue":"8","key":"4_CR9","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/3470569","volume":"64","author":"P Baudin","year":"2021","unstructured":"Baudin, P., et al.: The dogged pursuit of bug-free c programs: the frama-C software analysis platform. Commun. ACM 64(8), 56\u201368 (2021). https:\/\/doi.org\/10.1145\/3470569","journal-title":"Commun. ACM"},{"key":"4_CR10","unstructured":"Baudin, P., Cuoq, P., Filli\u00e2tre, J.C., March\u00e9, C., Monate, B., Moy, Y., Prevosto, V.: ANSI\/ISO C specification language version 1.19 (2023). http:\/\/frama-c.com\/download\/acsl.pdf"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.F.: Revising hull and box consistency. In: Logic Programming, pp. 230\u2013244. The MIT Press (1999). https:\/\/doi.org\/10.7551\/mitpress\/4304.003.0024","DOI":"10.7551\/mitpress\/4304.003.0024"},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.tcs.2006.08.012","volume":"364","author":"F Besson","year":"2006","unstructured":"Besson, F., Jensen, T., Pichardie, D.: Proof-carrying code from certified abstract interpretation and fixpoint compression. Theor. Comput. Sci. 364(3), 273\u2013291 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2006.08.012","journal-title":"Theor. Comput. Sci."},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-540-71316-6_19","volume-title":"Programming Languages and Systems","author":"F Besson","year":"2007","unstructured":"Besson, F., Jensen, T., Turpin, T.: Small witnesses for abstract interpretation-based proofs. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 268\u2013283. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71316-6_19"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Beyer, D.: Competition on software verification and witness validation: SV-COMP 2023. In: Tools and Algorithms for the Construction and Analysis of Systems, pp. 495\u2013522. Springer, Switzerland (2023), https:\/\/doi.org\/10.1007\/978-3-031-30820-8_29","DOI":"10.1007\/978-3-031-30820-8_29"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Beyer, D., Dangl, M., Dietsch, D., Heizmann, M.: Correctness witnesses: exchanging verification results between verifiers. In: Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering, pp. 326\u2013337. ACM (2016). https:\/\/doi.org\/10.1145\/2950290.2950351","DOI":"10.1145\/2950290.2950351"},{"issue":"4","key":"4_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3477579","volume":"31","author":"D Beyer","year":"2022","unstructured":"Beyer, D., Dangl, M., Dietsch, D., Heizmann, M., Lemberger, T., Tautschnig, M.: Verification witnesses. ACM Trans. Softw. Eng. Methodol. 31(4), 1\u201369 (2022). https:\/\/doi.org\/10.1145\/3477579","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Beyer, D., Dangl, M., Dietsch, D., Heizmann, M., Stahlbauer, A.: Witness validation and stepwise testification across software verifiers. In: Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering, pp. 721\u2013733, ACM (2015). https:\/\/doi.org\/10.1145\/2786805.2786867","DOI":"10.1145\/2786805.2786867"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-92994-1_1","volume-title":"Tests and Proofs","author":"D Beyer","year":"2018","unstructured":"Beyer, D., Dangl, M., Lemberger, T., Tautschnig, M.: Tests from witnesses. In: Dubois, C., Wolff, B. (eds.) TAP 2018. LNCS, vol. 10889, pp. 3\u201323. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92994-1_1"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-030-99524-9_31","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Beyer","year":"2022","unstructured":"Beyer, D., Kanav, S.: CoVeriTeam: on-demand composition of cooperative verification systems. In: TACAS 2022. LNCS, vol. 13243, pp. 561\u2013579. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_31"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-642-22110-1_16","volume-title":"Computer Aided Verification","author":"D Beyer","year":"2011","unstructured":"Beyer, D., Keremoglu, M.E.: CPAchecker: a tool for configurable software verification. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 184\u2013190. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_16"},{"issue":"1","key":"4_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10009-017-0469-y","volume":"21","author":"D Beyer","year":"2017","unstructured":"Beyer, D., L\u00f6we, S., Wendler, P.: Reliable benchmarking: requirements and solutions. Int. J. Softw. Tools Technol. Transf. 21(1), 1\u201329 (2017). https:\/\/doi.org\/10.1007\/s10009-017-0469-y","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Beyer, D., Spiessl, M., Umbricht, S.: Cooperation between automatic and interactive software verifiers. In: Software Engineering and Formal Methods, pp. 111\u2013128. Springer, Cham (2022), https:\/\/doi.org\/10.1007\/978-3-031-17108-6_7","DOI":"10.1007\/978-3-031-17108-6_7"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Beyer, D., Strej\u010dek, J.: Case study on verification-witness validators: where we are and where we go. In: Static Analysis, pp. 160\u2013174. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22308-2_8","DOI":"10.1007\/978-3-031-22308-2_8"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-030-61362-4_8","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles","author":"D Beyer","year":"2020","unstructured":"Beyer, D., Wehrheim, H.: Verification artifacts in cooperative verification: survey and unifying component framework. In: Margaria, T., Steffen, B. (eds.) ISoLA 2020. LNCS, vol. 12476, pp. 143\u2013167. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61362-4_8"},{"issue":"5","key":"4_CR25","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/780822.781153","volume":"38","author":"B Blanchet","year":"2003","unstructured":"Blanchet, B., et al.: A static analyzer for large safety-critical software. ACM SIGPLAN Not. 38(5), 196\u2013207 (2003). https:\/\/doi.org\/10.1145\/780822.781153","journal-title":"ACM SIGPLAN Not."},{"issue":"3","key":"4_CR26","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/s10703-017-0310-y","volume":"53","author":"R Boutonnet","year":"2017","unstructured":"Boutonnet, R., Halbwachs, N.: Improving the results of program analysis by abstract interpretation beyond the decreasing sequence. Formal Methods Syst. Des. 53(3), 384\u2013406 (2017). https:\/\/doi.org\/10.1007\/s10703-017-0310-y","journal-title":"Formal Methods Syst. Des."},{"key":"4_CR27","unstructured":"Cousot, P.: The calculational design of a generic abstract interpreter. In: Calculational System Design, NATO ASI Series F. IOS Press, Amsterdam (1999). https:\/\/www.di.ens.fr\/cousot\/COUSOTpapers\/publications.www\/Cousot-Marktoberdorf98.pdf.gz"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-662-46081-8_2","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P Cousot","year":"2015","unstructured":"Cousot, P.: Abstracting induction by extrapolation and interpolation. In: D\u2019Souza, D., Lal, A., Larsen, K.G. (eds.) VMCAI 2015. LNCS, vol. 8931, pp. 19\u201342. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46081-8_2"},{"key":"4_CR29","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: Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pp. 238\u2013252. ACM Press (1977). https:\/\/doi.org\/10.1145\/512950.512973","DOI":"10.1145\/512950.512973"},{"issue":"4","key":"4_CR30","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation frameworks. J. Log. Comput. 2(4), 511\u2013547 (1992). https:\/\/doi.org\/10.1093\/logcom\/2.4.511","journal-title":"J. Log. Comput."},{"issue":"3","key":"4_CR31","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10703-009-0089-6","volume":"35","author":"P Cousot","year":"2009","unstructured":"Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Min\u00e9, A., Rival, X.: Why does Astr\u00e9e scale up? Formal Methods Syst. Des. 35(3), 229\u2013264 (2009). https:\/\/doi.org\/10.1007\/s10703-009-0089-6","journal-title":"Formal Methods Syst. Des."},{"key":"4_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-662-46681-0_34","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Dangl","year":"2015","unstructured":"Dangl, M., L\u00f6we, S., Wendler, P.: CPAchecker with support for recursive programs and floating-point arithmetic. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 423\u2013425. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46681-0_34"},{"key":"4_CR33","doi-asserted-by":"publisher","unstructured":"Farzan, A., Kincaid, Z.: Verification of parameterized concurrent programs by modular reasoning about data and control. In: Proceedings of the 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 297\u2013308. ACM (2012). https:\/\/doi.org\/10.1145\/2103656.2103693","DOI":"10.1145\/2103656.2103693"},{"key":"4_CR34","doi-asserted-by":"publisher","unstructured":"Flanagan, C., Saxe, J.B.: Avoiding exponential explosion: generating compact verification conditions. In: Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 193\u2013205. ACM (2001). https:\/\/doi.org\/10.1145\/360204.360220","DOI":"10.1145\/360204.360220"},{"key":"4_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/11817963_41","volume-title":"Computer Aided Verification","author":"D Gopan","year":"2006","unstructured":"Gopan, D., Reps, T.: Lookahead widening. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 452\u2013466. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817963_41"},{"key":"4_CR36","doi-asserted-by":"publisher","unstructured":"Goualard, F., Granvilliers, L.: Controlled propagation in continuous numerical constraint networks. In: Proceedings of the 2005 ACM Symposium on Applied Computing. ACM (2005). https:\/\/doi.org\/10.1145\/1066677.1066765","DOI":"10.1145\/1066677.1066765"},{"key":"4_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-33125-1_15","volume-title":"Static Analysis","author":"N Halbwachs","year":"2012","unstructured":"Halbwachs, N., Henry, J.: When the decreasing sequence fails. In: Min\u00e9, A., Schmidt, D. (eds.) SAS 2012. LNCS, vol. 7460, pp. 198\u2013213. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33125-1_15"},{"key":"4_CR38","doi-asserted-by":"publisher","unstructured":"Haltermann, J., Wehrheim, H.: Information exchange between over- and underapproximating software analyses. In: Software Engineering and Formal Methods, pp. 37\u201354. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-17108-6_3","DOI":"10.1007\/978-3-031-17108-6_3"},{"key":"4_CR39","doi-asserted-by":"publisher","unstructured":"Heizmann, M., et al.: Ultimate automizer and the commuhash normal form. In: Tools and Algorithms for the Construction and Analysis of Systems, pp. 577\u2013581. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_39","DOI":"10.1007\/978-3-031-30820-8_39"},{"key":"4_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-39799-8_2","volume-title":"Computer Aided Verification","author":"M Heizmann","year":"2013","unstructured":"Heizmann, M., Hoenicke, J., Podelski, A.: Software model checking for people who love automata. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 36\u201352. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_2"},{"key":"4_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/978-3-642-02658-4_52","volume-title":"Computer Aided Verification","author":"B Jeannet","year":"2009","unstructured":"Jeannet, B., Min\u00e9, A.: Apron: a library of numerical abstract domains for static analysis. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 661\u2013667. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_52"},{"key":"4_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1007\/978-3-030-17184-1_26","volume-title":"Programming Languages and Systems","author":"M Journault","year":"2019","unstructured":"Journault, M., Min\u00e9, A., Ouadjaout, A.: An abstract domain for trees with numeric relations. In: Caires, L. (ed.) ESOP 2019. LNCS, vol. 11423, pp. 724\u2013751. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17184-1_26"},{"key":"4_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-030-99527-0_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H Ponce-de-Le\u00f3n","year":"2022","unstructured":"Ponce-de-Le\u00f3n, H., Haas, T., Meyer, R.: Dartagnan: SMT-based violation witness validation (competition contribution). In: TACAS 2022. LNCS, vol. 13244, pp. 418\u2013423. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99527-0_24"},{"key":"4_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-38088-4_12","volume-title":"NASA Formal Methods","author":"B Mihaila","year":"2013","unstructured":"Mihaila, B., Sepp, A., Simon, A.: Widening as abstract domain. In: Brat, G., Rungta, N., Venet, A. (eds.) NFM 2013. LNCS, vol. 7871, pp. 170\u2013184. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38088-4_12"},{"issue":"1","key":"4_CR45","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10990-006-8609-1","volume":"19","author":"A Min\u00e9","year":"2006","unstructured":"Min\u00e9, A.: The octagon abstract domain. Higher-Order Symb. Comput. 19(1), 31\u2013100 (2006). https:\/\/doi.org\/10.1007\/s10990-006-8609-1","journal-title":"Higher-Order Symb. Comput."},{"issue":"1","key":"4_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/lmcs-8(1:26)2012","volume":"8","author":"A Min\u00e9","year":"2012","unstructured":"Min\u00e9, A.: Static analysis of run-time errors in embedded real-time parallel C programs. Logical Methods Comput. Sci. 8(1), 1\u201363 (2012). https:\/\/doi.org\/10.2168\/lmcs-8(1:26)2012","journal-title":"Logical Methods Comput. Sci."},{"key":"4_CR47","doi-asserted-by":"publisher","unstructured":"Min\u00e9, A.: Tutorial on static inference of numeric invariants by abstract interpretation. Found. Trends\u00ae Program. Lang. 4(3\u20134), 120\u2013372 (2017). https:\/\/doi.org\/10.1561\/2500000034. https:\/\/hal.sorbonne-universite.fr\/hal-01657536\/document","DOI":"10.1561\/2500000034"},{"key":"4_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-319-52234-0_21","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"R Monat","year":"2017","unstructured":"Monat, R., Min\u00e9, A.: Precise thread-modular abstract interpretation of concurrent programs using relational interference abstractions. In: Bouajjani, A., Monniaux, D. (eds.) VMCAI 2017. LNCS, vol. 10145, pp. 386\u2013404. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-52234-0_21"},{"key":"4_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-030-72013-1_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Saan","year":"2021","unstructured":"Saan, S., et al.: Goblint: thread-modular abstract interpretation using side-effecting constraints. In: TACAS 2021. LNCS, vol. 12652, pp. 438\u2013442. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72013-1_28"},{"key":"4_CR50","doi-asserted-by":"publisher","unstructured":"Saan, S., et al.: Goblint: autotuning thread-modular abstract interpretation. In: Tools and Algorithms for the Construction and Analysis of Systems, pp. 547\u2013552. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_34","DOI":"10.1007\/978-3-031-30820-8_34"},{"key":"4_CR51","doi-asserted-by":"publisher","unstructured":"Saan, S., Schwarz, M., Erhard, J., Seidl, H., Tilscher, S., Vojdani, V.: Correctness witness validation by abstract interpretation (2023). https:\/\/doi.org\/10.48550\/arXiv.2310.16572","DOI":"10.48550\/arXiv.2310.16572"},{"key":"4_CR52","doi-asserted-by":"publisher","unstructured":"Saan, S., Schwarz, M., Erhard, J., Seidl, H., Tilscher, S., Vojdani, V.: Correctness witness validation by abstract interpretation (2023). https:\/\/doi.org\/10.5281\/zenodo.8253000, artifact","DOI":"10.5281\/zenodo.8253000"},{"key":"4_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-030-88806-0_18","volume-title":"Static Analysis","author":"M Schwarz","year":"2021","unstructured":"Schwarz, M., Saan, S., Seidl, H., Apinis, K., Erhard, J., Vojdani, V.: Improving thread-modular abstract interpretation. In: Dr\u0103goi, C., Mukherjee, S., Namjoshi, K. (eds.) SAS 2021. LNCS, vol. 12913, pp. 359\u2013383. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88806-0_18"},{"key":"4_CR54","doi-asserted-by":"publisher","unstructured":"Schwarz, M., Saan, S., Seidl, H., Erhard, J., Vojdani, V.: Clustered relational thread-modular abstract interpretation with local traces. In: Programming Languages and Systems, pp. 28\u201358. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30044-8_2","DOI":"10.1007\/978-3-031-30044-8_2"},{"issue":"9","key":"4_CR55","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1017\/s0960129521000499","volume":"31","author":"H Seidl","year":"2021","unstructured":"Seidl, H., Vogler, R.: Three improvements to the top-down solver. Math. Struct. Comput. Sci. 31(9), 1090\u20131134 (2021). https:\/\/doi.org\/10.1017\/s0960129521000499","journal-title":"Math. Struct. Comput. Sci."},{"key":"4_CR56","unstructured":"SoSy-Lab: YAML-based exchange format for correctness witnesses (2021). https:\/\/gitlab.com\/sosy-lab\/benchmarking\/sv-witnesses\/-\/blob\/main\/README-YAML.md"},{"key":"4_CR57","unstructured":"Strej\u010dek, J.: Issues related to the fact that the semantics of witnesses are defined over CFAs and the translation from C programs to CFAs is undefined (2022). https:\/\/gitlab.com\/sosy-lab\/benchmarking\/sv-witnesses\/-\/blob\/main\/GraphML_witness_format_issues.pdf"},{"key":"4_CR58","unstructured":"SV-COMP community: Community meeting (2023)"},{"key":"4_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-030-45190-5_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J \u0160vejda","year":"2020","unstructured":"\u0160vejda, J., Berger, P., Katoen, J.-P.: Interpretation-based violation witness validation for C: NITWIT. In: TACAS 2020. LNCS, vol. 12078, pp. 40\u201357. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45190-5_3"},{"key":"4_CR60","doi-asserted-by":"publisher","unstructured":"Vojdani, V., Apinis, K., R\u00f5tov, V., Seidl, H., Vene, V., Vogler, R.: Static race detection for device drivers: the Goblint approach. In: Proceedings of the 31st IEEE\/ACM International Conference on Automated Software Engineering. ACM (2016). https:\/\/doi.org\/10.1145\/2970276.2970337","DOI":"10.1145\/2970276.2970337"},{"key":"4_CR61","unstructured":"Ziat, G.: A combination of abstract interpretation and constraint programming. Theses, Sorbonne Universit\u00e9 (2019). https:\/\/theses.hal.science\/tel-03987752"}],"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-50524-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,3]],"date-time":"2024-01-03T00:10:50Z","timestamp":1704240650000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50524-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,30]]},"ISBN":["9783031505232","9783031505249"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50524-9_4","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)"}}]}}