DocumentCode :
2352776
Title :
Some experiments toward understanding how program plan recognition algorithms scale
Author :
Woods, Steven ; Quilici, Alex
Author_Institution :
Dept. of Comput. Sci., Waterloo Univ., Ont., Canada
fYear :
196
fDate :
8-10 Nov 196
Firstpage :
21
Lastpage :
30
Abstract :
Over the past decade, researchers in program understanding have formulated many program understanding algorithms but have published few studies of their relative scalability. Consequently, it is difficult to understand the relative limitations of these algorithms and to determine whether the field of program understanding is making progress. The paper attempts to address this deficiency by formalizing the search strategies of several different program understanding algorithms as constraint satisfaction problems, and by presenting some preliminary empirical scalability results for these constraint-based implementations. These initial results suggest that, at least under certain conditions, constraint-based program understanding is close to being applicable to real-world programs
Keywords :
reverse engineering; software engineering; constraint satisfaction problems; constraint-based program understanding; program plan recognition algorithms scalability; program understanding; search strategies; Algorithm design and analysis; Computer science; Heart; Libraries; Performance analysis; Proposals; Scalability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Reverse Engineering, 1996., Proceedings of the Third Working Conference on
Conference_Location :
Monterey, CA
Print_ISBN :
0-8186-7674-4
Type :
conf
DOI :
10.1109/WCRE.1996.558813
Filename :
558813
Link To Document :
بازگشت