Skip to main content

What can automatic programming learn from theoretical computer science?

Johnson, Colin G. (2002) What can automatic programming learn from theoretical computer science? In: Yao, Xin, ed. Proceedings of the 2002 U.K. Workshop on Computational Intelligence: UKCI-02. University of Birmingham Press. ISBN 0-7044-2368-5. (KAR id:13729)

Language: English
Download (232kB) Preview
Language: English
Download (200kB) Preview


This paper considers two (seemingly) radically different perspectives on the construction of software. On one hand, search-based heuristics such as genetic programming. On the other hand, the theories of programming which underpin mathematical program analysis and formal methods. The main part of the paper surveys possible links between these perspectives. In particular the contrast between inductive and deductive approaches to software construction are studied, and various suggestions are made as to how randomized search heuristics can be combined with formal approaches to software construction without compromising the rigorous provability of the results. The aim of the ideas proposed is to improve the efficiency, effectiveness and safety of search-based automatic programming.

Item Type: Book section
Uncontrolled keywords: genetic programming, software engineering, search, static analysis, model checking, specification
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Applied and Interdisciplinary Informatics Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 17:59 UTC
Last Modified: 01 Aug 2019 10:31 UTC
Resource URI: (The current URI for this page, for reference purposes)
Johnson, Colin G.:
  • Depositors only (login required):


Downloads per month over past year