The Conceptual Calculus For Automatic Program Understanding
Proceedings of the Seventh International Joint Conference on Artificial Intelligence. Automatic Programming. Pages 992-996.
Abstract
The CAN system for automatic understanding of LISP programs is presented. When applied on a LISP progre~, CAN needs no assertion about what the program is intended to do. CAN's general task is to associate a meaning to a program, from which it is able to diagnose eemantic properties (unused portions of code, undefinitions, underused programs, classes of date for which evaluation of an expression never terminates), and to exhibit deep semantic properties. CAN's underlying theory is the conceptual calculus, based on the clausal form of predicate logic. It involves two main ideas - en induction principle specially adapted to program understanding (as opposed to program veriflcat ion). -An extension of unification to equation solving.
@inproceedings{ijcai1981p189,
title = {The Conceptual Calculus For Automatic Program Understanding},
author = {Goossens, Daniel},
booktitle = {Proceedings of the Seventh International Joint Conference on
Artificial Intelligence, {IJCAI-81}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Roger C. Schank},
pages = {992--996},
year = {1981},
month = {8},
note = {Automatic Programming},
url = {https://ijcai.org/proceedings/1981/189},
}
TY - CPAPER TI - The Conceptual Calculus For Automatic Program Understanding AU - Goossens, Daniel T2 - Proceedings of the Seventh International Joint Conference on Artificial Intelligence, IJCAI-81 PB - International Joint Conferences on Artificial Intelligence PY - 1981 SP - 992 EP - 996 UR - https://ijcai.org/proceedings/1981/189 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
