Model-based debugging or how to diagnose programs automatically

41Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe the extension of the well-known model-based diagnosis approach to the location of errors in imperative programs (exhibited on a subset of the Java language). The source program is automatically converted to a logical representation (called model). Given this model and a particular test case or set of test cases, a program-independent search algorithm determines a the minimal sets of statements whose incorrectness can explain incorrect outcomes when the program is executed on the test cases, and which can then be indicated to the developer by the system. We analyze example cases and discuss empirical results from a Java debugger implementation incorporating our approach. The use of AI techniques is more flexible than traditional debugging techniques such as algorithmic debugging and program slicing.

Cite

CITATION STYLE

APA

Wotawa, F., Stumptner, M., & Mayer, W. (2002). Model-based debugging or how to diagnose programs automatically. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2358, pp. 746–757). Springer Verlag. https://doi.org/10.1007/3-540-48035-8_72

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free