Formalizing and verifying semantic type soundness for a simple compiler (2007)
Cached
Download Links
by
Nick Benton
,
Uri Zarfaty
| Citations: | 11 - 3 self |
BibTeX
@TECHREPORT{Benton07formalizingand,
author = {Nick Benton and Uri Zarfaty},
title = {Formalizing and verifying semantic type soundness for a simple compiler },
institution = {},
year = {2007}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 assembly language. Types in the high-level language are interpreted as binary relations, built using both second-order quantification and a form of separation structure, over stores and code pointers in the low-level machine.
