Transformation of Equational Specification by Means of Genetic Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.3973

@InProceedings{ibarra:2002:EuroGP,
  title =        "Transformation of Equational Specification by Means of
                 Genetic Programming",
  author =       "Aitor Ibarra and J. Lanchares and J. Mendias and 
                 J. I. Hidalgo and R. Hermida",
  editor =       "James A. Foster and Evelyne Lutton and 
                 Julian Miller and Conor Ryan and Andrea G. B. Tettamanzi",
  booktitle =    "Genetic Programming, Proceedings of the 5th European
                 Conference, EuroGP 2002",
  volume =       "2278",
  series =       "LNCS",
  pages =        "248--257",
  publisher =    "Springer-Verlag",
  address =      "Kinsale, Ireland",
  publisher_address = "Berlin",
  month =        "3-5 " # apr,
  year =         "2002",
  keywords =     "genetic algorithms, genetic programming, FRESH",
  ISBN =         "3-540-43378-3",
  DOI =          "doi:10.1007/3-540-45984-7_24",
  abstract =     "High Level Synthesis (HLS) is a designing methodology
                 aimed to the synthesis of hardware devices from
                 behavioural specifications. One of the techniques used
                 in HLS is formal verification. In this work we present
                 an evolutionary algorithm in order to optimize circuit
                 equational specifications by means of a special type of
                 genetic operator. We have named this operator algebraic
                 mutation, carried out with the help of the equations
                 that Formal Verification Synthesis offers. This work
                 can be classified within the development of an
                 automatic tool of Formal Verification Synthesis by
                 using genetic techniques. We have applied this
                 technique to a simple circuit equational specification
                 and to a much more complex algebraic equation. In the
                 first case our algorithm simplifies the equation until
                 the best specification is found and in the second a
                 solution improving the former is always obtained.",
  notes =        "EuroGP'2002, part of \cite{lutton:2002:GP} Algebraic
                 mutation. No crossover. gpcc++ 0.5.2 Two example
                 equations simplified. Pop size 4. 60 percent
                 improvement.

                 ",
}

Genetic Programming entries for Aitor Ibarra J Lanchares J Mendias J I Hidalgo Roman Hermida Correa

Citations