Kedar N. Swadi and Andrew W. Appel. Typed machine language and its semantics. Available online at http://www.cs.princeton.edu/#appel/papers, July 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Syntactic Approach to Foundational Proof-Carrying Code - Hamid, Shao, Trifonov.. (2002) (16 citations) (Correct)
.... a type checker while the syntactic soundness proof is known to be much easier to construct than the semantic soundness proof [25] Our article makes the following new contributions: Foundational proofs are widely perceived as extremely hard and tedious to construct, partly because existing e#orts [5, 9, 1, 6, 2, 21] on FPCC have all adopted the semantic approach (which requires building sophisticated models from first principles) We show that this perception is not true: with a syntactic approach, constructing foundational proofs is much simpler and more straightforward. As far as we know, our work is ....
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.
A Syntactic Approach to Foundational Proof-Carrying Code - Hamid, Shao, Trifonov.. (2002) (16 citations) (Correct)
.... type checker while the syntactic soundness proof is known to be much easier to construct than the semantic soundness proof [24] Our paper makes the following new contributions: Foundational proofs are widely perceived as extremely hard and tedious to construct, partly because existing efforts [4, 8, 1, 5, 2, 21] on FPCC have all adopted the semantic approach (which requires building sophisticated models from first principles) We show that this perception is not true: with a syntactic approach, constructing foundational proofs is much simpler and more straightforward. As far as we know, our work is ....
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.
High-Assurance Common Language Runtime - Appel, Walker, Shao, Trifonov Self-citation (Appel) (Correct)
No context found.
K. N. Swadi and A. W. Appel. Typed machine language and its semantics, July 2001.
A Provably Sound TAL for Back-end Optimization - Chen, Wu, Appel, Fang (2003) (7 citations) Self-citation (Appel) (Correct)
.... by a step relation between machine states; we avoid VCGen entirely [3] In order to support contravariant recursive datatypes and mutable fields, we model 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 orthogonal set of primitive type constructors such as union, intersection, existential and universal quantification, and so on. TML is so expressive that ....
Kedar N. Swadi and Andrew W. Appel. Typed machine language and its semantics. www.cs.princeton.edu/~appel/papers, July 2001.
Semantics of General References by a Hierarchy of Gödel.. - Ahmed, Appel, Virga Self-citation (Appel) (Correct)
....nested recursive and quantified types. This limitation also applies to the model in section 7.1 for which we have a machine checked proof. For instance, we 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 latter: we simply need to define a Godel numbering relation that represents type expressions with free DeBruijn variables rather than type functions as we have ....
Kedar N. Swadi and Andrew W. Appel. Typed machine language and its semantics. submitted for publication, 2001. 10
Interfacing Compilers, Proof Checkers, and Proofs for Foundational.. - Wu (2005) (Correct)
No context found.
Kedar N. Swadi and Andrew W. Appel. Typed machine language and its semantics. Available online at http://www.cs.princeton.edu/#appel/papers, July 2001.
Tool-Assisted Specification and Verification of the.. - Barthe, Courtieu.. (2002) (5 citations) (Correct)
No context found.
K. N. Swadi and A. W. Appel. Typed machine language and its semantics. Manuscript, 2001.
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