1941 search results - page 336 / 389 » On the Hardness of Approximate Reasoning |
193
click to vote
POPL
2005
ACM
16 years 4 days 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...
200
click to vote
POPL
2005
ACM
16 years 4 days 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...
195
click to vote
POPL
2004
ACM
16 years 4 days 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...
201
click to vote
POPL
2003
ACM
16 years 4 days ago
2003
ACM
There is significant room for improving users' experiences with model checking tools. An error trace produced by a model checker can be lengthy and is indicative of a symptom...
213
click to vote
POPL
2003
ACM
16 years 4 days 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...