119
click to vote
POPL
2005
ACM
15 years 2 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
POPL
2005
ACM
15 years 2 months ago
2005
ACM
102
click to vote
POPL
2005
ACM
15 years 2 months ago
2005
ACM
As probabilistic computations play an increasing role in solving various problems, researchers have designed probabilistic languages that treat probability distributions as primit...
103
click to vote
POPL
2005
ACM
15 years 2 months ago
2005
ACM
Modern applications are designed in multiple tiers to separate concerns. Since each tier may run at a separate location, middleware is required to mediate access between tiers. Ho...
104
click to vote
POPL
2005
ACM
15 years 2 months ago
2005
ACM
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
101
click to vote
POPL
2005
ACM
15 years 2 months ago
2005
ACM
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...
100
click to vote
POPL
2005
ACM
15 years 2 months ago
2005
ACM
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap locations of global reasoning about entire heap abstractions. We present an int...
116
click to vote
POPL
2005
ACM
15 years 2 months ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...