35 search results - page 6 / 7 » Inferring Invariants by Symbolic Execution |
AAAI
2008
13 years 6 months ago
2008
Transfer is the ability to employ knowledge acquired in one task to improve performance in another. We study transfer in the context of the ICARUS cognitive architecture, which su...
BIRTHDAY
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
POPL
2004
ACM
14 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...
PODC
2010
ACM
13 years 8 months ago
2010
ACM
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
PLDI
2003
ACM
13 years 9 months ago
2003
ACM
An adaptation of the classic register allocation algorithm to the problem of array storage optimization in MATLAB is presented. The method involves the decomposition of an interfe...