• Title of article

    An Abstract Formalization of Correct Schemas for Program Synthesis

  • Author/Authors

    Pierre Flener، نويسنده , , Kung-Kiu Lau، نويسنده , , Mario Ornaghi، نويسنده , , Julian Richardson، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2000
  • Pages
    35
  • From page
    93
  • To page
    127
  • Abstract
    Program schemas should capture not only structured program design principles, but also domain knowledge, both of which are of crucial importance for hierarchical program synthesis. However, most researchers represent schemas as purely syntactic constructs, which can provide only a program template, but not the domain knowledge. In this paper, we take a semantic approach and show that a schema S consists of a syntactic part, namely a template T, and a semantic part. Template T is formalized as an open (first-order) logic program in the context of the problem domain, characterized as a first-order axiomatization, called a specification frameworkF, which is the semantic part. F endows the schema S with a formal semantics, and enables us to define and reason about its correctness. Naturally, correct schemas can be used to guide the synthesis of correct programs.
  • Journal title
    Journal of Symbolic Computation
  • Serial Year
    2000
  • Journal title
    Journal of Symbolic Computation
  • Record number

    805463