620 search results - page 55 / 124 » Abstract Analysis of Symbolic Executions |
114
Voted
PPAM
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
200
Voted
POPL
2004
ACM
16 years 25 days 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...
210
Voted
POPL
2009
ACM
16 years 1 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
118
Voted
SP
2010
IEEE
15 years 4 months ago
2010
IEEE
—Fuzz testing has proven successful in finding security vulnerabilities in large programs. However, traditional fuzz testing tools have a well-known common drawback: they are in...
121
Voted
DAC
2006
ACM
16 years 1 months ago
2006
ACM
Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intend...