(Enter summary)
Abstract: A program schema is an abstraction of a class of actual programs, in the sense that it represents
their data-flow and control-flow, but does not contain (all) their actual computations nor (all) their
actual data structures. We show that schemas can be expressed as first-order open programs, that
is where some of the used relations are left undefined. Compared to higher-order representations,
this considerably simplifies the semantics and manipulations of schemas. Actually, our schemas are
... (Update)
Context of citations to this paper: More
...a formalisation of the process of re use (see [9] for details) Let us illustrate these ideas on the divide and conquer schema. In [8], we design the following strategy for it: 1. Select an induction parameter among x and y (such that it is of an inductively defined sort)...
...show how all these considerations can be put together in order to synthesise a program from the sort specification of Example 2.2. See [3] for more details. We are in LIST (E lem; Delta) and we want a steadfast sorting program with termination requirement PC t (sort(L S)...
Cited by: More
Correct-schema-guided Synthesis of Steadfast Programs - Flener, Lau, Ornaghi (1997)
(Correct)
On Correct Program Schemas - Flener, Lau, Ornaghi (1997)
(Correct)
Active bibliography (related documents): More All
0.6: Schema-Based Logic Program Transformation - Büyükyildiz (1997)
(Correct)
0.5: Skeleton-based Agent Development for Electronic - Institutions Wamberto..
(Correct)
0.5: Generalized Generalization Generalizers (Extended Abstract) - Büyükyildiz, Flener
(Correct)
Similar documents based on text: More All
1.0: Generalised Logic Program Transformation Schemas - Büyükyildiz, Flener (1997)
(Correct)
0.9: Correctness Proofs of Transformation Schemas - Halime Buyukyildiz (1997)
(Correct)
0.9: An Abstract Formulation of Correct Schemas for Program Synthesis - Flener, al. (1999)
(Correct)
Related documents from co-citation: More All
2: Steadfast logic programs
- Lau, Ornaghi et al.
2: Top-down Synthesis of Divide-and-Conquer Algorithms (context) - Smith - 1985
2: Essential concepts of algebraic specification and program development
- Sannella, Tarlecki
BibTeX entry: (Update)
P. Flener and K.-K. Lau. Program Schemas as Steadfast Programs and their Usage in Deductive Synthesis. Tech Rep BU-CEIS-9705, Bilkent University, Ankara, Turkey, 1997. http://citeseer.ist.psu.edu/flener97program.html More
@misc{ flener97program,
author = "P. Flener and K. Lau",
title = "Program Schemas as Steadfast Programs and their Usage in Deductive Synthesis",
text = "P. Flener and K.-K. Lau. Program Schemas as Steadfast Programs and their
Usage in Deductive Synthesis. Tech Rep BU-CEIS-9705, Bilkent University,
Ankara, Turkey, 1997.",
year = "1997",
url = "citeseer.ist.psu.edu/flener97program.html" }
Citations (may not include all citations):
1838
Foundations of Logic Programming (context) - Lloyd - 1987
224
Algebraic specification (context) - Wirsing - 1990
204
KIDS: A semiautomatic program development system
- Smith - 1990
173
An initial algebra approach to specification (context) - Goguen, Thatcher et al. - 1978
133
Mathematical Theory of Computation (context) - Manna - 1974
79
Logic Programming: Systematic Program Development (context) - Deville - 1990
52
object-oriented and relational programming with logical sema.. (context) - Goguen, Meseguer - 1987
42
Top-down synthesis of divide-and-conquer algorithms (context) - Smith - 1985
41
Essential concepts of algebraic specification and program de..
- Sannella, Tarlecki
38
Applying techniques to skeletons
- Sterling, Kirschenbaum - 1993
35
Steadfast logic programs
- Lau, Ornaghi et al.
35
Logic Program Synthesis from Incomplete Information (context) - Flener - 1995
28
Logic program synthesis via proof planning
- Kraan, Basin et al. - 1993
24
On specification frameworks and deductive synthesis of logic..
- Lau, Ornaghi - 1994
24
Logical features of Horn clauses (context) - Hodges - 1993
19
Top-down synthesis of recursive logic procedures from first-..
- Lau, Prestwich - 1990
19
The halting problem for deductive synthesis of logic program..
- Lau, Ornaghi et al. - 1994
17
An opportunistic approach for logic program analysis and opt..
- Vasconcelos, Fuchs - 1996
17
Inductive metalogic programming
- Hamfelt, Fischer-Nilsson - 1994
17
Logic program transformation through generalization schemata
- Flener, Deville - 1996
15
Inductive logic program synthesis with DIALOGS
- Flener
15
Derived preconditions and their use in program synthesis (context) - Smith
14
Generalization and program schemata: A step towards computer.. (context) - Deville, Burnay - 1989
14
The Evolution of Programs (context) - Dershowitz - 1983
11
The relationship between logic programs and specifications: ..
- Lau, Ornaghi - 1997
10
Schema-based top-down design of logic programs using abstrac..
- Marakakis, Gallagher - 1994
9
Synthesis of a family of recursive sorting procedures
- Lau, Prestwich - 1991
9
Logic Program Schemata: Synthesis and Analysis
- Flener - 1995
5
Forms of logic specifications: A preliminary study
- Lau, Ornaghi - 1997
5
Special issue: 10 years of Logic Programming (context) - Deville, Lau et al. - 1994
4
Representing logic program schemata in -Prolog (context) - Gegg-Harrison - 1995
4
Interactive program derivation using program schemata and in.. (context) - Johansson - 1994
2
Learning Prolog in a schema-based environment (context) - Gegg-Harrison - 1991
2
Exploiting program schemata in an automated program debugger (context) - Gegg-Harrison - 1994
Documents on the same site (http://cs.bilkent.edu.tr/tech-reports/1997/ABSTRACTS.1997.html): More
Concurrent Rule Execution In Active Databases - Saygin, Ulusoy, Chakravarthy (1998)
(Correct)
Inductive Synthesis of Recursive Logic Programs: Achievements .. - Flener, Yilmaz
(Correct)
Design And Implementation Of A Computational Lexicon For Turkish - Yorulmaz (1997)
(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