A Hypothetical Monologue Illustrating the Knowledge Underlying Program Analysis

dc.creator	Shrobe, Howard E.
dc.creator	Waters, Richard C.
dc.creator	Sussman, Gerald J.
dc.date	2004-10-01T20:33:29Z
dc.date	2004-10-01T20:33:29Z
dc.date	1979-01-01
dc.date.accessioned	2013-10-09T02:41:02Z
dc.date.available	2013-10-09T02:41:02Z
dc.date.issued	2013-10-09
dc.identifier	AIM-507
dc.identifier	http://hdl.handle.net/1721.1/5741
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description	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.
dc.format	27 p.
dc.format	8752814 bytes
dc.format	6204211 bytes
dc.format	application/postscript
dc.format	application/pdf
dc.language	en_US
dc.relation	AIM-507
dc.title	A Hypothetical Monologue Illustrating the Knowledge Underlying Program Analysis

Files in this item

Files	Size	Format	View
There are no files associated with this item.