Formality based genetic programming

Genetic programming (GP) is an illogical method for automatic programming. It shows creativity in discovering a desired program to solve problem, but in essence bases its searching principle on software testing. This paper is dedicated to establishing a novel GP which combines classical GP and forma...

Full description

Saved in:
Bibliographic Details
Published in2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence) pp. 4080 - 4087
Main Authors Pei He, Lishan Kang, Ming Fu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2008
Subjects
Evolutionary computation
Online AccessGet full text

Cover

More Information
Summary:Genetic programming (GP) is an illogical method for automatic programming. It shows creativity in discovering a desired program to solve problem, but in essence bases its searching principle on software testing. This paper is dedicated to establishing a novel GP which combines classical GP and formal approaches like Hoarepsilas logic, model checking, and automaton, etc. The result indicates these methods can collaborate in the framework pretty well. As has been demonstrated by the experiment, they work in a way that preserves their advantages while each compensates for the deficiencies of the other. So, once an approximate program is obtained, we can say with certainty it is correct with respect to its corresponding pre- and post-conditions.
ISBN:1424418224
9781424418220
ISSN:1089-778X
1941-0026
DOI:10.1109/CEC.2008.4631354