CiteULike albertfong's CiteULike Search Register Log in
CiteULike is a free online bibliography manager. Register and you can start organising your references online.

Formalizing and verifying semantic type soundness of a simple compiler Export

by: Nick Benton, Uri Zarfaty
In PPDP '07: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming (2007), pp. 1-12.

Citation Format

[Posts]

View FullText article


albertfong's tags for this article

compiler coq correctness

X Reviews [Write a review of this article]

X Find related articles from these CiteULike users

X Find related articles with these CiteULike tags

X Posting History

X 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.


X BibTeX record

X RIS record


Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.