Sciweavers

175 search results - page 22 / 35
» Partially Ordered Runs: A Case Study
Sort
View
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
14 years 1 months ago
A multi-objective approach to search-based test data generation
There has been a considerable body of work on search–based test data generation for branch coverage. However, hitherto, there has been no work on multi–objective branch covera...
Kiran Lakhotia, Mark Harman, Phil McMinn
EUROPAR
2010
Springer
13 years 8 months ago
Profile-Driven Selective Program Loading
Abstract. Complex software systems use many shared libraries frequently composed of large off-the-shelf components. Only a limited number of functions are used from these shared li...
Tugrul Ince, Jeffrey K. Hollingsworth
GG
2010
Springer
13 years 8 months ago
Multi-Amalgamation in Adhesive Categories
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
Ulrike Golas, Hartmut Ehrig, Annegret Habel
ASPDAC
1999
ACM
93views Hardware» more  ASPDAC 1999»
13 years 11 months ago
Optimization of Linear Placements for Wirelength Minimization with Free Sites
We study a type of linear placement problem arising in detailed placement optimization of a given cell row in the presence of white-space (extra sites). In this single-row placeme...
Andrew B. Kahng, Paul Tucker, Alexander Zelikovsky
ICSM
2009
IEEE
13 years 5 months ago
Effective and efficient localization of multiple faults using value replacement
We previously presented a fault localization technique called Value Replacement that repeatedly alters the state of an executing program to locate a faulty statement [9]. The tech...
Dennis Jeffrey, Neelam Gupta, Rajiv Gupta