Sciweavers

Share
POPL
1998
ACM
9 years 10 months ago
A Type System for Java Bytecode Subroutines
Java is typically compiled into an intermediate language, JVML, that is interpreted by the Java Virtual Machine. Because mobile JVML code is not always trusted, a bytecode verifi...
Raymie Stata, Martín Abadi
POPL
1998
ACM
9 years 10 months ago
Secure Information Flow in a Multi-Threaded Imperative Language
Previously, we developed a type system to ensure secure information flow in a sequential, imperative programming language [VSI96]. Program variables are classified as either hig...
Geoffrey Smith, Dennis M. Volpano
POPL
1998
ACM
9 years 10 months ago
Local Type Inference
constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...
Benjamin C. Pierce, David N. Turner
POPL
1998
ACM
9 years 10 months ago
From System F to Typed Assembly Language
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
J. Gregory Morrisett, David Walker, Karl Crary, Ne...
POPL
1998
ACM
9 years 10 months ago
A Functional Representation of Data Structures with a Hole
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
Yasuhiko Minamide
POPL
1998
ACM
9 years 10 months ago
The SLam Calculus: Programming with Secrecy and Integrity
The SLam calculus is a typed -calculus that maintains security information as well as type information. The type system propagates security information for each object in four for...
Nevin Heintze, Jon G. Riecke
POPL
1998
ACM
9 years 10 months ago
Higher-Order unCurrying
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
John Hannan, Patrick Hicks
POPL
1998
ACM
9 years 10 months ago
Putting Pointer Analysis to Work
This paper addresses the problem of how to apply pointer analysis to a wide variety of compiler applications. We are not presenting a new pointer analysis. Rather, we focus on put...
Rakesh Ghiya, Laurie J. Hendren
books