{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T07:27:21Z","timestamp":1750318041904,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,4,13]],"date-time":"2015-04-13T00:00:00Z","timestamp":1428883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["11-INSE-0004"],"award-info":[{"award-number":["11-INSE-0004"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,4,13]]},"DOI":"10.1145\/2695664.2695822","type":"proceedings-article","created":{"date-parts":[[2015,7,20]],"date-time":"2015-07-20T19:10:09Z","timestamp":1437419409000},"page":"1773-1780","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["LocFaults"],"prefix":"10.1145","author":[{"given":"Mohammed","family":"Bekkouche","sequence":"first","affiliation":[{"name":"University of Nice--Sophia, Antipolis, Sophia Antipolis Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H\u00e9l\u00e8ne","family":"Collavizza","sequence":"additional","affiliation":[{"name":"University of Nice--Sophia, Antipolis, Sophia Antipolis Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Rueher","sequence":"additional","affiliation":[{"name":"University of Nice--Sophia, Antipolis, Sophia Antipolis Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,4,13]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/604131.604140"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/1108792.1108813"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1007\/978-3-642-02658-4_11"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1080\/0952813021000026795"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1287\/ijoc.8.1.55"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1287\/ijoc.13.3.210.12632"},{"key":"e_1_3_2_1_7_1","volume-title":"Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods","author":"Chinneck J. W.","year":"2008","unstructured":"J. W. Chinneck . Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods . Springer , 2008 . J. W. Chinneck. Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods. Springer, 2008."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1007\/s10601-009-9089-9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1007\/s10009-012-0258-6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1017\/S0890060411000011"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1007\/11817963_33"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1016\/j.entcs.2006.12.032"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1007\/s10009-005-0202-0"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1007\/978-3-540-27813-9_35"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/1101908.1101949"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/581339.581397"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.5555\/2032305.2032345"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/1993498.1993550"},{"key":"e_1_3_2_1_19_1","first-page":"167","volume-title":"Proceedings of AAAI","author":"Junker U.","year":"2004","unstructured":"U. Junker . Quickxplain : Preferred explanations and relaxations for over-constrained problems . In Proceedings of AAAI , pages 167 -- 172 . AAAI Press \/ The MIT Press , 2004 . U. Junker. Quickxplain: Preferred explanations and relaxations for over-constrained problems. In Proceedings of AAAI, pages 167--172. AAAI Press \/ The MIT Press, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1007\/978-3-642-38171-3_11"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1007\/s10817-007-9084-z"},{"key":"e_1_3_2_1_22_1","volume-title":"Automated program debugging via multiple predicate switching","author":"Liu Y.","year":"2010","unstructured":"Y. Liu and B. Li . Automated program debugging via multiple predicate switching . In Proceedings of AAAI. AAAI Press , 2010 . Y. Liu and B. Li. Automated program debugging via multiple predicate switching. In Proceedings of AAAI. AAAI Press, 2010."},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. of IJCAI. IJCAI\/AAAI","author":"Marques-Silva J.","year":"2013","unstructured":"J. Marques-Silva , F. Heras , M. Janota , A. Previti , and A. Belov . On computing minimal correction subsets . In Proc. of IJCAI. IJCAI\/AAAI , 2013 . J. Marques-Silva, F. Heras, M. Janota, A. Previti, and A. Belov. On computing minimal correction subsets. In Proc. of IJCAI. IJCAI\/AAAI, 2013."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1109\/ASE.2003.1240292"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1023\/A:1009717821137"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1016\/0305-0548(95)00018-H"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1016\/j.jlap.2012.03.002"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1145\/1134285.1134324"}],"event":{"sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"acronym":"SAC 2015","name":"SAC 2015: Symposium on Applied Computing","location":"Salamanca Spain"},"container-title":["Proceedings of the 30th Annual ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2695664.2695822","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2695664.2695822","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:32Z","timestamp":1750227152000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2695664.2695822"}},"subtitle":["a new flow-driven and constraint-based error localization approach"],"short-title":[],"issued":{"date-parts":[[2015,4,13]]},"references-count":28,"alternative-id":["10.1145\/2695664.2695822","10.1145\/2695664"],"URL":"https:\/\/doi.org\/10.1145\/2695664.2695822","relation":{},"subject":[],"published":{"date-parts":[[2015,4,13]]},"assertion":[{"value":"2015-04-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}