Automated techniques for provably safe mobile code

Authors:
Christopher Colby;Karl Crary;Robert Harper;Peter Lee;Frank Pfenning
Affiliations:
Inksomi Corporation, 75 Hawthorne Street, Suite 601, San Francisco, CA;Computer Science Department, Carnegie Mellon University, Pittsburgh, PA;Computer Science Department, Carnegie Mellon University, Pittsburgh, PA;Computer Science Department, Carnegie Mellon University, Pittsburgh, PA;Computer Science Department, Carnegie Mellon University, Pittsburgh, PA
Venue:
Theoretical Computer Science - Dependable computing
Year:
2003

Citing 24
Cited 3

Logic programming in the LF logical framework

Logical frameworks
A framework for defining logics

Journal of the ACM (JACM)
Efficient software-based fault isolation

SOSP '93 Proceedings of the fourteenth ACM symposium on Operating systems principles
Extensibility safety and performance in the SPIN operating system

SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
TIL: a type-directed optimizing compiler for ML

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Safe kernel extensions without run-time checking

OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From system F to typed assembly language

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Eliminating array bound checking through dependent types

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
The design and implementation of a certifying compiler

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Dependent types in practical programming

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proof-carrying authentication

CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Resource bound certification

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Stack-Based Typed Assembly Language

TIC '98 Proceedings of the Second International Workshop on Types in Compilation
Elf: A Meta-Language for Deductive Systems (System Descrition)

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Logical frameworks

Handbook of automated reasoning
Efficient Representation and Validation of Proofs

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Definitional interpreters for higher-order programming languages

ACM '72 Proceedings of the ACM annual conference - Volume 2
A Dependently Typed Assembly Language

A Dependently Typed Assembly Language
Compiling with proofs

Compiling with proofs
Higher-order rewriting with dependent types (lambda calculus)

Higher-order rewriting with dependent types (lambda calculus)

Plugging Haskell in

Haskell '04 Proceedings of the 2004 ACM SIGPLAN workshop on Haskell
Enabling control over adaptive program transformation for dynamically evolving mobile software validation

SESS '05 Proceedings of the 2005 workshop on Software engineering for secure systems—building trustworthy applications
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 a general framework for provably safe mobile code. It relies on a formal definition of a safety policy and explicit evidence for compliance with this policy which is attached to a binary. Concrete realizations of this framework are proof-carrying code, where the evidence for safety is a formal proof generated by a certifying compiler, and typed assembly language, where the evidence for safety is given via type annotations propagated throughout the compilation process in typed intermediate languages. Validity of the evidence is established via a small trusted type checker, either directly on the binary or indirectly on proof representations in a logical framework.