Sciweavers

16 search results - page 2 / 4
» popl 1998
Sort
View
POPL
1998
ACM
13 years 8 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
13 years 8 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
13 years 8 months ago
Alias Analysis of Executable Code
Recent years have seen increasing interest in systems that reason about and manipulate executable code. Such systems can generally benefit from information about aliasing. Unfort...
Saumya K. Debray, Robert Muth, Matthew Weippert
POPL
1998
ACM
13 years 8 months ago
Maximal Static Expansion
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
Denis Barthou, Albert Cohen, Jean-Francois Collard
POPL
2000
ACM
13 years 8 months ago
(Optimal) Duplication is not Elementary Recursive
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
Andrea Asperti, Paolo Coppola, Simone Martini