NDLI: An improved bound for call strings based interprocedural analysis of bit vector frameworks

Content Provider	ACM Digital Library
Author	Khedker, Uday P. Karkare, Bageshri
Copyright Year	2007
Abstract	Interprocedural data flow analysis extends the scope of analysis across procedure boundaries in search of increased optimization opportunities. Call strings based approach is a general approach for performing flow and context sensitive interprocedural analysis. It maintains a history of calls along with the data flow information in the form of call strings, which are sequences of unfinished calls. Recursive programs may need infinite call strings for interprocedural data flow analysis. For bit vector frameworks this method is believed to require all call strings of lengths up to $3\textit{K},$ where $\textit{K}$ is the maximum number of distinct call sites in any call chain. We combine the nature of information flows in bit-vector data flow analysis with the structure of interprocedurally valid paths to bound the call strings. Instead of bounding the length of call strings, we bound the number of occurrences of any call site in a call string. We show that the call strings in which a call site appears at most three times, are sufficient for convergence on interprocedural maximum fixed point solution. Though this results in the same worst case length of call strings, it does not require constructing all call strings up to length $3\textit{K}.$ Our empirical measurements on recursive programs show that our bound reduces the lengths and the number of call strings, and hence the analysis time, significantly.
File Format	PDF
ISSN	01640925
e-ISSN	15584593
DOI	10.1145/1286821.1286829
Volume Number	29
Issue Number	6
Journal	ACM Transactions on Programming Languages and Systems (TOPLAS)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2007-10-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Bit Vector Data Flow Frameworks Interprocedural Data Flow Analysis
Content Type	Text
Resource Type	Article
Subject	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

Double iterative framework for flow-sensitive interprocedural data flow analysis

A generalized theory of bit vector data flow analysis

A practical framework for demand-driven interprocedural data flow analysis

A framework for call graph construction algorithms

An interval-based approach to exhaustive and incremental interprocedural data-flow analysis

Interprocedural control flow analysis of first-order programs with tail-call optimization

Interprocedural parallelization analysis in SUIF

Interprocedural static analysis of sequencing constraints

Interprocedural optimization: eliminating unnecessary recompilation

An improved bound for call strings based interprocedural analysis of bit vector frameworks

Similar Documents

Double iterative framework for flow-sensitive interprocedural data flow analysis

A generalized theory of bit vector data flow analysis

A practical framework for demand-driven interprocedural data flow analysis

A framework for call graph construction algorithms

An interval-based approach to exhaustive and incremental interprocedural data-flow analysis

Interprocedural control flow analysis of first-order programs with tail-call optimization

Interprocedural parallelization analysis in SUIF

Interprocedural static analysis of sequencing constraints

Interprocedural optimization: eliminating unnecessary recompilation

An improved bound for call strings based interprocedural analysis of bit vector frameworks