A preparation guide for Java call graph comparison : finding a match for your methods

Pengő, Edit and Ságodi, Zoltán: A preparation guide for Java call graph comparison : finding a match for your methods. In: Acta cybernetica, (24) 1. pp. 131-155. (2019)

[img]
Preview
Cikk, tanulmány, mű
actacyb_24_1_2019_131_155.pdf

Download (523kB) | Preview

Abstract

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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2019
Volume: 24
Number: 1
ISSN: 0324-721X
Page Range: pp. 131-155
Publisher: University of Szeged, Institute of Informatics
Place of Publication: Szeged
Event Title: Conference of PhD students in computer science (11.) (2018) (Szeged)
DOI: https://doi.org/10.14232/actacyb.24.1.2019.10
Uncontrolled Keywords: Java, Programozás, Számítástechnika
Additional Information: Bibliogr.: p. 152-155. ; összefoglalás angol nyelven
Date Deposited: 2019. Jul. 17. 13:46
Last Modified: 2019. Jul. 17. 13:46
URI: http://acta.bibl.u-szeged.hu/id/eprint/59232

Actions (login required)

View Item View Item