824 search results - page 63 / 165 » Constructing Functional Programs for Grammar Analysis Proble... |
198
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
EUROGP
2004
Springer
15 years 3 months ago
2004
Springer
The paper presents for the first time automatic module acquisition and evolution within the graph based Cartesian Genetic Programming method. The method has been tested on a set of...
ICSM
2009
IEEE
15 years 4 months ago
2009
IEEE
Within a large, object-oriented software system it is common to partition the classes into a set of packages, which implicitly serve as a set of coarsely-grained logical design un...
KBSE
1998
IEEE
15 years 2 months ago
1998
IEEE
We report on GADGET, a new software test generation system that uses combinatorial optimization to obtain condition/decision coverage of C/C++ programs. The GADGET system is fully...