Who are you not gonna call? a definitive comparison of Java static call graph creator tools /
Call graphs are fundamental for advanced, interprocedural control flow and data flow analysis tasks. In dynamic languages like Java, which allows polymorphism and reflection constructing a static call graph can be complicated. A missing or imprecisely connected edge might misguide the following algo...
Elmentve itt :
| Szerzők: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Könyv része |
| Megjelent: |
2018
|
| Sorozat: | Conference of PhD Students in Computer Science
11 |
| Kulcsszavak: | Java - programnyelv, Számítástechnika, Programozás |
| Online Access: | http://acta.bibl.u-szeged.hu/61767 |
| LEADER | 01749naa a2200217 i 4500 | ||
|---|---|---|---|
| 001 | acta61767 | ||
| 005 | 20221108101825.0 | ||
| 008 | 191028s2018 hu o 1|| zxx d | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a zxx | ||
| 100 | 1 | |a Pengő Edit | |
| 245 | 1 | 0 | |a Who are you not gonna call? |h [elektronikus dokumentum] : |b a definitive comparison of Java static call graph creator tools / |c Pengő Edit |
| 260 | |c 2018 | ||
| 300 | |a 68-71 | ||
| 490 | 0 | |a Conference of PhD Students in Computer Science |v 11 | |
| 520 | 3 | |a Call graphs are fundamental for advanced, interprocedural control flow and data flow analysis tasks. In dynamic languages like Java, which allows polymorphism and reflection constructing a static call graph can be complicated. A missing or imprecisely connected edge might misguide the following algorithms causing errors in the overall analysis. In this paper, we have collected six static analyzer tools for Java and performed a qualitative comparison on the call graph they generate. As part of the comparison, we introduced a method for pairing different notations of the same functions. We evaluated the collected tools on three open-source Java projects and on a small example containing most of the relevant Java language features. The results revealed several language structures that were handled differently by the static analyzers, which led to a difference in the created call graphs as well. | |
| 695 | |a Java - programnyelv, Számítástechnika, Programozás | ||
| 700 | 0 | 1 | |a Ságodi Zoltán |e aut |
| 700 | 0 | 1 | |a Kóbor Ervin |e aut |
| 710 | |a Conference of PhD students in computer science (11.) (2018) (Szeged) | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/61767/1/cscs_2018_081-084.pdf |z Dokumentum-elérés |