Correct-schema-guided synthesis of steadfast programs

Date
1997-11
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Proceedings 12th IEEE International Conference Automated Software Engineering
Print ISSN
Electronic ISSN
Publisher
IEEE
Volume
Issue
Pages
153 - 160
Language
English
Journal Title
Journal ISSN
Volume Title
Series
Abstract

It can be argued that for (semi-)automated software development, program schemas are indispensable, since they capture not only structured program design principles, but also domain knowledge, both of which are of crucial importance for hierarchical program synthesis. Most researchers represent schemas purely syntactically (as higher-order expressions). This means that the knowledge captured by a schema is not formalized. We take a semantic approach and show that a schema can be formalized as an open (first-order) logical theory that contains an open logic program. By using a special kind of correctness for open programs, called steadfastness, we can define and reason about the correctness of schemas. We also show how to use correct schemas to synthesize steadfast programs.

Course
Other identifiers
Book Title
Citation
Published Version (Please cite this version)