Kedar N. Swadi, Andrew W. Appel  Home/Search
Context Related
| princeton.edu/~appel/papers/tml.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: princeton.edu/~appel/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 optimisations like array bounds check... (Update)
Context of citations to this paper: More
.... cannot represent the following type in our model: rec#la#ref#rec#lb##ref b##a### Typed Machine Language, described by Swadi and Appel, [23] accommodates arbitrarily nested recursive and quantified types and it does so using DeBruijn indices. Our approach is compatible with the...
.... types as predicates on states, approximation indices [4] and type levels [1] We have an abstraction layer, Typed Machine Language (TML) [20], to hide the complex semantic models for types. TML provides a rich set of constructors for types, type maps, and instructions, and an...
Cited by: More
Interfacing Compilers, Proof Checkers, and Proofs for Foundational.. - Wu (2005) (Correct)
Tool-Assisted Specification and Verification of the.. - Barthe, Courtieu.. (2002) (Correct)
High-Assurance Common Language Runtime - Appel, Walker, Shao, Trifonov (Correct)
Active bibliography (related documents): More All
0.5: A Kind System for Typed Machine Language - Appel, Richards, Swadi (2002) (Correct)
0.5: An Expressive, Scalable Type Theory for Certified Code - Crary, Vanderwaart (2001) (Correct)
0.4: Foundational Proof-Carrying Code - Appel (2001) (Correct)
Similar documents based on text: More All
0.7: Efficient Substitution in Hoare Logic Expressions - Appel, Swadi, Virga (2000) (Correct)
0.4: A Semantic Model of Types and Machine Instructions for.. - Appel, Felty (2000) (Correct)
0.4: An Indexed Model of Recursive Types for Foundational.. - Appel, McAllester (2000) (Correct)
Related documents from co-citation: More All
7: Proof-carrying code - Necula - 1997
6: A semantic model of types and machine instructions for proof-carrying code - Appel, Felty - 2000
6: An indexed model of recursive types for foundational proof-carrying code - Appel, McAllester - 2000
BibTeX entry: (Update)
K. N. Swadi and A. W. Appel. Typed machine language and its semantics. Preliminary version available at www.cs.princeton.edu/appel/papers/tml.pdf, July 2001. http://citeseer.ist.psu.edu/swadi01typed.html More
@misc{ swadi01typed,
author = "K. Swadi and A. Appel",
title = "Typed machine language and its semantics",
text = "K. N. Swadi and A. W. Appel. Typed machine language and its semantics.
Preliminary version available at www.cs.princeton.edu/appel/papers/tml.pdf,
July 2001.",
year = "2001",
url = "citeseer.ist.psu.edu/swadi01typed.html" }
Citations (may not include all citations):566 Proof-carrying code - Necula - 1997 ACM DBLP
201 to typed assembly language (context) - Morrisett, Walker et al. - 1998
136 System description: Twelf --- a meta-logical framework for d.. - Pfenning, Schurmann - 1999
106 Lambda calculus notation with nameless dummies (context) - deBruijn - 1972
92 Explicit substitutions - Abadi, Cardelli et al. - 1990 ACM DBLP
65 A semantic model of types and machine instructions for proof.. - Appel, Felty - 2000 ACM
58 Foundational proof-carrying code - Appel - 2001 ACM DBLP
35 overview FLINTML compiler - An, the et al. - 1997
25 Type-preserving garbage collectors - Wang, Appel - 2001 ACM DBLP
25 An indexed model of recursive types for foundational proof-c.. - Appel, McAllester - 2000 ACM DBLP
18 Machine instruction syntax and semantics in higher-order log.. (context) - Michael, Appel - 2000
14 An ideal model for recursive polymophic types (context) - MacQueen, Plotkin et al. - 1986
12 School of Computer Science (context) - Necula, Proofs et al. - 1998
5 Implementation of the typed call-by-value l-calculus using a.. (context) - Tofte, Talpin - 1994
3 Semantics of general references by a hierarchy of Godel numb.. (context) - Ahmed, Appel et al. - 2001
2 Oregon Graduate Institute (context) - Xi, Harper et al. - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.princeton.edu/~appel/papers/): More
Runtime Tags Aren't Necessary - Appel (1988) (Correct)
Traversal-based Visualization of Data Structures - Korn, Appel (1998) (Correct)
Allocation without Locking - Appel (1989) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC