Paul A. Steckler  Home/Search
Context Related
| yale.edu/WWW/HTML/YALE/CS...thesis.ps.z neu.edu/pub/people/steck/thesis.ps.Z neu.edu/pub/people...ecklerthesis.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: yale.edu (more) From: neu.edu/pub/people/wand/papers... (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a method for proving the correctness of compiler optimizations for higher-order programming languages. Programs are annotated with propositions derived as the solutions to dataflow constraints formulated as local consistency conditions for each parse tree node. We can prove that any such solution yields sound annotations, that is, the propositions are true. Each compiler optimization is presented as a source-to-source transformation. Using the annotations and additional constraint... (Update)
Context of citations to this paper: More
.... Gamma: OM; S env Theta S val 4 The use of labeled transition systems to describe abstract executions is a change from Wand and Steckler [1994] and Steckler [1994] There we wrote E(x) V for E x Gamma V and (i; E) 2 OE for V i Gamma E. We believe the the use of labeled...
...The monolithic approach has attracted much interest in the last few years. Its advocates, e.g. Wand [Wan93] Amtoft [Amt93] and Steckler [Ste94], argue that considering the correctness of the algorithm and transformation together leads to a much simpler proof. The slogan is:...
Cited by: More
Correct Separate and Selective Closure Conversion - Steckler (Correct)
Selective and Lightweight Closure Conversion - Steckler, WAND (1996) (Correct)
Proving the Correctness of Recursion-Based Automatic Program.. - Sands (1996) (Correct)
Active bibliography (related documents): More All
0.0: Selective Thunkification - Steckler, Wand (Correct)
0.0: From Polyvariant Flow Information to Intersection and Union.. - Palsberg, Pavlopoulou (2000) (Correct)
0.0: Minimal Thunkification - Amtoft (1993) (Correct)
Similar documents based on text: More All
0.1: Lightweight Closure Conversion - Steckler, Wand (1997) (Correct)
0.1: Closure Analysis in Constraint Form - Palsberg (1995) (Correct)
0.1: DrScheme: A Programming Environment for Scheme - Findler, Clements, Flanagan.. (2001) (Correct)
Related documents from co-citation: More All
4: Automatic autoprojection of higher-order recursive equations (context) - Bondorf - 1991
4: Specifying the correctness of binding-time analysis (context) - Wand - 1993
4: Tracking Available Values for Lightweight Closures - Steckler, Wand - 1994
BibTeX entry: (Update)
Steckler, P. A. 1994. Correct higher-order program transformations. Ph.D. thesis, Northeastern Univ., Boston, Mass. http://citeseer.ist.psu.edu/steckler94correct.html More
@phdthesis{ paul94correct,
author = "Steckler, Paul",
title = "{C}orrect {H}igher-{O}rder {P}rogram {T}ransformations",
year = "94",
url = "citeseer.ist.psu.edu/steckler94correct.html" }
Citations (may not include all citations):194 The Formal Semantics of Programming Languages (context) - Winskel - 1993
49 Specifying the Correctness of Binding-Time Analysis (context) - Wand - 1993
38 Selective and Lightweight Closure Conversion - Wand, Steckler - 1994
25 A New Technique for Strictness Analysis (context) - Wright - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.yale.edu.html): More
A Reactive Plan Language - McDermott (1993) (Correct)
A Calibration-Free, Self-Adjusting Stereo Visual Control System - Chang, Morse, Hager (Correct)
Temporal Domain Parallelism: Does It Work? - Deshpande, Douglas, Malhotra (1993) (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