kirancodes.me
To Proof Maintenance & Beyond!

Call graph construction for Java libraries

Michael Reif, Michael Eichberg, Ben Hermann, Johannes Lerch, Mira Mezini

Abstract

Today, every application uses software libraries. Yet, while a lot of research exists w.r.t. analyzing applications, research that targets the analysis of libraries independent of any application is scarce. This is unfortunate, because, for developers of libraries, such as the Java Development Kit (JDK), it is crucial to ensure that the library behaves as intended regardless of how it is used. To fill this gap, we discuss the construction of call graphs for libraries that abstract over all potential library usages. Call graphs are particularly relevant as they are a precursor of many advanced analyses, such as inter-procedural data-flow analyses.

BibTeX
@inproceedings{Reif-al:FSE16,
  author    = {Michael Reif and
               Michael Eichberg and
               Ben Hermann and
               Johannes Lerch and
               Mira Mezini},
  title     = {Call graph construction for Java libraries},
  booktitle = {FSE},
  pages     = {474--486},
  publisher = {{ACM}},
  year      = {2016},
}

Related papers