1291 search results - page 102 / 259 » Arithmetic program paths |
POPL
2004
ACM
14 years 10 months ago
2004
ACM
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
POPL
2007
ACM
14 years 10 months ago
2007
ACM
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
POPL
2004
ACM
14 years 10 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...
JPDC
2010
13 years 4 months ago
2010
We show a method for parallelizing top down dynamic programs in a straightforward way by a careful choice of a lock-free shared hash table implementation and randomization of the ...
SIGSOFT
2003
ACM
14 years 10 months ago
2003
ACM
Foundational and scalable techniques for runtime safety analysis of multithreaded programs are explored in this paper. A technique based on vector clocks to extract the causal dep...