15885 search results - page 3047 / 3177 » The Modest Software Engineer |
224
Voted
POPL
2005
ACM
16 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...
236
Voted
POPL
2005
ACM
16 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...
225
click to vote
POPL
2004
ACM
16 years 2 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
244
Voted
POPL
2003
ACM
16 years 2 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
195
Voted
SIGMOD
2005
ACM
16 years 2 months ago
2005
ACM
Applications that require real-time processing of high-volume data steams are pushing the limits of traditional data processing infrastructures. These stream-based applications in...