On the Recall of Static Call Graph Construction in Practice.
Saved in:
| Title: | On the Recall of Static Call Graph Construction in Practice. |
|---|---|
| Authors: | Li Sui1 l.sui@massey.ac.nz, Dietrich, Jens2 jens.dietrich@vuw.ac.nz, Tahir, Amjed1 a.tahir@massey.ac.nz, Fourtounis, George3 gfour@di.uoa.gr |
| Source: | ICSE: International Conference on Software Engineering. 6/17/2020, p1049-1060. 12p. |
| Subjects: | Dylan (Computer program language), Java programming language, Computer programming, Software engineering, Artificial intelligence |
| Abstract: | Static analyses have problems modelling dynamic language features soundly while retaining acceptable precision. The problem is wellunderstood in theory, but there is little evidence on howthis impacts the analysis of real-world programs. We have studied this issue for call graph construction on a set of 31 real-world Java programs using an oracle of actual program behaviour recorded from executions of built-in and synthesised test cases with high coverage, have measured the recall that is being achieved by various static analysis algorithms and configurations, and investigated which language features lead to static analysis false negatives. We report that (1) the median recall is 0.884 suggesting that standard static analyses have significant gaps with respect to the proportion of the program modelled (2) built-in tests are significantly better to expose dynamic program behaviour than synthesised tests (3) adding precision to the static analysis has little impact on recall indicating that those are separate concerns (4) state-of-the-art support for dynamic language features can significantly improve recall (the median observed is 0.935 ), but it comes with a hefty performance penalty, and (5) the main sources of unsoundness are not reflective method invocations, but objects allocated or accessed via native methods, and invocations initiated by the JVM, without matching call sites in the program under analysis. These results provide some novel insights into the interaction between static and dynamic program analyses that can be used to assess the utility of static analysis results and to guide the development of future static and hybrid analyses. [ABSTRACT FROM AUTHOR] |
| Copyright of ICSE: International Conference on Software Engineering is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 155540328 AccessLevel: 6 PubType: Conference PubTypeId: conference PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: On the Recall of Static Call Graph Construction in Practice. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Li+Sui%22">Li Sui</searchLink><relatesTo>1</relatesTo><i> l.sui@massey.ac.nz</i><br /><searchLink fieldCode="AR" term="%22Dietrich%2C+Jens%22">Dietrich, Jens</searchLink><relatesTo>2</relatesTo><i> jens.dietrich@vuw.ac.nz</i><br /><searchLink fieldCode="AR" term="%22Tahir%2C+Amjed%22">Tahir, Amjed</searchLink><relatesTo>1</relatesTo><i> a.tahir@massey.ac.nz</i><br /><searchLink fieldCode="AR" term="%22Fourtounis%2C+George%22">Fourtounis, George</searchLink><relatesTo>3</relatesTo><i> gfour@di.uoa.gr</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22ICSE%3A+International+Conference+on+Software+Engineering%22">ICSE: International Conference on Software Engineering</searchLink>. 6/17/2020, p1049-1060. 12p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Dylan+%28Computer+program+language%29%22">Dylan (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22Java+programming+language%22">Java programming language</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programming%22">Computer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Software+engineering%22">Software engineering</searchLink><br /><searchLink fieldCode="DE" term="%22Artificial+intelligence%22">Artificial intelligence</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Static analyses have problems modelling dynamic language features soundly while retaining acceptable precision. The problem is wellunderstood in theory, but there is little evidence on howthis impacts the analysis of real-world programs. We have studied this issue for call graph construction on a set of 31 real-world Java programs using an oracle of actual program behaviour recorded from executions of built-in and synthesised test cases with high coverage, have measured the recall that is being achieved by various static analysis algorithms and configurations, and investigated which language features lead to static analysis false negatives. We report that (1) the median recall is 0.884 suggesting that standard static analyses have significant gaps with respect to the proportion of the program modelled (2) built-in tests are significantly better to expose dynamic program behaviour than synthesised tests (3) adding precision to the static analysis has little impact on recall indicating that those are separate concerns (4) state-of-the-art support for dynamic language features can significantly improve recall (the median observed is 0.935 ), but it comes with a hefty performance penalty, and (5) the main sources of unsoundness are not reflective method invocations, but objects allocated or accessed via native methods, and invocations initiated by the JVM, without matching call sites in the program under analysis. These results provide some novel insights into the interaction between static and dynamic program analyses that can be used to assess the utility of static analysis results and to guide the development of future static and hybrid analyses. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of ICSE: International Conference on Software Engineering is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=155540328 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1145/3377811.3380441 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 12 StartPage: 1049 Subjects: – SubjectFull: Dylan (Computer program language) Type: general – SubjectFull: Java programming language Type: general – SubjectFull: Computer programming Type: general – SubjectFull: Software engineering Type: general – SubjectFull: Artificial intelligence Type: general Titles: – TitleFull: On the Recall of Static Call Graph Construction in Practice. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Li Sui – PersonEntity: Name: NameFull: Dietrich, Jens – PersonEntity: Name: NameFull: Tahir, Amjed – PersonEntity: Name: NameFull: Fourtounis, George IsPartOfRelationships: – BibEntity: Dates: – D: 17 M: 06 Text: 6/17/2020 Type: published Y: 2020 Titles: – TitleFull: ICSE: International Conference on Software Engineering Type: main |
| ResultId | 1 |
