{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:54Z","timestamp":1761611274825},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540242970"},{"type":"electronic","value":"9783540305798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30579-8_29","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T16:45:34Z","timestamp":1292863534000},"page":"448-464","source":"Crossref","is-referenced-by-count":2,"title":["On the Complexity of Error Explanation"],"prefix":"10.1007","author":[{"given":"Nirman","family":"Kumar","sequence":"first","affiliation":[]},{"given":"Viraj","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Mahesh","family":"Viswanathan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","volume-title":"Model Checking","author":"E. Clarke","year":"2000","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (2000)"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Zeller, A.: Isolating cause-effect chains for computer programs. In: Proceedings of the ACM Symposium on the Foundations of Software Engineering, pp. 1\u201310 (2002)","DOI":"10.1145\/587051.587053"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1109\/32.988498","volume":"28","author":"A. Zeller","year":"2002","unstructured":"Zeller, A., Hildebrandt, R.: Simplifying and isolating failure-inducing input. IEEE Transactions on Software Engineering\u00a028, 183\u2013200 (2002)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","first-page":"445","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H. Jin","year":"2001","unstructured":"Jin, H., Ravi, K., Somenzi, F.: Fate and free will in error traces. In: TACAS 2001. LNCS, vol.\u00a02031, pp. 445\u2013459. Springer, Heidelberg (2001)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Renieris, M., Reiss, S.: Fault localization with nearest neighbor queries. In: Proceedings of the Conference on Automated Software Engineering (2003)","DOI":"10.1109\/ASE.2003.1240292"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Ball, T., Naik, M., Rajamani, S.: From symptom to cause: Localizing errors in counterexample traces. In: Proceedings of the ACM Symposium on the Principles of Programming Languages, pp. 97\u2013105 (2003)","DOI":"10.1145\/604131.604140"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Groce, A., Visser, W.: What went wrong: Explaining counterexamples. In: Proceedings of the SPIN Workshop on Model Checking of Software, pp. 121\u2013135 (2003)","DOI":"10.1007\/3-540-44829-2_8"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Groce, A.: Error explanation with distance metrics. In: Proceedings of Conference on Tools and Algorithms for Construction and Analysis of Systems, pp. 108\u2013122 (2004)","DOI":"10.1007\/978-3-540-24730-2_8"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Ball, T., Rajamani, S.K.: The SLAM project: Debugging system software via static analysis. In: Proceedings of the ACM Symposium on the Principles of Programming Languages, pp. 1\u20133 (2002)","DOI":"10.1145\/503272.503274"},{"key":"29_CR10","unstructured":"Brat, G., Havelund, K., Park, S., Visser, W.: Java PathFinder \u2013 A second generation of a Java model checker. In: Proceedings of the Workshop on Advances in Verification (2000)"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"556","DOI":"10.2307\/2025310","volume":"70","author":"D. Lewis","year":"1973","unstructured":"Lewis, D.: Causation. Journal of Philosophy\u00a070, 556\u2013567 (1973)","journal-title":"Journal of Philosophy"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Zeller, A.: Yesterday, my program worked. Today, is does not. Why? In: Proceedings of the ACM Symposium on the Foundations of Software Engineering, pp. 253\u2013267 (1999)","DOI":"10.1007\/3-540-48166-4_16"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/366378.366379","volume":"10","author":"F. Tip","year":"2001","unstructured":"Tip, F., Dinesh, T.B.: A slicing-based approach for locating type errors. ACM Transactions on Software Engineering and Methodology\u00a010, 5\u201355 (2001)","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/32.988495","volume":"28","author":"K. Bhargavan","year":"2002","unstructured":"Bhargavan, K., Gunter, C.A., Kim, M., Lee, I., Obradovic, D., Sokolsky, O., Viswanathan, M.: Verisim: Formal analysis of network simulations. IEEE: Transactions on Software Engineering\u00a028, 129\u2013145 (2002)","journal-title":"IEEE: Transactions on Software Engineering"},{"key":"29_CR15","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the ACM Symposium on the Theory of Computation (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: Proceedings of the ACM Symposium on the Principles of Programming Languages, pp. 49\u201361 (1995)","DOI":"10.1145\/199448.199462"},{"key":"29_CR18","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. McGraw-Hill Higher Education, New York (2001)"},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/138027.138042","volume":"40","author":"L. Pitt","year":"1993","unstructured":"Pitt, L., Warmuth, M.K.: The minimum consistent DFA problem cannot be approximated within any polynomial. Journal of the ACM\u00a040, 95\u2013142 (1993)","journal-title":"Journal of the ACM"},{"key":"29_CR20","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"E.L. Lawler","year":"1972","unstructured":"Lawler, E.L.: A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem. Management Science\u00a018, 401\u2013405 (1972)","journal-title":"Management Science"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30579-8_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:24:18Z","timestamp":1605759858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30579-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540242970","9783540305798"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30579-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}