773 search results - page 76 / 155 » Program Slicing by Calculation |
GECCO
2010
Springer
14 years 2 months ago
2010
Springer
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
ICML
2010
IEEE
13 years 11 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
COMPSAC
2011
IEEE
12 years 9 months ago
2011
IEEE
Abstract—Statistical fault localization techniques find suspicious faulty program entities in programs by comparing passed and failed executions. Existing studies show that such ...
WMPI
2004
ACM
14 years 3 months ago
2004
ACM
During a program’s runtime, the stack and data segments of the main memory often contain much redundancy, which makes them good candidates for compression. Compression and decomp...
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
Encapsulation of states in object-oriented programs hinders the search for test data using evolutionary testing. As client code is oblivious to the internal state of a server obje...