JavaML: a markup language for Java source code
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
4th International Workshop on Adoption-Centric Software Engineering
Proceedings of the 26th International Conference on Software Engineering
JQuery: finding your way through tangled code
OOPSLA '04 Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Voronoi treemaps for the visualization of software metrics
SoftVis '05 Proceedings of the 2005 ACM symposium on Software visualization
Design and Implementation of an Extensible and Modifiable Refactoring Tool
IWPC '05 Proceedings of the 13th International Workshop on Program Comprehension
Ranking Significance of Software Components Based on Use Relations
IEEE Transactions on Software Engineering
Approximate Structural Context Matching: An Approach to Recommend Relevant Examples
IEEE Transactions on Software Engineering
ASTLOG: a language for examining abstract syntax trees
DSL'97 Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997
Sourcerer: mining and searching internet-scale software repositories
Data Mining and Knowledge Discovery
Efficient storage and fast querying of source code
Information Systems Frontiers
Hi-index | 0.00 |
Source code search goes far beyond simple textual search. One possibility of improving code search is the utilization of structural information in form of abstract syntax trees (ASTs). However, developers usually work with the textual representation of source code and, thus, have difficulties in expressing their queries as fragments of abstract syntax trees and in interpreting the results. This paper addresses assistance of query composition and search result visualization. Query formulation is considered to be an iterative process. After one query is run, the AST vertices neighbored to the result vertices are analyzed to propose refinement options for the next query. Search results are visualized in a tree view which aggregates all matches in a compact way instead of showing a small number of ranked matches.