Evolving High-Level Imperative Program Trees with Strongly Formed Genetic Programming

Castle, Tom and Johnson, Colin G. (2012) Evolving High-Level Imperative Program Trees with Strongly Formed Genetic Programming. In: Proceedings of the 15th European Conference on Genetic Programming, EuroGP 2012. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL


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.

Item Type: Conference or workshop item (Paper)
Uncontrolled keywords: determinacy analysis, Craig interpolants
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Computational Intelligence Group
Depositing User: Colin Johnson
Date Deposited: 21 Sep 2012 09:49
Last Modified: 12 Oct 2012 14:22
Resource URI: https://kar.kent.ac.uk/id/eprint/30818 (The current URI for this page, for reference purposes)
  • Depositors only (login required):