Sciweavers

819 search results - page 24 / 164
» Fractal symbolic analysis
Sort
View
SIGSOFT
2003
ACM
14 years 9 months ago
ARCHER: using symbolic, path-sensitive analysis to detect memory access errors
Memory corruption errors lead to non-deterministic, elusive crashes. This paper describes ARCHER (ARray CHeckER) a static, effective memory access checker. ARCHER uses path-sensit...
Yichen Xie, Andy Chou, Dawson R. Engler
CAV
2009
Springer
104views Hardware» more  CAV 2009»
14 years 9 months ago
SPEED: Symbolic Complexity Bound Analysis
The SPEED project addresses the problem of computing symbolic computational complexity bounds of procedures in terms of their inputs. We discuss some of the challenges that arise a...
Sumit Gulwani
FMCAD
2000
Springer
14 years 6 days ago
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
Roderick Bloem, Harold N. Gabow, Fabio Somenzi
GECCO
2003
Springer
127views Optimization» more  GECCO 2003»
14 years 1 months ago
Complex Function Sets Improve Symbolic Discriminant Analysis of Microarray Data
Abstract. Our ability to simultaneously measure the expression levels of thousands of genes in biological samples is providing important new opportunities for improving the diagnos...
David M. Reif, Bill C. White, Nancy Olsen, Thomas ...
ECRTS
2002
IEEE
14 years 1 months ago
Scope-Tree: A Program Representation for Symbolic Worst-Case Execution Time Analysis
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
Antoine Colin, Guillem Bernat