DocumentCode
251863
Title
An algorithm for keyword search on an execution path
Author
Kamiya, Toshio
Author_Institution
Dept. of Media Archit., Future Univ., Hakodate, Japan
fYear
2014
fDate
3-6 Feb. 2014
Firstpage
328
Lastpage
332
Abstract
This paper presents a code-search method, which includes an algorithm of keyword code-search and a prototype implementation. In this paper, a query is a set of keywords and a search result is a set of execution paths fulfilling the query, that is, each of the execution paths includes all of the keywords. Here, an execution path represents one of all levels of method calls of all possible dynamic dispatches in an OO program; thus, many execution paths can be generated even from a small program. The algorithm works on a data structure named an And/Or/Call graph, which is a compact representation of execution paths. The prototype implementation searches names of methods or types, or words in string literals from Java source code.
Keywords
directed graphs; object-oriented programming; query processing; Java source code; OO program; and-or-call graph; code-search method; data structure; execution path; keyword code-search algorithm; object-oriented program; query; search result; Couplings; Data structures; Indexing; Java; Prototypes; Receivers; Software;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Maintenance, Reengineering and Reverse Engineering (CSMR-WCRE), 2014 Software Evolution Week - IEEE Conference on
Conference_Location
Antwerp
Type
conf
DOI
10.1109/CSMR-WCRE.2014.6747187
Filename
6747187
Link To Document