An expressive, scalable type theory for certified code

Authors:
Karl Crary;Joseph C. Vanderwaart
Affiliations:
Carnegie Mellon University, Pittsburgh, PA;Carnegie Mellon University, Pittsburgh, PA
Venue:
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Year:
2002

Citing 22
Cited 12

Linear logic

Theoretical Computer Science
A framework for defining logics

Journal of the ACM (JACM)
Compiling polymorphism using intensional type analysis

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extensibility safety and performance in the SPIN operating system

SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Safe kernel extensions without run-time checking

OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
Eliminating array bound checking through dependent types

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Flexible type analysis

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
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
A type system for expressive security policies

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A certifying compiler for Java

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Typed memory management via static capabilities

ACM Transactions on Programming Languages and Systems (TOPLAS)
A type system for certified binaries

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A dependently typed assembly language

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
The Definition of Standard ML

The Definition of Standard ML
Java Virtual Machine Specification

Java Virtual Machine Specification
A Taste of Linear Logic

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Inductive Definitions in the system Coq - Rules and Properties

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Primitive Recursion for Higher-Order Abstract Syntax

TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Stack-Based Typed Assembly Language

TIC '98 Proceedings of the Second International Workshop on Types in Compilation
Automated Theorem Proving in a Simple Meta-Logic for LF

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
A Linear Logical Framework

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science

The logical approach to stack typing

Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
An effective theory of type refinements

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Automated and certified conformance to responsiveness policies

TLDI '05 Proceedings of the 2005 ACM SIGPLAN international workshop on Types in languages design and implementation
Semantic type qualifiers

Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Certified assembly programming with embedded code pointers

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A verifiable SSA program representation for aggressive compiler optimization

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A garbage-collecting typed assembly language

TLDI '07 Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation
Type-preserving compilation for large-scale optimizing object-oriented compilers

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Unifying type checking and property checking for low-level code

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computer security from a programming language and static analysis perspective

ESOP'03 Proceedings of the 12th European conference on Programming
Singleton: a general-purpose dependently-typed assembly language

Proceedings of the 7th ACM SIGPLAN workshop on Types in language design and implementation
Using dependent types to certify the safety of assembly code

SAS'05 Proceedings of the 12th international conference on Static Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proofs allows the type system to guarantee properties that would otherwise be incompatible with decidable type checking. LTT also provides linear facilities for tracking ephemeral properties that hold only for certain program states.Our type theory allows for re-use of typechecking software by casting a variety of type systems within a single language. We illustrate our methodology of representation by means of two examples, one functional and one stateful, and describe the associated operational semantics and proofs of type safety.