Many kinds of networked devices receive and execute new programs from various sources. Since we may not fully trust the producers of these programs, we must take measures to ensure that such code does notmisbehave. Currently deployedmobile code formats can be checked for memory safety and other security properties, but they are relatively high-level. A type-preserving compiler generates lower-level, more optimized code that is still verifiable. This increases assurance by reducing the trusted computing base; we need not trust the compiler anymore. Moreover, lower-level representations naturally support a wider variety of source languages. Previous research on type-preserving compilation focused on functional languages or safe subsets of C. ...
Most of the software that we depend upon, including operating systems, communication stacks, file sy...
A number of programming languages use rich type systems to ver-ify security properties of code. Some...
Compilers that have been formally verified in theorem provers are often not directly usable because ...
Many kinds of networked devices receive and execute new programs from various sources. Since we may ...
Abstract. Popular mobile code architectures (Java and.NET) include verifiers to check for memory saf...
Abstract. Popular mobile code architectures (Java and.NET) include verifiers to check for memory saf...
Abstract. Our critical computing systems are coded in low-level, typeunsafe languages such as C, and...
Abstract. Much recent work on proof-carrying code aims to build certifying compilers for single-inhe...
Programs written in a typed language are guaranteed to satisfy the safety properties of the type sys...
Starting from the seminal work of Volpano and Smith, there has been growing evidence that type syste...
Compilers for monomorphic languages, such as C and Pascal, take advantage of types to determine data...
In the past few years a large body of work has developed on the use of typed intermediate languages ...
Security of mobile code is a major issue in today's global computing environment. When you download...
Conventional approaches to compiler correctness, type safety and type preservation have focused on o...
We propose a new type system for Java-like languages which allows compilation of a class in isolati...
Most of the software that we depend upon, including operating systems, communication stacks, file sy...
A number of programming languages use rich type systems to ver-ify security properties of code. Some...
Compilers that have been formally verified in theorem provers are often not directly usable because ...
Many kinds of networked devices receive and execute new programs from various sources. Since we may ...
Abstract. Popular mobile code architectures (Java and.NET) include verifiers to check for memory saf...
Abstract. Popular mobile code architectures (Java and.NET) include verifiers to check for memory saf...
Abstract. Our critical computing systems are coded in low-level, typeunsafe languages such as C, and...
Abstract. Much recent work on proof-carrying code aims to build certifying compilers for single-inhe...
Programs written in a typed language are guaranteed to satisfy the safety properties of the type sys...
Starting from the seminal work of Volpano and Smith, there has been growing evidence that type syste...
Compilers for monomorphic languages, such as C and Pascal, take advantage of types to determine data...
In the past few years a large body of work has developed on the use of typed intermediate languages ...
Security of mobile code is a major issue in today's global computing environment. When you download...
Conventional approaches to compiler correctness, type safety and type preservation have focused on o...
We propose a new type system for Java-like languages which allows compilation of a class in isolati...
Most of the software that we depend upon, including operating systems, communication stacks, file sy...
A number of programming languages use rich type systems to ver-ify security properties of code. Some...
Compilers that have been formally verified in theorem provers are often not directly usable because ...