Application-only call graph construction

Karim Ali; Ondřej Lhoták

doi:10.1007/978-3-642-31057-7_30

Application-only call graph construction

Karim Ali, Ondřej Lhoták

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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 language	English (US)
Title of host publication	ECOOP 2012 - Object-Oriented Programming
Subtitle of host publication	26th European Conference, Proceedings
Publisher	Springer Verlag
Pages	688-712
Number of pages	25
ISBN (Print)	9783642310560
DOIs	https://doi.org/10.1007/978-3-642-31057-7_30
State	Published - 2012
Event	26th European Conference on Object-Oriented Programming, ECOOP 2012 - Beijing, China Duration: Jun 11 2012 → Jun 16 2012

Publication series

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

Other

Other	26th European Conference on Object-Oriented Programming, ECOOP 2012
Country/Territory	China
City	Beijing
Period	6/11/12 → 6/16/12

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-31057-7_30

Cite this

Ali, K., & Lhoták, O. (2012). Application-only call graph construction. In ECOOP 2012 - Object-Oriented Programming: 26th European Conference, Proceedings (pp. 688-712). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7313 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-31057-7_30

Application-only call graph construction. / Ali, Karim; Lhoták, Ondřej.
ECOOP 2012 - Object-Oriented Programming: 26th European Conference, Proceedings. Springer Verlag, 2012. p. 688-712 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7313 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Ali, K & Lhoták, O 2012, Application-only call graph construction. in ECOOP 2012 - Object-Oriented Programming: 26th European Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7313 LNCS, Springer Verlag, pp. 688-712, 26th European Conference on Object-Oriented Programming, ECOOP 2012, Beijing, China, 6/11/12. https://doi.org/10.1007/978-3-642-31057-7_30

@inproceedings{d76cda89e07b41c0b481c39e3caf2b17,

title = "Application-only call graph construction",

abstract = "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.",

author = "Karim Ali and Ond{\v r}ej Lhot{\'a}k",

year = "2012",

doi = "10.1007/978-3-642-31057-7_30",

language = "English (US)",

isbn = "9783642310560",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "688--712",

booktitle = "ECOOP 2012 - Object-Oriented Programming",

note = "26th European Conference on Object-Oriented Programming, ECOOP 2012 ; Conference date: 11-06-2012 Through 16-06-2012",

}

TY - GEN

T1 - Application-only call graph construction

AU - Ali, Karim

AU - Lhoták, Ondřej

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84879723448&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84879723448&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-31057-7_30

DO - 10.1007/978-3-642-31057-7_30

M3 - Conference contribution

AN - SCOPUS:84879723448

SN - 9783642310560

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 688

EP - 712

BT - ECOOP 2012 - Object-Oriented Programming

PB - Springer Verlag

T2 - 26th European Conference on Object-Oriented Programming, ECOOP 2012

Y2 - 11 June 2012 through 16 June 2012

ER -

Application-only call graph construction

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this