• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Biorthogonality, Step-Indexing and Compiler Correctness (2009)

Cached

  • Download as a PDF

Download Links

  • [research.microsoft.com]
  • [research.microsoft.com]
  • [www.research.microsoft.com]
  • [research.microsoft.com]
  • [www.pps.jussieu.fr]
  • [www.cl.cam.ac.uk]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Nick Benton , Chung-Kil Hur
Citations:20 - 8 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Benton09biorthogonality,step-indexing,
    author = {Nick Benton and Chung-Kil Hur},
    title = { Biorthogonality, Step-Indexing and Compiler Correctness},
    year = {2009}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a variant SECD machine. The relations, which are defined using biorthogonality and stepindexing, capture what it means for a piece of low-level code to implement a mathematical, domain-theoretic function and are used to prove correctness of a simple compiler. The results have been formalized in the Coq proof assistant.

Citations

557 From system F to typed assembly language - MORRISETT, WALKER, et al. - 1998
363 LCF considered as a programming language - Plotkin - 1977
299 The mechanical evaluation of expressions - Landin - 1964
216 The formal semantics of programming languages - Winskel - 1993
186 Formal certification of a compiler back-end or: programming a compiler with a proof assistant - Leroy - 2006
111 An indexed model of recursive types for foundational proofcarrying code - Appel, McAllester
99 Operational reasoning for functions with local state - Pitts, Stark - 1998
80 Correctness of a compiler for arithmetic expressions - McCarthy, Painter - 1967
67 Protection in programming-language translations - Abadi - 1998
58 Step-indexed syntactic logical relations for recursive and quantified types - Ahmed - 2006
43 State-dependent representation independence - Ahmed, Dreyer, et al. - 2009
42 VLISP: A verified implementation of scheme - Guttman, Ramsdell, et al. - 1995
40 Classical logic, storage operators and second-order lambda-calculus. Annals of pure and applied logic - Krivine - 1994
32 A very modal model of a modern, major, general type system - Appel, Melliès, et al. - 2007
32 A certified type-preserving compiler from lambda calculus to assembly language - Chlipala - 2007
32 Compiler verification: a bibliography - Dave
20 closed relations and admissibility - Abadi
18 Semantic types: a fresh look at the ideal model for types - Vouillon, Melliès - 2004
17 When is a functional program not a functional program - Longley - 1999
16 Abstracting allocation: the new new thing - Benton - 2006
14 Compiling functional types to relational specifications for low level imperative code - Benton, Tabareau - 2009
12 Securing the .NET programming model - Kennedy - 2005
11 Formalizing and verifying semantic type soundness of a simple compiler - Benton, Zarfaty - 2007
10 Typed closure conversion preserves observational equivalence - Ahmed, Blume - 2008
9 Some domain theory and denotational semantics in coq - Benton, Kennedy, et al. - 2009
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University