Sciweavers

293 search results - page 49 / 59
» Reasoning About States of Probabilistic Sequential Programs
Sort
View
POPL
2005
ACM
14 years 7 months ago
Precise interprocedural analysis using random interpretation
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
Sumit Gulwani, George C. Necula
POPL
2004
ACM
14 years 7 months ago
Global value numbering using random interpretation
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...
Sumit Gulwani, George C. Necula
PLDI
2003
ACM
14 years 23 days ago
Checking and inferring local non-aliasing
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
Alexander Aiken, Jeffrey S. Foster, John Kodumal, ...
IJCV
2006
100views more  IJCV 2006»
13 years 7 months ago
A General Framework for Combining Visual Trackers - The "Black Boxes" Approach
Abstract. Over the past few years researchers have been investigating the enhancement of visual tracking performance by devising trackers that simultaneously make use of several di...
Ido Leichter, Michael Lindenbaum, Ehud Rivlin
POPL
2003
ACM
14 years 7 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula