Sciweavers

144 search results - page 14 / 29
» Nondeterminism Analysis of Functional Logic Programs
Sort
View
SIGSOFT
2002
ACM
14 years 10 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...
CODES
2008
IEEE
13 years 11 months ago
Specification-based compaction of directed tests for functional validation of pipelined processors
Functional validation is a major bottleneck in microprocessor design methodology. Simulation is the widely used method for functional validation using billions of random and biase...
Heon-Mo Koo, Prabhat Mishra
ICFP
2005
ACM
14 years 3 months ago
Fast narrowing-driven partial evaluation for inductively sequential programs
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
CEC
2011
IEEE
12 years 9 months ago
Cost-benefit analysis of using heuristics in ACGP
—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...
John W. Aleshunas, Cezary Z. Janikow
SSR
2001
134views more  SSR 2001»
13 years 11 months ago
Generation of visitor components that implement program transformations
The visitor pattern is appealing to developers of program-analysis tools because it separates the design of the data structures that represent a program from the design of softwar...
Kurt Stirewalt, Laura K. Dillon