Synthesis of parametric programs using genetic programming and model checking

Gal Katz, Doron Peled

Research output: Contribution to journalConference articlepeer-review

5 Scopus citations


Formal methods apply algorithms based on mathematical principles to enhance the reliability of systems. It would only be natural to try to progress from verification, model checking or testing a system against its formal specification into constructing it automatically. Classical algorithmic synthesis theory provides interesting algorithms but also alarming high complexity and undecidability results. The use of genetic programming, in combination of model checking and testing, provides a powerful heuristic to synthesize programs. The method is not completely automatic, as it is fine tuned by a user that sets up the specification and parameters. It also does not guarantee to always succeed and converge towards a solution that satisfies all the required properties. However, we applied it successfully on quite nontrivial examples and managed to find solutions to hard programming challenges, as well as to improve and to correct code. We describe here several versions of our method for synthesizing sequential and concurrent systems.

Original languageEnglish
Pages (from-to)70-84
Number of pages15
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
StatePublished - 23 Feb 2014
Event15th International Workshop on Verification of Infinite-State Systems, INFINITY 2013 - Hanoi, Viet Nam
Duration: 14 Oct 2013 → …


Dive into the research topics of 'Synthesis of parametric programs using genetic programming and model checking'. Together they form a unique fingerprint.

Cite this