An Abstract Formalization of Correct Schemas for Program Synthesis

20Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2000 Academic Press.

Cite

CITATION STYLE

APA

Flener, P., Lau, K. K., Ornaghi, M., & Richardson, J. (2000). An Abstract Formalization of Correct Schemas for Program Synthesis. Journal of Symbolic Computation, 30(1), 93–127. https://doi.org/10.1006/jsco.1999.0348

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free