NDLI: Efficient alias set analysis using SSA form

Please wait, while we are loading the content...

Modeling, analysis and throughput optimization of a generational garbage collector

Garbage collection in the next C++ standard

Investigating the effects of using different nursery sizing policies on performance

Identification of logically related heap regions

Dynamic shape analysis via degree metrics

A new approach to parallelising tracing algorithms

Precise garbage collection for C

Placement optimization using data context collected during garbage collection

A component model of spatial locality

Live heap space analysis for languages with garbage collection

Scalable support for multithreaded applications on dynamic binary instrumentation systems

Self-recovery in server programs

Efficient alias set analysis using SSA form

Two memory allocators that use hints to improve locality

Parametric heap usage analysis for functional programs

Efficient alias set analysis using SSA form

Content Provider	ACM Digital Library
Author	Lhoták, Ondrej Naeem, Nomair A.
Abstract	Precise, flow-sensitive analyses of pointer relationships often represent each object using the set of local variables that point to it (the alias set), possibly augmented with additional predicates. Many such analyses are difficult to scale due to the size of the abstraction and due to flow sensitivity. The focus of this paper is on efficient representation and manipulation of the alias set. Taking advantage of certain properties of static single assignment (SSA) form, we propose an efficient data structure that allows much of the representations of sets at different points in the program to be shared. The transfer function for each statement, instead of creating an updated set, makes only local changes to the existing data structure representing the set. The key enabling properties of SSA form are that every point at which a variable is live is dominated by its definition, and that the definitions of any set of simultaneously live variables are totally ordered according to the dominance relation. We represent the variables pointing to an object using a list ordered consistently with the dominance relation. Thus, when a variable is newly defined to point to the object, it need only be added to the head of the list. A back edge at which some variables cease to be live requires only dropping variables from the head of the list. We prove that the analysis using the proposed data structure computes the same result as a set-based analysis. We empirically show that the proposed data structure is more efficient in both time and memory requirements than set implementations using hash tables and balanced trees.
Starting Page	79
Ending Page	88
Page Count	10
File Format	PDF
ISBN	9781605583471
DOI	10.1145/1542431.1542443
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2009-06-19
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Shape analysis Live variables Pointer analysis Dominance Static single assignment form Alias analysis Dataflow analysis
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

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