POPL
1998
ACM
13 years 8 months ago
1998
ACM
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...
POPL
1998
ACM
13 years 8 months ago
1998
ACM
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...
POPL
1998
ACM
13 years 8 months ago
1998
ACM
constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...
POPL
1998
ACM
13 years 8 months ago
1998
ACM
POPL
1998
ACM
13 years 8 months ago
1998
ACM
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 ...
POPL
1998
ACM
13 years 8 months ago
1998
ACM
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...
POPL
1998
ACM
13 years 8 months ago
1998
ACM
POPL
1998
ACM
13 years 8 months ago
1998
ACM
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...
POPL
1998
ACM
13 years 8 months ago
1998
ACM
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...
POPL
1998
ACM
13 years 8 months ago
1998
ACM
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...