Model checking driven heuristic search for correct programs

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Genetic programming and model checking were combined recently to generate correct-by-construction programs. Unlike other synthesis methods, this approach is based on a search in the state space of syntactically-restricted programs. This search can be seen as a probabilistic and heuristic search. In this paper we discuss the connection between program synthesis and heuristic search. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Katz, G., & Peled, D. (2009). Model checking driven heuristic search for correct programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5348 LNAI, pp. 122–131). https://doi.org/10.1007/978-3-642-00431-5_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free