A Hypothetical Monologue Illustrating the Knowledge Underlying Program Analysis
Author(s)
Shrobe, Howard E.; Waters, Richard C.; Sussman, Gerald J.
DownloadAIM-507.ps (8.347Mb)
Additional downloads
Metadata
Show full item recordAbstract
Automated Program Analysis is the process of discovering decompositions of a system into sub-units such that the behavior of the whole program can be inferred from the behavior of its parts. Analysis can be employed to increase the explanatory power of a program understanding system. We identify several techniques which are useful for automated program analysis. Chief among these is the identification and classification of the macro-scale units of programming knowledge which are characteristic of the problem domain. We call these plans. This paper presents a summary of how plans can be used in program analysis in the form of a hypothetical monologue. We also show a small catalogue of plans which are characteristic of AI programming. Finally, we present some techniques which facilitate plan recognition.
Date issued
1979-01-01Other identifiers
AIM-507
Series/Report no.
AIM-507