See this document in CiteSeerX!

Mechanically Verifying Correctness of CPS Compilation (2006)  (Make Corrections)  
Ye Henry Tian



  Home/Search   Context   Related

 
View or download:
crpit.com/confpapers...CRPITV51Tian.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  crpit.com/PublishedPapers (more)
(Enter author homepages)

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

Abstract: In this paper, we study the formalization of one-pass call-by-value CPS compilation using higher-order abstract syntax. In particular, we verify mechanically that the source program and the CPS-transformed program have the same observable behavior. A key advantage of this approach is that it avoids any administrative redexes thereby simplifying the proofs about CPS-translations. The CPS translation together with its correctness proof is implemented and mechanically verified in the logical... (Update)

Active bibliography (related documents):   More   All
0.5:   Mechanizing Language Definitions - Harper, Licata (2006)   (Correct)
0.5:   CPS Transformation of Beta-Redexes - Danvy, Nielsen (2004)   (Correct)
0.2:   Mechanizing the Metatheory of Standard ML - Lee, Crary, Harper (2006)   (Correct)

Similar documents based on text:
6.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ tian-mechanically,
  author = "Ye Henry Tian",
  title = "Mechanically Verifying Correctness of CPS Compilation",
  url = "citeseer.ist.psu.edu/tian06mechanically.html" }
Citations (may not include all citations):
521   Compiling with Continuations (context) - Appel - 1992
136   System description: Twelf --- a meta-logical framework for d.. - Pfenning, Schurmann - 1999
116   Rabbit: A compiler for scheme (context) - Steele - 1978
55   Representing control: A study of the CPS transformation - Danvy, Filinski - 1992
40   Compiler verification in LF - Hannan, Pfenning - 1992
21   Call-by-name, call-by-value and the #-calculus (context) - Plotkin - 1975
19   Computation and Deduction - Pfenning - 1997
17   On proving syntactic properties of CPS programs - Danvy, Dzafic et al. - 1999
13   Three steps for the cps transformation - Danvy - 1991
11   Termination and reduction checking for higher-order logic pr.. - Pientka - 2001
9   Twelf User's Guide (context) - Pfenning, Schurmann - 2002
9   Termination and reduction checking in the logical framework - Pientka, Pfenning - 2000
7   Mechanized metatheory for the masses: The POPLmark Challenge - Aydemir, Bohannon et al. - 2005
7   A coverage checking algorithm for lf - Schurmann, Pfenning - 2003
6   Foundational certified code in a metalogical framework - Crary, Sarkar - 2003
4   A first-order one-pass cps transformation (context) - Danvy, Nielsen - 2002
2   A higherorder colon translation (context) - Danvy, Nielsenand - 2001
1   Verifying cps transformations in isabelle/hol (context) - Minamide, Okuma - 2003
1   How to believe a twelf proof (context) - Harper, Crary - 2005
1   CPS Transform for Dependent ML (abstract (context) - Xi, Schurmann - 2001

Documents on the same site (http://crpit.com/PublishedPapers.html):   More
Building Trust in Third-party Components using Component.. - Mingins, Chan (2002)   (Correct)
Visualising the Probability Distribution Function of.. - McKinnon, Raymond (2001)   (Correct)
Extending a Persistent Object Framework to Enhance.. - Grundy, Newby.. (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