A preparation guide for Java call graph comparison finding a match for your methods /
Call graphs provide a basis for numerous interprocedural analyzers and tools, therefore it is crucial how precisely they are constructed. Developers need to know the features of a call graph builder before applying it to subsequent algorithms. The characteristics of call graph builders are best unde...
Elmentve itt :
| Szerzők: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Cikk |
| Megjelent: |
University of Szeged, Institute of Informatics
Szeged
2019
|
| Sorozat: | Acta cybernetica
24 No. 1 |
| Kulcsszavak: | Java, Programozás, Számítástechnika |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.24.1.2019.10 |
| Online Access: | http://acta.bibl.u-szeged.hu/59232 |
| LEADER | 02062nab a2200253 i 4500 | ||
|---|---|---|---|
| 001 | acta59232 | ||
| 005 | 20220621091434.0 | ||
| 008 | 190717s2019 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 024 | 7 | |a 10.14232/actacyb.24.1.2019.10 |2 doi | |
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Pengő Edit | |
| 245 | 1 | 2 | |a A preparation guide for Java call graph comparison |h [elektronikus dokumentum] : |b finding a match for your methods / |c Pengő Edit |
| 260 | |a University of Szeged, Institute of Informatics |b Szeged |c 2019 | ||
| 300 | |a 131-155 | ||
| 490 | 0 | |a Acta cybernetica |v 24 No. 1 | |
| 520 | 3 | |a Call graphs provide a basis for numerous interprocedural analyzers and tools, therefore it is crucial how precisely they are constructed. Developers need to know the features of a call graph builder before applying it to subsequent algorithms. The characteristics of call graph builders are best understood by comparing the generated call graphs themselves. The comparison can be done by matching the corresponding nodes in each graph and then analyzing the found methods and calls. In this paper, we developed a process for pairing the nodes of multiple call graphs produced for the same source code. As the six static analyzers that we collected for call graph building handles Java language elements differently, it was necessary to refine the basic name-wise pairing mechanism in several steps. Two language elements, the anonymous and generic methods, needed extra consideration. We describe the steps of improvement and our final solution to achieve the best possible pairing we are able to provide, through the analysis of the Apache Commons-Math project. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Java, Programozás, Számítástechnika | ||
| 700 | 0 | 1 | |a Ságodi Zoltán |e aut |
| 710 | |a Conference of PhD students in computer science (11.) (2018) (Szeged) | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/59232/1/actacyb_24_1_2019_131_155.pdf |z Dokumentum-elérés |