A Formal Approach to Deductive Synthesis of Constraint Logic Programs (1995)
| Venue: | Proc. 1995 Int. Logic Programming Symp |
| Citations: | 8 - 6 self |
BibTeX
@INPROCEEDINGS{Lau95aformal,
author = {Kung-kiu Lau and Mario Ornaghi},
title = {A Formal Approach to Deductive Synthesis of Constraint Logic Programs},
booktitle = {Proc. 1995 Int. Logic Programming Symp},
year = {1995},
pages = {543--557},
publisher = {MIT Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Formal program synthesis is concerned with deriving programs that are (formally) correct wrt their specifications, and is therefore of crucial importance to formal development of verifiably correct software. Declarative paradigms such as logic programming are particularly suitable for program synthesis, and we have formulated a formal approach to synthesising standard logic programs. Our approach is object-oriented in the sense that it allows the synthesis of modular, reusable, and hence maintainable programs. In this paper, we propose a formal approach to synthesising constraint logic programs based on our current work. We will show that this approach can be used to synthesise modular and reusable CLP programs. An integral part of this paper is the introduction of an abstract semantics to reason about the synthesis of CLP programs. 1 Introduction Program synthesis is concerned with deriving programs that are correct wrt their specifications. A formal approach to synthesis guarantees ...
