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

  author =       "Doron A. Peled",
  title =        "",
  howpublished = "Tutorial The 16th International Conference on Runtime
                 Verification, September 23-30 2016, Madrid, Spain",
  year =         "2016",
  month =        "23-30 " # sep,
  keywords =     "genetic algorithms, genetic programming, model
  URL =          "",
  size =         "95 slides",
  abstract =     "Formal methods, e.g., testing, runtime and offline
                 verification, can provide the means for manually or
                 automatically enhancing the reliability of programs
                 during the design, development, and even after the
                 system is deployed. Classical software reliability
                 methods are usually based on the theory of automata and
                 logic. As such, they are susceptible to known
                 theoretical bounds. For example, automatic verification
                 of finite state systems (model checking) requires
                 exponential time in the size of the system (and the the
                 temporal specification), and is undecidable for
                 parametric systems. Automatic synthesis of
                 correct-by-design systems is doubly exponential in time
                 in the size of the specification and undecidable for
                 concurrent systems.

                 In this tutorial, we will present several ways in which
                 ideas from genetic algorithms and genetic programming
                 can be applied to alleviate some of the inherent
                 restrictions of the classical software reliability
                 methods. These ideas are combined with testing and
                 formal verification methods in order to enhance
                 existing methods and create new software reliability
  notes =        " See also COW50",

Genetic Programming entries for Doron A Peled