Skip to main content
SpringerLink
Log in

Improving the Scalability of Automatic Programming

  • Conference paper
Book cover Computational Intelligence and Security (CIS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3801))

Included in the following conference series:

  • 1656 Accesses

Abstract

When automatically constructing large programs using program transformations, the number of possible transformations grows very fast. In this paper, we introduce and test a new way of combining several program transformations into one transformation, inspired by the combinatorial concept of Covering Arrays (CA).

We have equipped the ADATE automatic programming system with this new CA transformation and conducted a series of 18 experiments which show that the CA transformation is a highly useful supplement to the existing ADATE transformations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brassard, G., Bratley, P.: Fundamentals of Algorithms, pp. 133–134. Prentice-Hall, New Jersey

    Google Scholar 

  2. Chateauneuf, M., Kreher, D.L.: On the state of strength-three covering arrays. Journal of Combinatorial Designs 10(4), 217–238

    Google Scholar 

  3. Geard, N., Wiles, J., Hallinan, J., Tonkes, B., Skellett, B.: A comparison of neutral landscapes - NK, NKp and NKq. In: Proceedings of the 2002 Congress on Evolutionary Computation, pp. 205–210 (2002)

    Google Scholar 

  4. Hedayat, A.S., Sloane, N.J.A., Stufken, J.: Orthogonal Arrays. Springer, New York

    Google Scholar 

  5. Kimura, M.: The Neutral Theory of Molecular Evolution. Cambridge University Press, Cambridge

    Google Scholar 

  6. Olsson, R.: Inductive functional programming using incremental program transformation. Artificial intelligence 74(1), 55–83

    Google Scholar 

  7. Olsson, R., Powers, D.M.W.: Machine learning of human language through automatic programming. In: International Conference on Cognitive Science. University of New South Wales, pp. 507–512

    Google Scholar 

  8. Sherwood, G.: On the Construction of Orthogonal Arrays and Covering Arrays Using Permutation Groups. Webpage, http://home.att.net/~gsherwood/cover.htm

  9. Sloane, N.J.A.: Covering Arrays and Intersecting Codes. Journal of Combinatorial Designs 1(1), 51–63

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Østfold University College, Remmen, N-1783, Halden, Norway

    Henrik Berg & Roland Olsson

Authors
  1. Henrik Berg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roland Olsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microelectronic Instiute, Xidian University, 710071, Xi’an, China

    Yue Hao

  2. Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong

    Jiming Liu

  3. School of Computer Science and Technology, Xidian University, Xi’an, China

    Yuping Wang

  4. Department of Computer Science, Hong Kong Baptist University, Hong Kong,  

    Yiu-ming Cheung

  5. School of Electrical and Electronic Engineering, University of Manchester, UK

    Hujun Yin

  6. Life Science Research Center, School of Electronic Engineering, Xidian University, 710071, Xi’an, Shaanxi, China

    Licheng Jiao

  7. Key Laboratory of Computer Networks and Information Security (Ministry of Education), Xidian University, 710071, Xi’an, China

    Jianfeng Ma

  8. National Laboratory of Antennas and Microwave Technology, Xidian University, 710071, Xi’an, Shanxi, P.R. China

    Yong-Chang Jiao

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berg, H., Olsson, R. (2005). Improving the Scalability of Automatic Programming. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_3

Download citation

  • DOI: https://doi.org/10.1007/11596448_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30818-8

  • Online ISBN: 978-3-540-31599-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation