(Enter summary)
Abstract: We show that a non-duplicating CPS transformation has no
e#ect on control-flow analysis and that it has a positive e#ect
on binding-time analysis: a monovariant control-flow analysis
yields equivalent results on a direct-style program and on
its CPS counterpart, and a monovariant binding-time analysis
yields more precise results on a CPS program than on
its direct-style counterpart. Our proof technique amounts
to constructing the continuation-passing style (CPS) counterpart
of flow information... (Update)
Context of citations to this paper: More
.... In particular, Damian and Danvy showed that CPS translation provably improves the results of a binding time analysis for the calculus [9, 10]. Their approach is based on CPS translation of control ow and binding time information. These results suggest that the connection...
...or ow sensitivity. In other work, independent of ours, again where the studied framework is somewhat di erent, Damian and Danvy [2] has shown a result that is similar to our result in Section 3. They consider a di erent CPS transformation and they study terms in which...
Cited by: More
CPS Transformation of Beta-Redexes - Danvy, Nielsen (2004)
(Correct)
Secure Information Flow and CPS - Zdancewic, Myers (2001)
(Correct)
CPS Transformation of Flow Information - Palsberg, Wand (2001)
(Correct)
Similar documents (at the sentence level):
47.4%: On Static and Dynamic Control-Flow Information in Program.. - Damian (2001)
(Correct)
Active bibliography (related documents): More All
0.6: Secure Information Flow via Linear Continuations - Zdancewic, Myers (2002)
(Correct)
0.5: Types for Proofs and Programs - Grobauer (1999)
(Correct)
0.3: ML Partial Evaluation using Set-Based Analysis - Malmkjær, Heintze, Danvy (1994)
(Correct)
Similar documents based on text: More All
0.9: Static Transition Compression - Damian, Danvy (2001)
(Correct)
0.4: Lambda-Dropping: Transforming Recursive Equations into Programs.. - Danvy (1995)
(Correct)
0.4: Time Stamps for Fixed-Point Approximation - Damian
(Correct)
Related documents from co-citation: More All
10: Compiling with Continuations (context) - Appel - 1992
8: The essence of compiling with continuations
- Flanagan, Sabry et al.
5: JFlow: Practical mostly-static information flow control
- Myers - 1999
BibTeX entry: (Update)
Damian, D. and O. Danvy. Syntactic accidents in program analysis: On the impact of the CPS transformation. In ICFP'00, September 2000, pp. 209--220. http://citeseer.ist.psu.edu/damian00syntactic.html More
@inproceedings{ damian00syntactic,
author = "Daniel Damian and Olivier Danvy",
title = "Syntactic accidents in program analysis: on the impact of the {CPS} transformation",
booktitle = "International Conference on Functional Programming",
pages = "209-220",
year = "2000",
url = "citeseer.ist.psu.edu/damian00syntactic.html" }
Citations (may not include all citations):
638
Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
206
Tutorial notes on partial evaluation (context) - Consel, Danvy - 1993
181
Principles of Program Analysis (context) - Nielson, Nielson et al. - 1999
121
A core calculus of dependency
- Abadi, Banerjee et al. - 1999
88
A type system equivalent to flow analysis
- Palsberg, O'Keefe - 1995
76
a better support of static data flow
- Consel, Danvy - 1991
66
Abstracting control
- Danvy, Filinski
66
Continuation semantics in typed lambda-calculi
- Meyer, Wand - 1985
55
A unified treatment of flow analysis in higher-order languag..
- Jagannathan, Weeks - 1995
50
Artificial Intelligence Laboratory (context) - Jr, for et al. - 1978
46
Infinitary control flow analysis: a collecting semantics for..
- Nielson, Nielson - 1997
41
Continuation-based partial evaluation
- Lawall, Danvy
40
A denotational framework for data flow analysis (context) - Nielson - 1982
39
Improving binding times without explicit cps-conversion (context) - Bondorf
38
Static and dynamic semantics processing
- Consel, Danvy - 1991
38
volume 34 of Cambridge Tracts in Theoretical Computer Scienc.. (context) - Nielson, Nielson et al. - 1992
31
Correctness of binding-time analysis
- Palsberg - 1993
29
Is continuation-passing useful for data flow analysis
- Sabry, Felleisen - 1994
28
Compilers and staging transformations (context) - Jrring, Scherlis - 1986
26
A generic account of continuation-passing styles (context) - Hatcli, Danvy - 1994
22
What not to do when writing an interpreter for specialisatio..
- Jones - 1996
16
call-by-value and the #-calculus (context) - Plotkin - 1975
14
Semantics-directed compilation of non-linear patterns
- Danvy - 1991
12
Embedding type structure in semantics
- Wand - 1985
12
Continuation passing transformation and abstract interpretat.. (context) - Muylaert-Filho, rey et al.
11
Partial evaluation is fuller laziness (context) - Holst, Gomard - 1991
11
Binding-time analysis: Abstract interpretation versus type i..
- Palsberg, Schwartzbach - 1994
6
Syntactic properties of polymorphic subtyping
- Henglein - 1996
5
Systematic realisation of control flow analyses for CML
- Gasser, Nielson et al.
4
Set-based program analysis of ML programs (context) - Heintze
2
Extended version available as the technical report BRICS RS (context) - Hatcli, Danvy et al. - 1997
2
CPS transformation of flow information
- Palsberg, Wand - 2000
1
Comparing flow-based binding-time analyses
- Palsberg - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.brics.dk/~damian/Papers.html): More
Partial Evaluation for Program Analysis - Damian (1998)
(Correct)
Time Stamps for Fixed-Point Approximation - Damian
(Correct)
On Static and Dynamic Control-Flow Information in Program.. - Damian (2001)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC