1228 search results - page 74 / 246 » Continuations, proofs and tests |
SIGSOFT
2006
ACM
14 years 8 months ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
In a network consisting of several thousands computers, the occurrence of faults is unavoidable. Being able to test the behaviour of a distributed program in an environment where ...
AFRIGRAPH
2001
ACM
13 years 11 months ago
2001
ACM
We present independent method to reduce the number of shadow ray tests. It can be used with standard acceleration ray tracing algorithms. Our method is conservative and produces t...
CC
2008
Springer
13 years 8 months ago
2008
Springer
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...