NDLI: Is continuation-passing useful for data flow analysis?

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

Is continuation-passing useful for data flow analysis?

Separate compilation for Standard ML

Lazy functional state threads

VLIW compilation techniques in a superscalar environment

Link-time optimization of address calculation on a 64-bit architecture

Division by invariant integers using multiplication

Precise compile-time performance prediction for superscalar-based computers

Accurate static estimators for program optimization

Improving semi-static branch prediction by code replication

GIVE-N-TAKE—a balanced code placement framework

Counting solutions to Presburger formulas: how and why

Parallelizing complex scans and reductions

Partial dead code elimination

Effective partial redundancy elimination

The program structure tree: computing control regions in linear time

Memory access coalescing: a technique for eliminating redundant memory accesses

ATOM: a system for building customized program analysis tools

Cache performance of garbage-collected programs

A general data dependence test for dynamic, pointer-based data structures

Interprocedural may-alias analysis for pointers: beyond k-limiting

Context-sensitive interprocedural points-to analysis in the presence of function pointers

Zero-cost range splitting

Debugging of globally optimized programs using data flow analysis

Efficient detection of all pointer and array access errors

On slicing programs with jump statements

Optimal tracing and incremental reexecution for debugging long-running programs

Optimizing dynamically-dispatched calls with run-time type feedback

Type analysis of Prolog using type graphs

Backtracking without trailing in CLP $(R_{Lin})$

Is continuation-passing useful for data flow analysis?

Content Provider	ACM Digital Library
Author	Felleisen, Matthias Sabry, Amr
Abstract	The widespread use of the continuation-passing style (CPS) transformation in compilers, optimizers, abstract interpreters, and partial evaluators reflects a common belief that the transformation has a positive effect on the analysis of programs. Investigations by Nielson [13] and Burn/Filho [5,6] support, to some degree, this belief with theoretical results. However, they do not pinpoint the source of increased abstract information and do not explain the observation of many people that continuation-passing confuses some conventional data flow analyses.To study the impact of the CPS transformation on program analysis, we derive three canonical data flow analyzers for the core of an applicative higher-order programming language. The first analyzer is based on a direct semantics of the language, the second on a continuation-semantics of the language, and the last on the direct semantics of CPS terms. All analyzers compute the control flow graph of the source program and hence our results apply to a large class of data flow analyses. A comparison of the information gathered by our analyzers establishes the following points:1. The results of a direct analysis of a source program are incomparable to the results of an analysis of the equivalent CPS program. In other words, the translation of the source program to a CPS version may increase or decrease static information. The gain of information occurs in non-distributive analyses and is solely due to the duplication of the analysis of the continuation. The loss of information is due to the confusion of distinct procedure returns.2. The analyzer based on the continuation semantics produces more accurate results than both direct analyzers, but again only in non-distributive analyses due to the duplication of continuations along every execution path. However, when the analyzer explicitly accounts for looping constructs, the results of the semantic-CPS analysis are no longer computable.In view of these results, we argue that, in practice, a direct data flow analysis that relies on some amount of duplication would be as satisfactory as a CPS analysis.
Starting Page	1
Ending Page	12
Page Count	12
File Format	PDF
ISBN	089791662X
DOI	10.1145/178243.178244
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1994-08-01
Publisher Place	New York
Access Restriction	Subscribed
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

Is continuation-passing useful for data flow analysis?

Ordering multiple continuations on the stack

Continuation-based Transformations for Coordination Languages (1999)

Reuse of continuation-based control-flow abstractions

Pushdown flow analysis of first-class control

For a Better Support of Static Data Flow (0)

Communication-Passing Style for Coordination Languages (1997)

An implementation mechanism for tailorable exceptional flow

Continuation-passing, closure-passing style

Is continuation-passing useful for data flow analysis?

Similar Documents

Is continuation-passing useful for data flow analysis?

Ordering multiple continuations on the stack

Continuation-based Transformations for Coordination Languages (1999)

Reuse of continuation-based control-flow abstractions

Pushdown flow analysis of first-class control

For a Better Support of Static Data Flow (0)

Communication-Passing Style for Coordination Languages (1997)

An implementation mechanism for tailorable exceptional flow

Continuation-passing, closure-passing style

Is continuation-passing useful for data flow analysis?