{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T09:56:18Z","timestamp":1756893378334,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031442445"},{"type":"electronic","value":"9783031442452"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-44245-2_10","type":"book-chapter","created":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T15:02:30Z","timestamp":1698073350000},"page":"190-211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Error Invariants for\u00a0Fault Localization via\u00a0Abstract Interpretation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3601-2631","authenticated-orcid":false,"given":"Aleksandar S.","family":"Dimovski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,24]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Bourdoncle, F.: Abstract debugging of higher-order imperative languages. In: Proceedings of the ACM SIGPLAN 1993 Conference on Programming Language Design and Implementation (PLDI), pp. 46\u201355. ACM (1993). https:\/\/doi.org\/10.1145\/155090.155095","DOI":"10.1145\/155090.155095"},{"issue":"8","key":"10_CR2","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986). https:\/\/doi.org\/10.1109\/TC.1986.1676819","journal-title":"IEEE Trans. Comput."},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-662-48288-9_3","volume-title":"Static Analysis","author":"J Chen","year":"2015","unstructured":"Chen, J., Cousot, P.: A binary decision tree abstract domain functor. In: Blazy, S., Jensen, T. (eds.) SAS 2015. LNCS, vol. 9291, pp. 36\u201353. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48288-9_3"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-35873-9_13","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"J Christ","year":"2013","unstructured":"Christ, J., Ermis, E., Sch\u00e4f, M., Wies, T.: Flow-sensitive fault localization. In: Giacobazzi, R., Berdine, J., Mastroeni, I. (eds.) VMCAI 2013. LNCS, vol. 7737, pp. 189\u2013208. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35873-9_13"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-030-17462-0_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Christakis","year":"2019","unstructured":"Christakis, M., Heizmann, M., Mansur, M.N., Schilling, C., W\u00fcstholz, V.: Semantic fault localization and suspiciousness ranking. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019, Part I. LNCS, vol. 11427, pp. 226\u2013243. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17462-0_13"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-24730-2_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Clarke","year":"2004","unstructured":"Clarke, E., Kroening, D., Lerda, F.: A tool for checking ANSI-C programs. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 168\u2013176. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24730-2_15"},{"key":"10_CR7","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: Conference Record of the Fourth ACM Symposium on POPL, pp. 238\u2013252. ACM (1977). https:\/\/doi.org\/10.1145\/512950.512973, http:\/\/doi.acm.org\/10.1145\/512950.512973","DOI":"10.1145\/512950.512973"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-31987-0_3","volume-title":"Programming Languages and Systems","author":"P Cousot","year":"2005","unstructured":"Cousot, P., et al.: The ASTRE\u00c9 analyzer. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 21\u201330. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31987-0_3"},{"issue":"3","key":"10_CR9","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\u00c9E scale up? Formal Methods Syst. Design 35(3), 229\u2013264 (2009). https:\/\/doi.org\/10.1007\/s10703-009-0089-6","journal-title":"Formal Methods Syst. Design"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-13754-9_5","volume-title":"Time for Verification","author":"P Cousot","year":"2010","unstructured":"Cousot, P., Cousot, R., Mauborgne, L.: A scalable segmented decision tree abstract domain. In: Manna, Z., Peled, D.A. (eds.) Time for Verification. LNCS, vol. 6200, pp. 72\u201395. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13754-9_5"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"101032","DOI":"10.1016\/j.cola.2021.101032","volume":"63","author":"AS Dimovski","year":"2021","unstructured":"Dimovski, A.S.: A binary decision diagram lifted domain for analyzing program families. J. Comput. Lang. 63, 101032 (2021). https:\/\/doi.org\/10.1016\/j.cola.2021.101032","journal-title":"J. Comput. Lang."},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Dimovski, A.S.: Lifted termination analysis by abstract interpretation and its applications. In: GPCE 2021: Concepts and Experiences, Chicago, IL, USA, October 2021, pp. 96\u2013109. ACM (2021). https:\/\/doi.org\/10.1145\/3486609.3487202","DOI":"10.1145\/3486609.3487202"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-030-99429-7_6","volume-title":"Fundamental Approaches to Software Engineering","author":"AS Dimovski","year":"2022","unstructured":"Dimovski, A.S.: Quantitative program sketching using lifted static analysis. In: FASE 2022. LNCS, vol. 13241, pp. 102\u2013122. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99429-7_6"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Dimovski, A.S.: Artifact for the paper \u201cerror invariants for fault localization via abstract interpretation\u201d. Zenodo (2023). https:\/\/doi.org\/10.5281\/zenodo.8167960","DOI":"10.5281\/zenodo.8167960"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"101206","DOI":"10.1016\/j.cola.2023.101206","volume":"75","author":"AS Dimovski","year":"2023","unstructured":"Dimovski, A.S.: Quantitative program sketching using decision tree-based lifted analysis. J. Comput. Lang. 75, 101206 (2023). https:\/\/doi.org\/10.1016\/j.cola.2023.101206","journal-title":"J. Comput. Lang."},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Dimovski, A.S., Apel, S.: Lifted static analysis of dynamic program families by abstract interpretation. In: 35th European Conference on Object-Oriented Programming, ECOOP 2021. LIPIcs, vol. 194, pp. 14:1\u201314:28. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ECOOP.2021.14","DOI":"10.4230\/LIPIcs.ECOOP.2021.14"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-030-76384-8_7","volume-title":"NASA Formal Methods","author":"AS Dimovski","year":"2021","unstructured":"Dimovski, A.S., Apel, S., Legay, A.: Program sketching using lifted analysis for numerical program families. In: Dutle, A., Moscato, M.M., Titolo, L., Mu\u00f1oz, C.A., Perez, I. (eds.) NFM 2021. LNCS, vol. 12673, pp. 95\u2013112. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76384-8_7"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"102725","DOI":"10.1016\/j.scico.2021.102725","volume":"213","author":"AS Dimovski","year":"2022","unstructured":"Dimovski, A.S., Apel, S., Legay, A.: Several lifted abstract domains for static analysis of numerical program families. Sci. Comput. Program. 213, 102725 (2022). https:\/\/doi.org\/10.1016\/j.scico.2021.102725","journal-title":"Sci. Comput. Program."},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-030-45234-6_9","volume-title":"Fundamental Approaches to Software Engineering","author":"AS Dimovski","year":"2020","unstructured":"Dimovski, A.S., Legay, A.: Computing program reliability using forward-backward precondition analysis and model counting. In: FASE 2020. LNCS, vol. 12076, pp. 182\u2013202. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45234-6_9"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-32759-9_17","volume-title":"FM 2012: Formal Methods","author":"E Ermis","year":"2012","unstructured":"Ermis, E., Sch\u00e4f, M., Wies, T.: Error invariants. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 187\u2013201. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_17"},{"issue":"2","key":"10_CR21","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1145\/367008.367020","volume":"10","author":"TL Graves","year":"2001","unstructured":"Graves, T.L., Harrold, M.J., Kim, J., Porter, A.A., Rothermel, G.: An empirical study of regression test selection techiques. ACM Trans. Softw. Eng. Methodol. 10(2), 184\u2013208 (2001). https:\/\/doi.org\/10.1145\/367008.367020","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-662-54580-5_31","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Greitschus","year":"2017","unstructured":"Greitschus, M., Dietsch, D., Heizmann, M., Nutz, A., Sch\u00e4tzle, C., Schilling, C., Sch\u00fcssele, F., Podelski, A.: Ultimate taipan: trace abstraction and abstract interpretation. In: Legay, A., Margaria, T. (eds.) TACAS 2017, Part II. LNCS, vol. 10206, pp. 399\u2013403. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54580-5_31"},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Harris, W.R., Sankaranarayanan, S., Ivancic, F., Gupta, A.: Program analysis via satisfiability modulo path programs. In: Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Madrid, Spain, 17\u201323 January 2010, pp. 71\u201382. ACM (2010). https:\/\/doi.org\/10.1145\/1706299.1706309","DOI":"10.1145\/1706299.1706309"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Jeannet, B.: Relational interprocedural verification of concurrent programs. In: Seventh IEEE International Conference on Software Engineering and Formal Methods, SEFM 2009, pp. 83\u201392. IEEE Computer Society (2009). https:\/\/doi.org\/10.1109\/SEFM.2009.29","DOI":"10.1109\/SEFM.2009.29"},{"key":"10_CR25","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":"10_CR26","doi-asserted-by":"publisher","unstructured":"Jose, M., Majumdar, R.: Cause clue clauses: error localization using maximum satisfiability. In: Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2011, pp. 437\u2013446. ACM (2011). https:\/\/doi.org\/10.1145\/1993498.1993550","DOI":"10.1145\/1993498.1993550"},{"issue":"7","key":"10_CR27","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). https:\/\/doi.org\/10.1145\/360248.360252","journal-title":"Commun. ACM"},{"key":"10_CR28","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.scico.2013.09.014","volume":"93","author":"A Min\u00e9","year":"2014","unstructured":"Min\u00e9, A.: Backward under-approximations in numeric abstract domains to automatically infer sufficient program conditions. Sci. Comput. Program. 93, 154\u2013182 (2014). https:\/\/doi.org\/10.1016\/j.scico.2013.09.014","journal-title":"Sci. Comput. Program."},{"issue":"3\u20134","key":"10_CR29","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1561\/2500000034","volume":"4","author":"A Min\u00e9","year":"2017","unstructured":"Min\u00e9, A.: Tutorial on static inference of numeric invariants by abstract interpretation. Found. Trends Program. Lang. 4(3\u20134), 120\u2013372 (2017). https:\/\/doi.org\/10.1561\/2500000034","journal-title":"Found. Trends Program. Lang."},{"key":"10_CR30","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":"10_CR31","doi-asserted-by":"publisher","unstructured":"Nguyen, H.D.T., Qi, D., Roychoudhury, A., Chandra, S.: SemFix: program repair via semantic analysis. In: 35th International Conference on Software Engineering, ICSE 2013, pp. 772\u2013781. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/ICSE.2013.6606623","DOI":"10.1109\/ICSE.2013.6606623"},{"key":"10_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/11547662_21","volume-title":"Static Analysis","author":"X Rival","year":"2005","unstructured":"Rival, X.: Understanding the origin of alarms in ASTR\u00c9E. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 303\u2013319. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11547662_21"},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1007\/978-3-030-53291-8_33","volume-title":"Computer Aided Verification","author":"B-C Rothenberg","year":"2020","unstructured":"Rothenberg, B.-C., Grumberg, O.: Must fault localization for program repair. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020, Part II. LNCS, vol. 12225, pp. 658\u2013680. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_33"},{"issue":"5\u20136","key":"10_CR34","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10009-012-0249-7","volume":"15","author":"A Solar-Lezama","year":"2013","unstructured":"Solar-Lezama, A.: Program sketching. STTT 15(5\u20136), 475\u2013495 (2013). https:\/\/doi.org\/10.1007\/s10009-012-0249-7","journal-title":"STTT"},{"key":"10_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-319-10936-7_19","volume-title":"Static Analysis","author":"C Urban","year":"2014","unstructured":"Urban, C., Min\u00e9, A.: A decision tree abstract domain for proving conditional termination. In: M\u00fcller-Olm, M., Seidl, H. (eds.) SAS 2014. LNCS, vol. 8723, pp. 302\u2013318. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10936-7_19"},{"key":"10_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-030-32304-2_13","volume-title":"Static Analysis","author":"B Yin","year":"2019","unstructured":"Yin, B., Chen, L., Liu, J., Wang, J., Cousot, P.: Verifying numerical programs via iterative abstract testing. In: Chang, B.-Y.E. (ed.) SAS 2019. LNCS, vol. 11822, pp. 247\u2013267. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32304-2_13"}],"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-44245-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,8]],"date-time":"2024-02-08T08:14:40Z","timestamp":1707380080000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44245-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031442445","9783031442452"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44245-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 October 2023","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":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sas2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/sas-2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}