Rapid Type Analysis (RTA) is an algorithm for call graph construction, which is known to be fast and to well approximate virtual method calls. In this paper, we explore its use in the context of refactoring, namely we defined an approach that relies on RTA for the detection of the dead method smell in Java code. We implemented this approach in a prototype of supporting tool we named Dead Code Finder (DCF). We empirically assessed DCF (and the underlying approach) through an experiment on four open-source Java desktop application. We compared DCF with three baseline tools. The results indicate that DCF outperforms these baselines in terms of accuracy of the detected dead methods.

Exploring the use of rapid type analysis for detecting the dead method smell in Java code

Romano S.;
2018-01-01

Abstract

Rapid Type Analysis (RTA) is an algorithm for call graph construction, which is known to be fast and to well approximate virtual method calls. In this paper, we explore its use in the context of refactoring, namely we defined an approach that relies on RTA for the detection of the dead method smell in Java code. We implemented this approach in a prototype of supporting tool we named Dead Code Finder (DCF). We empirically assessed DCF (and the underlying approach) through an experiment on four open-source Java desktop application. We compared DCF with three baseline tools. The results indicate that DCF outperforms these baselines in terms of accuracy of the detected dead methods.
2018
978-1-5386-7383-6
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11586/321464
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 8
  • ???jsp.display-item.citation.isi??? 4
social impact