Basin, D
Deville, Yves
[UCL]
Flener, P.
Hamfelt, AN
Nilsson, JF
Since the early days of programming and automated reasoning, researchers have developed methods for systematically constructing programs from their specifications. Especially the last decade has seen a flurry of activities including the advent of specialized conferences, such as LOPSTR, covering the synthesis of programs in computational logic. In this paper we analyze and compare three state-of-the-art methods for synthesizing recursive programs in computational logic. The three approaches axe constructive/deductive synthesis, schema-guided synthesis, AA and inductive synthesis. Our comparison is carried out in a systematic way where, for each approach, we describe the key ideas and synthesize a common running example. In doing so, we explore the synergies between the approaches, which we believe are necessary in order to achieve progress over the next decade in this field.
Bibliographic reference |
Basin, D ; Deville, Yves ; Flener, P. ; Hamfelt, AN ; Nilsson, JF. Synthesis of programs in computational logic. In: Lecture Notes in Computer Science, Vol. 3049, p. 30-65 (2004) |
Permanent URL |
http://hdl.handle.net/2078.1/40037 |