Sciweavers

72 search results - page 5 / 15
» Automatic Generation of Local Repairs for Boolean Programs
Sort
View
77
Voted
CACM
2008
131views more  CACM 2008»
14 years 9 months ago
Exterminator: Automatically correcting memory errors with high probability
Programs written in C and C++ are susceptible to memory errors, including buffer overflows and dangling pointers. These errors, which can lead to crashes, erroneous execution, and...
Gene Novark, Emery D. Berger, Benjamin G. Zorn
CP
2003
Springer
15 years 2 months ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
GECCO
2006
Springer
213views Optimization» more  GECCO 2006»
15 years 1 months ago
Evolutionary unit testing of object-oriented software using strongly-typed genetic programming
Evolutionary algorithms have successfully been applied to software testing. Not only approaches that search for numeric test data for procedural test objects have been investigate...
Stefan Wappler, Joachim Wegener
GECCO
2000
Springer
122views Optimization» more  GECCO 2000»
15 years 1 months ago
Genetic Programming with Statically Scoped Local Variables
This paper presents an extension to genetic programming to allow the evolution of programs containing local variables with static scope which obey the invariant that all variables...
Evan Kirshenbaum
ICS
1994
Tsinghua U.
15 years 1 months ago
Evaluating automatic parallelization for efficient execution on shared-memory multiprocessors
We present a parallel code generation algorithm for complete applications and a new experimental methodology that tests the efficacy of our approach. The algorithm optimizes for d...
Kathryn S. McKinley