Sciweavers

388 search results - page 19 / 78
» Program Analysis Using Symbolic Ranges
Sort
View
171
Voted
POPL
2004
ACM
15 years 10 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
CAV
2006
Springer
101views Hardware» more  CAV 2006»
15 years 1 months ago
Terminator: Beyond Safety
Previous symbolic software model checkers (i.e., program analysis tools based on predicate abstraction, pushdown model checkiterative counterexample-guided abstraction refinement, ...
Byron Cook, Andreas Podelski, Andrey Rybalchenko
87
Voted
PLDI
1990
ACM
15 years 1 months ago
A Fresh Look at Optimizing Array Bound Checking
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
Rajiv Gupta
APIN
2010
107views more  APIN 2010»
14 years 9 months ago
Extracting reduced logic programs from artificial neural networks
Artificial neural networks can be trained to perform excellently in many application areas. While they can learn from raw data to solve sophisticated recognition and analysis prob...
Jens Lehmann, Sebastian Bader, Pascal Hitzler
ICDAR
2011
IEEE
13 years 9 months ago
Continuous CRF with Multi-scale Quantization Feature Functions Application to Structure Extraction in Old Newspaper
—We introduce quantization feature functions to represent continuous or large range discrete data into the symbolic CRF data representation. We show that doing this convertion in...
David Hebert, Thierry Paquet, Stéphane Nico...