A Hypothetical Monologue Illustrating the Knowledge Underlying Program Analysis
dc.contributor.author | Shrobe, Howard E. | en_US |
dc.contributor.author | Waters, Richard C. | en_US |
dc.contributor.author | Sussman, Gerald J. | en_US |
dc.date.accessioned | 2004-10-01T20:33:29Z | |
dc.date.available | 2004-10-01T20:33:29Z | |
dc.date.issued | 1979-01-01 | en_US |
dc.identifier.other | AIM-507 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/5741 | |
dc.description.abstract | 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. | en_US |
dc.format.extent | 27 p. | en_US |
dc.format.extent | 8752814 bytes | |
dc.format.extent | 6204211 bytes | |
dc.format.mimetype | application/postscript | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en_US | |
dc.relation.ispartofseries | AIM-507 | en_US |
dc.title | A Hypothetical Monologue Illustrating the Knowledge Underlying Program Analysis | en_US |