Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Typed Machine Language and its Semantics Kedar N. Swadi
 

Summary: Typed Machine Language and its Semantics
Kedar N. Swadi
Princeton University
kswadi@cs.princeton.edu
Andrew W. Appel
Princeton University
appel@cs.princeton.edu
ABSTRACT
We present TML, a new low level typed intermediate language for
the proof-carrying code framework. The type system of TML is
expressive enough to compile high level languages like core ML to
and can be guaranteed sound. It is also flexible enough to provide
a lot of freedom for low-level data representations. We can model
real machine instructions in TML, and thus avoid high-level opaque
operations like memory allocation and perform provably safe opti-
misations like array bounds check eliminations. Most important,
TML has a semantic model.
1. INTRODUCTION
Proof-carrying code (PCC) [11] is a framework for the genera-
tion of provably safe programs. In this framework, an untrusted

  

Source: Appel, Andrew W. - Department of Computer Science, Princeton University

 

Collections: Computer Technologies and Information Sciences