2607 search results - page 380 / 522 » Complete Functional Synthesis |
249
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...
159
click to vote
CADE
2004
Springer
16 years 4 months ago
2004
Springer
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
224
Voted
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
218
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
The networked and increasingly ubiquitous nature of today's data management services mandates assurances to detect and deter malicious or faulty behavior. This is particularly...
146
click to vote
SIGMOD
2002
ACM
16 years 4 months ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...