595 search results - page 32 / 119 » The Graph Programming Language GP |
CEC
2011
IEEE
12 years 7 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
CSMR
2007
IEEE
14 years 2 months ago
2007
IEEE
A dynamic object process graph is a view on the control flow graph from the perspective of a single object. It has been shown that such a graph can be a useful starting point for...
ACSC
2005
IEEE
14 years 1 months ago
2005
IEEE
Support for program understanding in development and maintenance tasks can be facilitated by program analysis techniques. Both control-flow and data-flow analysis can support pr...
ESOP
2010
Springer
14 years 5 months ago
2010
Springer
Iterated Register Coalescing (IRC) is a widely used heuristic for performing register allocation via graph coloring. Many implementations in existing compilers follow (more or less...
ESOP
2010
Springer
14 years 5 months ago
2010
Springer
Detailed memory models that expose individual fields are necessary to precisely analyze code that makes use of low-level aspects such as, pointers to fields and untagged unions. Ye...