Sciweavers

945 search results - page 55 / 189
» Incremental Branching Programs
Sort
View
ICSE
2009
IEEE-ACM
14 years 3 months ago
Lightweight fault-localization using multiple coverage types
Lightweight fault-localization techniques use program coverage to isolate the parts of the code that are most suspicious of being faulty. In this paper, we present the results of ...
Raúl A. Santelices, James A. Jones, Yanbing...
KBSE
2008
IEEE
14 years 3 months ago
DiffGen: Automated Regression Unit-Test Generation
— Software programs continue to evolve throughout their lifetime. Maintenance of such evolving programs, including regression testing, is one of the most expensive activities in ...
Kunal Taneja, Tao Xie
RTS
2006
129views more  RTS 2006»
13 years 9 months ago
Modeling out-of-order processors for WCET analysis
Estimating the Worst Case Execution Time (WCET) of a program on a given processor is important for the schedulability analysis of real-time systems. WCET analysis techniques typic...
Xianfeng Li, Abhik Roychoudhury, Tulika Mitra
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
14 years 1 months ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...
SEAL
1998
Springer
14 years 1 months ago
Genetic Programming with Active Data Selection
Genetic programming evolves Lisp-like programs rather than fixed size linear strings. This representational power combined with generality makes genetic programming an interesting ...
Byoung-Tak Zhang, Dong-Yeon Cho