School of Computing

Evolving high-level imperative program trees with strongly formed genetic programming

Tom Castle and Colin G. Johnson

In Alberto Moraglio, Sara Silva, Krzysztof Krawiec, Penousal Machado, and Carlos Cotta, editors, Proceedings of the 15th European Conference on Genetic Programming, EuroGP 2012, volume 7244 of LNCS, pages 182-196, Malaga, April 2012. Springer.


We present a set of extensions to Montana's popular Strongly Typed Genetic Programming system that introduce constraints on the structure of program trees. It is demonstrated that these constraints can be used to evolve programs with a naturally imperative structure, using common high-level imperative language constructs such as loops. A set of three problems including factorial and the general even-n-parity problem are used to test the system. Experimental results are presented which show success rates and required computational effort that compare favourably against other systems on these problems, while providing support for this imperative structure.

Download publication 391 kbytes (PDF)

Bibtex Record

author = {Tom Castle and Colin G. Johnson},
title = {Evolving High-Level Imperative Program Trees with Strongly Formed Genetic Programming},
month = {April},
year = {2012},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {},
    publication_type = {inproceedings},
    submission_id = {17077_1329268215},
    booktitle = {Proceedings of the 15th European Conference on Genetic Programming, EuroGP 2012},
    editor = {Alberto Moraglio and Sara Silva and Krzysztof Krawiec and Penousal Machado and Carlos Cotta},
    volume = {7244},
    series = {LNCS},
    address = {Malaga},
    publisher = {Springer},
    refereed = {yes},

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014