Automatic program debugging for intelligent tutoring systems
Automatic program debugging for intelligent tutoring systems
AI Magazine
Intention-based diagnosis of errors in novice programs
Intention-based diagnosis of errors in novice programs
Common LISP: the language
Automated program recognition by graph parsing
Automated program recognition by graph parsing
KBEmacs: A Step Toward the Programmer''s Apprentice
KBEmacs: A Step Toward the Programmer''s Apprentice
Program representation and behavioural matching for localizing similar code fragments
CASCON '93 Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1
The development of a partial design recovery environment for legacy systems
CASCON '93 Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1
Algorithm recognition by static analysis and its application in students' submissions assessment
Koli '08 Proceedings of the 8th International Conference on Computing Education Research
| Hi-index | 0.00 |
The author explores the issues involved with program recognition by reviewing in some detail three systems epitomizing current techniques in program recognition research: the Program Recognizer, Talus, and Proust. The Program Recognizer recognizes occurrences of stereotyped computational fragments in computer programs. Talus analyzes programs involving the recursive definition of data structures, permitting recursion on three data types: list, tree, and number. Proust is a program for debugging Pascal programs. The author concludes the most promising direction for future research would be to combine the best elements of all three programs.