See this document in CiteSeerX!

Analyses that Distinguish Different Evaluation Orders or Unsoundness Results in Control-Flow Analysis (2002)  (Make Corrections)  
Mitchell Wand



  Home/Search   Context   Related

 
View or download:
neu.edu/pub/people...rsensitivecfa.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  neu.edu/home/wand/pubs (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The standard control-flow analysis for higher-order languages, 0CFA, as defined by Sestoft, Shivers, Palsberg, et al., has been shown correct for a variety of semantics. One view of this family of results is that it shows that 0CFA is insensitive to evaluation order. We present simple modifications of 0CFA for call-by-value and call-by-name that distinguish call-by-value, call-by-name, and unrestricted b-reduction. (Update)

Active bibliography (related documents):   More   All
0.2:   Syntactic Accidents in Program Analysis: On the Impact of the.. - Damian, Danvy (2000)   (Correct)
0.2:   Partial Evaluation for Constraint-Based Program Analyses - Amtoft (2000)   (Correct)
0.1:   Faithful Translations between Polyvariant Flows and.. - Amtoft, Turbak (2002)   (Correct)

Similar documents based on text:   More   All
0.7:   Closure Analysis in Constraint Form - Palsberg (1995)   (Correct)
0.6:   Constraint Systems for Useless Variable Elimination - Wand, Siveroni (1999)   (Correct)
0.6:   Equality-Based Flow Analysis versus Recursive Types - Palsberg (1998)   (Correct)

BibTeX entry:   (Update)

@misc{ wand-analyses,
  author = "Mitchell Wand",
  title = "Analyses that Distinguish Different Evaluation Orders or Unsoundness Results
    in Control-Flow Analysis",
  url = "citeseer.ist.psu.edu/wand02analyses.html" }
Citations (may not include all citations):
176   Control-Flow Analysis of Higher-Order Languages (context) - Shivers - 1991
92   A flexible approach to interprocedural data flow analysis an.. (context) - Jones, Muchnick - 1982
74   Replacing function parameters by global variables (context) - Sestoft - 1989
67   ACM Transactions on Programming Languages and Systems (context) - Palsberg, in - 1995
62   Scalable propagation-based call graph construction algorithm.. - Tip, Palsberg - 2000
54   Safety analysis versus type inference - Palsberg, Schwartzbach - 1995
46   Infinitary control flow analysis: a collecting semantics for.. - Nielson, Nielson - 1997
46   Analysis and efficient implementation of functional programs - Sestoft - 1991
26   The semantics of future and its use in program optimization - Flanagan, Felleisen - 1995
24   Constraint systems for useless variable elimination - Wand, Siveroni - 1999
8   Interprocedural control flow analysis - Nielson, Nielson - 1999
7   call-by-value and the l-calculus (context) - Plotkin - 1975
5   Systematic realisation of control flow analyses for CML - Gasser, Nielson et al. - 1997
1   extensible proof method for small-step flow analyses (context) - Wand, Williamson et al. - 2002
1   Flow logics for contraint based analysis (context) - Nielson, Nielson - 1998

Documents on the same site (http://www.ccs.neu.edu/home/wand/pubs.html):   More
Selectors Make Analyzing case-lambda Too Hard - Meunier, Findler, Steckler, Wand (2001)   (Correct)
On the Correctness and Efficiency of the Krivine Machine - Wand, Friedman (2003)   (Correct)
CPS Transformation of Flow Information - Palsberg, Wand (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