An RSCL3 tutor for debugging Pascal programs
Stuart H. Rubin, Lilia Kennedy · 2002
A fundamental problem encountered in the implementation of computer programs is that of debugging. In particular, we address the question as to the best methodology for debugging Pascal programs. It is argued that this task is best suited to design automation, since the algorithmic languages, such as Pascal, can not embed the programmers intentions. The use of design automation implies a limited capability for program debugging in the current context. Ideally, this limited capability serves to educate the programmer, who in turn can extend this capability. This defines a tutoring system. The RSCL3 algorithm is used to amplify the knowledge of a rule-based system. That is, it extrapolates a basis set of rules through the use of domain symmetries. It is an inductive technique, which creates new knowledge that is open under deduction. It is expected that this technology will ultimately reduce the cost of expert system applications.>