{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:12:22Z","timestamp":1725552742537},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749295"},{"type":"electronic","value":"9783540749301"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-74930-1_23","type":"book-chapter","created":{"date-parts":[[2010,4,24]],"date-time":"2010-04-24T05:08:48Z","timestamp":1272085728000},"page":"228-236","source":"Crossref","is-referenced-by-count":0,"title":["Converting Programs into Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Franz","family":"Wotawa","sequence":"first","affiliation":[]},{"given":"Mihai","family":"Nica","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"23_CR1_23","doi-asserted-by":"publisher","first-page":"1684","DOI":"10.1145\/197320.197331","volume":"16","author":"M Marc","year":"1994","unstructured":"Marc M. Brandis and H. M\u00f6ssenb\u00f6ck. Single-pass generation of static assignment form for structured languages. ACM TOPLAS, 16(6):1684\u20131698, 1994.","journal-title":"ACM TOPLAS"},{"key":"23_CR2_23","doi-asserted-by":"crossref","unstructured":"H. Collavizza and M. Rueher. Exploration of the capabilities of constraint programming for software verification. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 182\u2013196, Vienna, Austria, 2006.","DOI":"10.1007\/11691372_12"},{"issue":"4","key":"23_CR3_23","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"Cytron Ron","year":"1991","unstructured":"Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM TOPLAS, 13(4):451\u2013490, 1991.","journal-title":"ACM TOPLAS"},{"key":"23_CR4_23","unstructured":"Rina Dechter. Constraint Processing. Morgan Kaufmann, 2003."},{"key":"23_CR5_23","unstructured":"Yousri El Fattah and Rina Dechter. Diagnosing tree-decomposable circuits. In Proceedings 14th International Joint Conf. on Artificial Intelligence, pages 1742 \u2013 1748, 1995."},{"issue":"2","key":"23_CR6_23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0004-3702(99)00034-X","volume":"111","author":"Friedrich Gerhard","year":"1999","unstructured":"Gerhard Friedrich, Markus Stumptner, and Franz Wotawa. Model-based diagnosis of hardware designs. Artificial Intelligence, 111(2):3\u201339, July 1999.","journal-title":"Artificial Intelligence"},{"key":"23_CR7_23","doi-asserted-by":"crossref","unstructured":"Georg Gottlob, Nicola Leone, and Francesco Scarcello. On Tractable Queries and Constraints. In Proc. 12th International Conference on Database and Expert Systems Applications DEXA 2001, Florence, Italy, 1999.","DOI":"10.1007\/3-540-48309-8_1"},{"issue":"2","key":"23_CR8_23","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0004-3702(00)00078-3","volume":"124","author":"G. Gottlob","year":"2000","unstructured":"G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. Artificial Intelligence, 124(2):243\u2013282, 2000.","journal-title":"Artificial Intelligence"},{"key":"23_CR9_23","doi-asserted-by":"crossref","unstructured":"A. Griesmayer, R. Bloem, and B. Cook. Repair of boolean programs with an application to C. In Proc. 18th Conference on Computer Aided Verification (CAV\u201906), pages 358\u2013371, Seattle, Washington, USA, August 2006.","DOI":"10.1007\/11817963_33"},{"key":"23_CR10_23","unstructured":"Daniel Jackson. Software abstractions: logic, language, and analysis. MIT Press, 2006."},{"key":"23_CR11_23","first-page":"278","volume-title":"Fundamental Approaches to Software Engineering (FASE\u201906)","author":"K\u00f6b Daniel","year":"2006","unstructured":"Daniel K\u00f6b and Franz Wotawa. Fundamentals of debugging using a resolution calculus. In Luciano Baresi and Reiko Heckel, editors, Fundamental Approaches to Software Engineering (FASE\u201906), volume 3922 of Lecture Notes in Computer Science, pages 278\u2013292, Vienna, Austria, March 2006. Springer."},{"key":"23_CR12_23","unstructured":"Cristinel Mateis, Markus Stumptner, and Franz Wotawa. Modeling Java Programs for Diagnosis. In Proceedings of the European Conference on Artificial Intelligence (ECAI), Berlin, Germany, August 2000."},{"key":"23_CR13_23","unstructured":"Wolfgang Mayer, Markus Stumptner, Dominik Wieland, and Franz Wotawa. Can ai help to improve debugging substantially? debugging experiences with value-based models. In Proceedings of the European Conference on Artificial Intelligence, pages 417\u2013421, Lyon, France, 2002."},{"issue":"1","key":"23_CR14_23","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"Reiter Raymond","year":"1987","unstructured":"14. Raymond Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32(1):57\u201395, 1987.","journal-title":"Artificial Intelligence"},{"key":"23_CR15_23","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/11560548_6","volume-title":"Proc. 13th Conference on Correct Hardware Design and Verification Methods","author":"S. Staber","year":"2005","unstructured":"S. Staber, B. Jobstmann, and R. Bloem. Finding and fixing faults. In Proc. 13th Conference on Correct Hardware Design and Verification Methods, pages 35\u201349. Springer-Verlag, 2005. LNCS 3725."},{"key":"23_CR16_23","unstructured":"Markus Stumptner and Franz Wotawa. Debugging Functional Programs. In Proceedings 16th International Joint Conf. on Artificial Intelligence, pages 1074\u2013 1079, Stockholm, Sweden, August 1999."},{"issue":"1","key":"23_CR17_23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(01)00054-6","volume":"127","author":"Stumptner Markus","year":"2001","unstructured":"Markus Stumptner and Franz Wotawa. Diagnosing tree-structured systems. Artificial Intelligence, 127(1):1\u201329, 2001.","journal-title":"Artificial Intelligence"},{"key":"23_CR18_23","unstructured":"M. Stumptner and F. Wotawa. Coupling CSP decomposition methods and diagnosis algorithms for tree-structured systems. In Proc. 18th International Joint Conf. on Artificial Intelligence, pages 388\u2013393, Acapulco, Mexico, 2003."},{"key":"23_CR19_23","doi-asserted-by":"crossref","unstructured":"M.N. Wegman and F.K. Zadek. Constant propagation with conditional branches. ACM Transactions on Programming Languages and Systems, 13(2), April 1991.","DOI":"10.1145\/103135.103136"}],"container-title":["Studies in Computational Intelligence","Advances in Intelligent and Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74930-1_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:47:25Z","timestamp":1619520445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74930-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540749295","9783540749301"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74930-1_23","relation":{},"ISSN":["1860-949X"],"issn-type":[{"type":"print","value":"1860-949X"}],"subject":[],"published":{"date-parts":[[2008]]}}}