Formalizing and verifying semantic type soundness of a simple compiler

Authors:
Nick Benton;Uri Zarfaty
Affiliations:
Microsoft Research;Imperial College
Venue:
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Year:
2007

Citing 26
Cited 6

A mechanically verified code generator

Journal of Automated Reasoning
A semantic basis for quest

LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Recursion over realizability structures

Information and Computation
Formal parametric polymorphism

Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
A syntactic approach to type soundness

Information and Computation
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Operational reasoning for functions with local state

Higher order operational techniques in semantics
From system F to typed assembly language

ACM Transactions on Programming Languages and Systems (TOPLAS)
A semantic model of types and machine instructions for proof-carrying code

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An indexed model of recursive types for foundational proof-carrying code

ACM Transactions on Programming Languages and Systems (TOPLAS)
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Relational Semantics for Recursive Types and Bounded Quantification

ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Foundational Proof-Carrying Code

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Simple relational correctness proofs for static analyses and program transformations

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Correctness of data representations involving heap data structures

Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Semantics of types for mutable state

Semantics of types for mutable state
Semantics of Separation-Logic Typing and Higher-Order Frame Rules

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Formal certification of a compiler back-end or: programming a compiler with a proof assistant

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relational separation logic

Theoretical Computer Science
Relational parametricity and separation logic

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Abstract predicates and mutable adts in hoare type theory

ESOP'07 Proceedings of the 16th European conference on Programming
A typed, compositional logic for a stack-based abstract machine

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Abstracting allocation

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
BI hyperdoctrines and higher-order separation logic

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Relational reasoning in a nominal semantics for storage

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Reading, writing and relations: towards extensional semantics for effect analyses

APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems

Ynot: dependent types for imperative programs

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Compiling functional types to relational specifications for low level imperative code

Proceedings of the 4th international workshop on Types in language design and implementation
Extensible Proof-Producing Compilation

CC '09 Proceedings of the 18th International Conference on Compiler Construction: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Biorthogonality, step-indexing and compiler correctness

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Semantic foundations for typed assembly languages

ACM Transactions on Programming Languages and Systems (TOPLAS)
Trusted source translation of a total function language

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems

Quantified Score

Hi-index	0.00

Visualization

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.