Kung-Kiu Lau, Geraint Wiggins  Home/Search
Context
Related
| cs.man.ac.uk/~kung...iclp94tutabs.ps.gz cs.man.ac.uk/pub/ku...iclp94tutabs.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.man.ac.uk/~kungkiu/pub/ (more) From: cs.man.ac.uk/~kungkiu/pub/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 1 Introduction Program synthesis is concerned with deriving programs from their specifications. Such specifications (and corresponding derivations) may be formal or informal . Formal methods have an advantage over informal ones, in that they have the desirable 1 property of being able to formally prove the correctness of the derived programs. Logic programming provides a uniquely uniform framework for specifications, programs and program synthesis. It is small wonder that in the early days... (Update)
Active bibliography (related documents): More All
0.8: Logic Program Synthesis - Deville, Lau (1993) (Correct)
0.6: On Specification Frameworks and Deductive Synthesis of Logic.. - Kung-Kiu Lau (1994) (Correct)
0.6: On the Use of Inductive Reasoning in Program Synthesis.. - Flener, Popelínsky (1994) (Correct)
Similar documents based on text: More All
0.2: Towards a Framework for the Evaluation of Machine Compositions - Pearce, Wiggins (2001) (Correct)
0.2: Statistical Learning of Harmonic Movement - Dan Ponsford Geraint (1999) (Correct)
0.2: Representing Trees with Constraints - Curry, Wiggins, Hayes (Correct)
BibTeX entry: (Update)
@inproceedings{ kungkiu94tutorial,
author = "Lau, Kung-Kiu and Wiggins, Geraint",
title = "A Tutorial on Synthesis of Logic Programs from Specifications",
booktitle = "Proceedings of the Eleventh International Conference on Logic Programming",
publisher = "The MIT Press",
editor = "Van~Hentenryck, Pascal",
pages = "11--14",
year = "1994",
url = "citeseer.ist.psu.edu/61817.html" }
Citations (may not include all citations):328 Algorithmic Program Debugging (context) - Shapiro - 1983
50 Derivation of logic programs (context) - Hogger - 1981
30 The synthesis of logic programs from inductive proofs (context) - Bundy, Smaill et al. - 1990
18 Transformational Logic Program Synthesis (context) - Sato, Tamaki - 1984
11 A natural programming calculus (context) - Hansson, Tarnlund - 1979
6 An incompleteness result for deductive synthesis of logic pr.. - Lau, Ornaghi - 1993
2 Technical Report DOC (context) - Clark, verification et al. - 1981
2 Ten Years of Logic Programming (context) - Deville, Lau et al.
2 Synthesis of Programs in the Framework of Partial Deduction (context) - Komorowski - 1989
2 Ten Years of Logic Programming (context) - Muggleton, De Raedt et al.
1 Dept of Information Processing and Computer Science (context) - Hansson, Development et al. - 1980
Documents on the same site (http://www.cs.man.ac.uk/~kung-kiu/pub/): More
Top-down Synthesis of Sorting Algorithms - Lau (1992) (Correct)
A Note on Synthesis and Classification of Sorting Algorithms - Lau (1989) (Correct)
Modules, Reuse and Correctness - Lau, Ornaghi (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC