NDLI: The ant and the grasshopper:fast and accurate pointer analysis for millions of lines of code

Content Provider	ACM Digital Library
Author	Hardekopf, Ben Lin, Calvin
Abstract	Pointer information is a prerequisite for most program analyses, and the quality of this information can greatly affect their precision and performance. Inclusion-based (i.e. Andersen-style) pointer analysis is an important point in the space of pointer analyses, offering a potential sweet-spot in the trade-off between precision and performance. However, current techniques for inclusion-based pointer analysis can have difficulties delivering on this potential. We introduce and evaluate two novel techniques for inclusion-based pointer analysis---one lazy, one $eager^{1}---that$ significantly improve upon the current state-of-the-art without impacting precision. These techniques focus on the problem of online cycle detection, a critical optimization for scaling such analyses. Using a suite of six open-source C programs, which range in size from 169K to 2.17M LOC, we compare our techniques against the three best inclusion-based analyses--described by Heintze and Tardieu [11], by Pearce et al. [21], and by Berndl et al. [4]. The combination of our two techniques results in an algorithm which is on average 3.2 xfaster than Heintze and Tardieu's algorithm, 6.4 xfaster than Pearce et al.'s algorithm, and 20.6 faster than Berndl et al.'s algorithm. We also investigate the use of different data structures to represent points-to sets, examining the impact on both performance and memory consumption. We compare a sparse-bitmap implementation used in the GCC compiler with a BDD-based implementation, and we find that the BDD implementation is on average 2x slower than using sparse bitmaps but uses 5.5x less memory.
Starting Page	290
Ending Page	299
Page Count	10
File Format	PDF
ISSN	03621340 15581160
DOI	10.1145/1273442.1250767
Journal	ACM SIGPLAN Notices (SIGP)
Volume Number	42
Issue Number	6
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1983-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Pointer analysis
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code

Dependence analysis for pointer variables

Pointer analysis for multithreaded programs

Semi-sparse flow-sensitive pointer analysis

Demand-driven pointer analysis

Pointer and escape analysis for multithreaded programs

Symbolic pointer analysis for detecting memory leaks

Experiments with combined analysis for pointer aliasing

Incrementalized pointer and escape analysis

The ant and the grasshopper:fast and accurate pointer analysis for millions of lines of code

Similar Documents

The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code

Dependence analysis for pointer variables

Pointer analysis for multithreaded programs

Semi-sparse flow-sensitive pointer analysis

Demand-driven pointer analysis

Pointer and escape analysis for multithreaded programs

Symbolic pointer analysis for detecting memory leaks

Experiments with combined analysis for pointer aliasing

Incrementalized pointer and escape analysis

The ant and the grasshopper:fast and accurate pointer analysis for millions of lines of code