Design complexity measurement and testing
Communications of the ACM
Calculating the maximum, execution time of real-time programs
Real-Time Systems
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Converting an existing user interface to use constraints
UIST '93 Proceedings of the 6th annual ACM symposium on User interface software and technology
Advances in genetic programming
Worst-case execution time analysis on modern processors
LCTES '95 Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, & tools for real-time systems
Resource-bounded partial evaluation
PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Genetic programming: an introduction: on the automatic evolution of computer programs and its applications
Genetic algorithms for VLSI design, layout & test automation
Genetic algorithms for VLSI design, layout & test automation
Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Communications of the ACM
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Principles of Program Analysis
Principles of Program Analysis
Evolution of a Controller with a Free Variable Using Genetic Programming
Proceedings of the European Conference on Genetic Programming
Abstract Interpretation Based Formal Methods and Future Challenges
Informatics - 10 Years Back. 10 Years Ahead.
Cache Behavior Prediction by Abstract Interpretation
SAS '96 Proceedings of the Third International Symposium on Static Analysis
IEEE Transactions on Evolutionary Computation
Semantic Aware Crossover for Genetic Programming: The Case for Real-Valued Function Regression
EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
A design framework for metaheuristics
Artificial Intelligence Review
Improving symbolic regression with interval arithmetic and linear scaling
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Genetic programming with fitness based on model checking
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Semantics based crossover for boolean problems
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Semantic similarity based crossover in GP: the case for real-valued function regression
EA'09 Proceedings of the 9th international conference on Artificial evolution
The role of syntactic and semantic locality of crossover in genetic programming
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Semantically-based crossover in genetic programming: application to real-valued symbolic regression
Genetic Programming and Evolvable Machines
Examining the landscape of semantic similarity based mutation
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Improving the generalisation ability of genetic programming with semantic similarity based crossover
EuroGP'10 Proceedings of the 13th European conference on Genetic Programming
A new framework for scalable genetic programming
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
On the roles of semantic locality of crossover in genetic programming
Information Sciences: an International Journal
An interpolation based crossover operator for genetic programming
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
The aim of this paper is to introduce the idea of using static analysis of computer programs as a way of measuring fitness in genetic programming. Such techniques extract information about the programs without explicitly running them, and in particular they infer properties which hold across the whole of the input space of a program. This can be applied to measure fitness, and has a number of advantages over measuring fitness by running members of the population on test cases. The most important advantage is that if a solution is found then it is possible to formally trust that solution to be correct across all inputs. This paper introduces these ideas, discusses various ways in which they could be applied, discusses the type of problems for which they are appropriate, and ends by giving a simple test example and some questions for future research.