7103 search results - page 72 / 1421 » Components and Generative Programming |
SBACPAD
2005
IEEE
14 years 1 months ago
2005
IEEE
The Data-Flow Graph (DFG) of a parallel application is frequently used to take scheduling decisions, based on the information that it models (dependencies among the tasks and volu...
COMPSAC
2005
IEEE
14 years 1 months ago
2005
IEEE
Automatic test data generation leads to the identification of input values on which a selected path or a selected branch is executed within a program (path-oriented vs goalorient...
KBSE
2010
IEEE
13 years 6 months ago
2010
IEEE
Software constantly undergoes changes throughout its life cycle, and thereby it evolves. As changes are introduced into a code base, we need to make sure that the effect of the ch...
KBSE
2009
IEEE
14 years 2 months ago
2009
IEEE
Given a program and an attack pattern (specified as a regular expression), we automatically generate string-based vulnerability signatures, i.e., a characterization that includes...
MP
2006
13 years 7 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...