Heuristic and Formal Methods in Automatic Program Debugging
Proceedings of the Ninth International Joint Conference on Artificial Intelligence. AI and Education. Pages 15-18.
Abstract
TALUS is an automatic program debugging system that both detects and corrects nonsyntactic bugs in stude nt programs written to solve small but nontrivial tasks in pure LISP. TALUS permits signifi cant variability in student solutions by using heuristic methods to recognize different algor ithm s and formal m e thods to reason about computational equivalence of p rog ram fragments. A theorem prover intensionally re presents an infinite database of rewrite rules, thus allowing for unanticipated implementations. TALUS detects bugs using formal methods in both symbolic eva] uation and case analysis. Heuristic methods conjec ture the exact location of bugs and alterations necessary to correct the bugs. Finally, formal methods es tablish or disprove these heuristic conjectures, reflecting a generate and test methodology.
@inproceedings{ijcai1985p3,
title = {Heuristic and Formal Methods in Automatic Program Debugging},
author = {Murray, William R.},
booktitle = {Proceedings of the Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-85}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Aravind Joshi},
pages = {15--18},
year = {1985},
note = {AI and Education},
url = {https://ijcai.org/proceedings/1985/3},
}
TY - CPAPER TI - Heuristic and Formal Methods in Automatic Program Debugging AU - Murray, William R. T2 - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85 PB - International Joint Conferences on Artificial Intelligence PY - 1985 SP - 15 EP - 18 UR - https://ijcai.org/proceedings/1985/3 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
