Application-only call graph construction

Karim Ali, Ondřej Lhoták

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Since call graphs are an essential starting point for all inter-procedural analyses, many tools and frameworks have been developed to generate the call graph of a given program. The majority of these tools focus on generating the call graph of the whole program (i.e., both the application and the libraries that the application depends on). A popular compromise to the excessive cost of building a call graph for the whole program is to ignore all the effects of the library code and any calls the library makes back into the application. This results in potential unsoundness in the generated call graph and therefore in any analysis that uses it. In this paper, we present Cgc, a tool that generates a sound call graph for the application part of a program without analyzing the code of the library.

Original languageEnglish (US)
Title of host publicationECOOP 2012 - Object-Oriented Programming
Subtitle of host publication26th European Conference, Proceedings
PublisherSpringer Verlag
Number of pages25
ISBN (Print)9783642310560
StatePublished - 2012
Event26th European Conference on Object-Oriented Programming, ECOOP 2012 - Beijing, China
Duration: Jun 11 2012Jun 16 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7313 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other26th European Conference on Object-Oriented Programming, ECOOP 2012

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Application-only call graph construction'. Together they form a unique fingerprint.

Cite this