Sciweavers

ICALP
2001
Springer
14 years 4 months ago
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution
We work with an extension of Resolution, called Res(2), that allows clauses with conjunctions of two literals. In this system there are rules to introduce and eliminate such conju...
Albert Atserias, Maria Luisa Bonet, Juan Luis Este...
ESOP
2001
Springer
14 years 4 months ago
Secure Information Flow and CPS
Security-typed languages enforce confidentiality or integrity policies by type checking. This paper investigates continuation-passing style (CPS) translation of such languages as ...
Steve Zdancewic, Andrew C. Myers
ESOP
2001
Springer
14 years 4 months ago
Typestate Checking of Machine Code
We check statically whether it is safe for untrusted foreign machine code to be loaded into a trusted host system. (Here “safety” means that the program abides by a memory-acc...
Zhichen Xu, Thomas W. Reps, Barton P. Miller
ESOP
2001
Springer
14 years 4 months ago
Encoding Intensional Type Analysis
Abstract. Languages for intensional type analysis permit ad-hoc polymorphism, or run-time analysis of types. However, such languages require complex, specialized constructs to supp...
Stephanie Weirich
ESOP
2001
Springer
14 years 4 months ago
A Systematic Approach to Static Access Control
François Pottier, Christian Skalka, Scott F...
ESOP
2001
Springer
14 years 4 months ago
Control-Flow Analysis in Cubic Time
Abstract. It is well-known that context-independent control flow analysis can be performed in cubic time for functional and object-oriented languages. Yet recent applications of c...
Flemming Nielson, Helmut Seidl
ESOP
2001
Springer
14 years 4 months ago
Proof-Directed De-compilation of Low-Level Code
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
Shin-ya Katsumata, Atsushi Ohori
ESOP
2001
Springer
14 years 4 months ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing