106 search results - page 9 / 22 » Termination Analysis of Logic Programs Based on Dependency G... |
PLDI
2006
ACM
14 years 1 months ago
2006
ACM
Dependence graphs and memoization can be used to efficiently update the output of a program as the input changes dynamically. Recent work has studied techniques for combining the...
AOSD
2008
ACM
13 years 9 months ago
2008
ACM
Aspect-oriented software presents new challenges for the designers of static analyses. Our work aims to establish systematic foundations for dataflow analysis of AspectJ software....
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Weighted logic programming, a generalization of bottom-up logic programming, is a successful framework for specifying dynamic programming algorithms. In this setting, pro...
TSE
2008
13 years 7 months ago
2008
Neglected conditions are an important but difficult-to-find class of software defects. This paper presents a novel approach for revealing neglected conditions that integrates stati...
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...