Drabent, W., Nadjm-Tehrani, S., and Maluszynski, J. (1988). Algorithmic Debugging with Assertions. Technical Report LiTH-IDA-R-88-04, Department of Computer and Information Science, Linköping University, Sweden. Also in Proc. of META 88 - Workshop on Meta Programming in Logic Programming, Bristol, June 21-24, 1988. (bibtex),
Abstract: Algorithmic debugging, as presented by Shapiro, is an interactive process where the debugging system acquires knowledge about the expected behaviour of the debugged program and uses it to localize errors. This paper suggests a generalization of the language used to communicate with the debugger. In addition to the usual "yes" and "no" answers formal specifications of some properties of the intended model are allowed. The specifications are logic programs. They employ library procedures and are developed interactively in the debugging process. An experimental debugging system incorporating this idea has been implemented. In contrast to some other systems, its insufficiency diagnoser does not require instantiation of unsolved goals by the oracle. A formal proof of correctness and completeness of this algorithm is presented.
CS Dept TR Overview