19 search results - page 1 / 4 » Mechanically Verifying Correctness of CPS Compilation |
CATS
2006
14 years 11 months ago
2006
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 progr...
APLAS
2003
ACM
15 years 1 months ago
2003
ACM
Abstract. Much work has been done in verifying a compiler specification, both in hand-written and mechanical proofs. However, there is still a gap between a correct compiler specif...
POPL
2010
ACM
15 years 6 months ago
2010
ACM
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
PPDP
2007
Springer
15 years 3 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
166
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
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 varian...