1360 search results - page 234 / 272 » Reasoning on Workflow Executions |
GIS
2008
ACM
14 years 10 months ago
2008
ACM
We introduce a parallel approximation of an Over-determined Laplacian Partial Differential Equation solver (ODETLAP) applied to the compression and restoration of terrain data use...
SIGSOFT
2007
ACM
14 years 9 months ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
SIGSOFT
2006
ACM
14 years 9 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...
POPL
2008
ACM
14 years 9 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
POPL
2004
ACM
14 years 9 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...