Certifying Compilation for a Language with Stack Allocation

Authors:
Frances Spalding;David Walker
Affiliations:
Princeton University;Princeton University
Venue:
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Year:
2005

Citing 0
Cited 7

Modular verification of assembly code with stack-based control abstractions

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Expressing heap-shape contracts in linear logic

Proceedings of the 5th international conference on Generative programming and component engineering
A garbage-collecting typed assembly language

TLDI '07 Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation
Towards Efficient, Typed LR Parsers

Electronic Notes in Theoretical Computer Science (ENTCS)
Semi-persistent data structures

ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
A typed, compositional logic for a stack-based abstract machine

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
ILC: a foundation for automated reasoning about pointer programs

ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an assembly-language type system capable of ensuring memory safety in the presence of both heap and stack allocation. The type system uses linear logic and a set of domain-specific predicates to specify invariants about the shape of the store. Part of the model for our logic is a tree of "stack tags" that tracks the evolution of the stack over time. To demonstrate the expressiveness of the type system, we define Micro-CLI, a simple imperative language that captures the essence of stack allocation in the Common Language Infrastructure. We show how to compile well-typed Micro-CLI into well-typed assembly.