Name
Abstract | ||
|---|---|---|
In this paper, we have defined a static approach named DUM (Detecting Unreachable Methods) that works on Java byte-code and detects unreachable methods by traversing a graph-based representation of the software to be analyzed. To assess the validity of our approach, we have implemented it in a prototype software system. Both our approach and prototype have been validated on four open-source software. Results have shown the correctness, the completeness, and the accuracy of the methods that our solution detected as unreachable. We have also compared our solution with: JTombstone and Google CodePro AnalytiX. This comparison suggested that DUM outperforms baselines. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2851613.2851968 | SAC |
Field | DocType | Citations |
Graph,Programming language,Computer science,Correctness,Software system,Software,Software maintenance,Completeness (statistics),Java,Traverse | Conference | 2 |
PageRank | References | Authors |
0.38 | 7 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Simone Romano | 1 | 68 | 14.35 |
| Giuseppe Scanniello | 2 | 883 | 77.10 |
| Carlo Sartiani | 3 | 240 | 28.54 |
| Michele Risi | 4 | 403 | 40.98 |