Sciweavers

1452 search results - page 143 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
106
Voted
GECCO
2007
Springer
276views Optimization» more  GECCO 2007»
15 years 6 months ago
Meta-optimizing semantic evolutionary search
I present MOSES (meta-optimizing semantic evolutionary search), a new probabilistic modeling (estimation of distribution) approach to program evolution. Distributions are not esti...
Moshe Looks
129
Voted
FASE
2011
Springer
14 years 4 months ago
Theoretical Aspects of Compositional Symbolic Execution
Given a program and an assertion in that program, determining if the assertion can fail is one of the key applications of program analysis. Symbolic execution is a well-known techn...
Dries Vanoverberghe, Frank Piessens
115
Voted
PLDI
2010
ACM
15 years 10 months ago
Breadcrumbs: Efficient Context Sensitivity for Dynamic Bug Detection Analyses
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...
Michael D. Bond, Graham Z. Baker, Samuel Z. Guyer
91
Voted
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
16 years 27 days ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall
94
Voted
LCPC
2005
Springer
15 years 6 months ago
Interprocedural Symbolic Range Propagation for Optimizing Compilers
Abstract. We have designed and implemented an interprocedural algorithm to analyze symbolic value ranges that can be assumed by variables at any given point in a program. Our algor...
Hansang Bae, Rudolf Eigenmann