NDLI: A generic worklist algorithm for graph reachability problems in program analysis

Content Provider	IEEE Xplore Digital Library
Author	Rayside, D. Kontogiannis, K.
Copyright Year	2002
Description	Author affiliation: Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada (Rayside, D.)
Abstract	Many program analyses involve, or can be expressed in terms of, a graph reachability problem. We present a generic worklist-style algorithm capable of expressing and solving the graph reachability components of many such analyses. We compare our framework with the language reachability framework proposed by Thomas Reps. (1998), and show that some problems are expressible in both frameworks, and some problems can be expressed in only one of the frameworks. Our two main case studies are Choi et al.'s escape analysis and Bacon-Sweeney's rapid type analysis. The reachability problems in these analyses can be directly expressed in the framework of our algorithm, but not in the language reachability framework. We discuss why this is the case, but important future work remains to formally characterize the kinds of problems that are amenable to our approach. The paper also summarizes our experimental work with an implementation of RTA based on our generic algorithm.
Sponsorship	IEEE Comput. Soc. Tech. Council on Software Eng.(TCSE)
Starting Page	67
Ending Page	76
File Size	390589
Page Count	10
File Format	PDF
ISBN	0769514383
ISSN	15345351
DOI	10.1109/CSMR.2002.995791
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2002-03-13
Publisher Place	Hungary
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Data analysis Formal languages Software algorithms Software maintenance
Content Type	Text
Resource Type	Article

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

A Generic Worklist Algorithm for Graph Reachability Problems in Program Analysis (2001)

A Generic Worklist Algorithm for Graph Reachability Problems in Program Analysis (2002)

A Generic Worklist Algorithm for Graph Reachability Problems in Program Analysis

A Generic Worklist Algorithm for Graph Reachability Problems in Program Analysis (2001)

A formal method for program slicing

Flow analysis models for interprocedural program slicing algorithms abstract (1999).

Formal Derivation of a Generic Algorithmic Program for Solving a Class of Extremum Problems

A Formal Derivation of Grover's Quantum Search Algorithm

Formal verification of dead code elimination in Isabelle/HOL

A generic worklist algorithm for graph reachability problems in program analysis

Similar Documents

A Generic Worklist Algorithm for Graph Reachability Problems in Program Analysis (2001)

A Generic Worklist Algorithm for Graph Reachability Problems in Program Analysis (2002)

A Generic Worklist Algorithm for Graph Reachability Problems in Program Analysis

A Generic Worklist Algorithm for Graph Reachability Problems in Program Analysis (2001)

A formal method for program slicing

Flow analysis models for interprocedural program slicing algorithms abstract (1999).

Formal Derivation of a Generic Algorithmic Program for Solving a Class of Extremum Problems

A Formal Derivation of Grover's Quantum Search Algorithm

Formal verification of dead code elimination in Isabelle/HOL

A generic worklist algorithm for graph reachability problems in program analysis