1445 search results - page 193 / 289 » Uniformly Hard Languages |
136
click to vote
SIGSOFT
2009
ACM
16 years 5 months ago
2009
ACM
Modern development environments often involve models with complex consistency relations. Some of the relations can be automatically established through "fixing procedures&quo...
156
click to vote
SIGSOFT
2007
ACM
16 years 5 months ago
2007
ACM
Finding flaws in security protocol implementations is hard. Finding flaws in the implementations of sensor network security protocols is even harder because they are designed to p...
234
click to vote
ICDT
2009
ACM
16 years 5 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
244
click to vote
ASPLOS
2009
ACM
16 years 5 months ago
2009
ACM
The growth in complexity of modern systems makes it increasingly difficult to extract high-performance. The software stacks for such systems typically consist of multiple layers a...
255
click to vote
POPL
2004
ACM
16 years 4 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...