Name
Abstract | ||
|---|---|---|
With the increasing availability of source code on the Internet, many new approaches to retrieve, repair, and reuse code have emerged that rely on the ability to efficiently compute the similarity of two pieces of code. The meaning of similarity, however, heavily depends on the application domain. For predicting API calls, for example, programs can be considered similar if they call a specific set of functions in a similar way, while for automated bug fixing, it is important that similar programs share a similar data-flow. In this paper, we propose an algorithm to compute program similarity based on the Weisfeiler-Leman graph kernel. Our algorithm is able to operate on different graph-based representations of programs and thus can be applied in different domains. We show the usefulness of our approach in two experiments using data-flow similarity and API-call similarity. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-35122-3_21 | ICSR |
Field | DocType | Volume |
Graph kernel,Graph,Graph isomorphism,Java program,Source code,Computer science,Reuse,Theoretical computer science,Application domain,The Internet | Conference | 9679 |
ISSN | Citations | PageRank |
0302-9743 | 7 | 0.50 |
References | Authors | |
20 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenchao Li | 1 | 100 | 13.25 |
| Hassen Saidi | 2 | 11 | 1.67 |
| Huascar Sanchez | 3 | 30 | 4.08 |
| Martin Schäf | 4 | 135 | 14.71 |
| Pascal Schweitzer | 5 | 214 | 16.94 |