Pierre Flener  Home/Search
Context Related
| bilkent.edu.tr/tech...BUCEIS9705.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: bilkent.edu.tr/t...ABSTRACTS.1997 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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)
Similar documents based on text: More All
1.0: Correct-schema-guided Synthesis of Steadfast Programs - Flener, Lau, Ornaghi (1997) (Correct)
1.0: On Correct Program Schemas - Flener, Lau, Ornaghi (1997) (Correct)
1.0: Generalised Logic Program Transformation Schemas - Büyükyildiz, Flener (1997) (Correct)
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
[Article contains additional citations not shown here]
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