Inferable Object-Oriented Typed Assembly Language
You need Flash to view this presentation. However, if you are using an iPhone or th like, you can watch this presentation here (it takes a few seconds to buffer).

Recorded using PowerPoint 2010.
Converted using Super.
Embedded using JW Player 5.6.

Inferable Object-Oriented Typed Assembly Language

PLDI 2010: [pdf] [ps] [bibtex] [pptx] [mp4]

Authors: Ross Tate, Juan Chen, and Chris Hawblitzel

Abstract

A certifying compiler preserves type information through compilation to assembly language programs, producing typed assembly language (TAL) programs that can be verified for safety independently so that the compiler does not need to be trusted. There are two challenges for adopting certifying compilation in practice. First, requiring every compiler transformation and optimization to preserve types is a large burden on compilers, especially when adopting certifying compilation into existing optimizing non-certifying compilers. Second, type annotations significantly increase the size of assembly language programs.

This paper proposes an alternative to traditional certifying compilers. It presents iTalX, the first inferable TAL type system that supports existential types, arrays, interfaces, and stacks. We have proved our inference algorithm is complete, meaning if an assembly language program is typeable with iTalX then our algorithm will infer an iTalX typing for that program. Furthermore, our algorithm is guaranteed to terminate even if the assembly language program is untypeable. We demonstrate that it is practical to infer such an expressive TAL by showing a prototype implementation of type inference for code compiled by Bartok, an optimizing C# compiler. Our prototype implementation infers complete type annotations for 98% of functions in a suite of realistic C# benchmarks. The typeinference time is about 8% of the compilation time. We needed to change only 2.5% of the compiler code, mostly adding new code for defining types and for writing types to object files. Most transformations are untouched. Type-annotation size is only 17% of the size of pure code and data, reducing type annotations in our previous certifying compiler by 60%. The compiler needs to preserve only essential type information such as method signatures, object-layout information, and types for static data and external labels. Even non-certifying compilers have most of this information available.

Cool Update: iTalX is now a key part of Microsoft Research's computer-verified memory-safe operating system, Verve!

By Popular Demand: In the paper we mention that all of this was made possible by a category-theoretic framework that I designed for designing and inferring existential types. In fact, the very inference algorithm we use is specified as a categorical algorithm using this framework. Although this work is still in the process of getting published, many have expressed interest in seeing it, so I am posting the current version (with technical report) here: Inferable Existential Quantification. Maybe I should get acquainted with stuff like arXiv... (Also, this same categorical algorithm is what I used for Taming Wildcards in Java's Type System, although much of that work has to deal with adapting to impredicativity which this framework is not intended to handle.)

Questions, Comments, and Suggestions

If you have any questions, comments, or suggestions, please e-mail us. We would be glad to know of any opinions people have or any clarifications we should make.