On correct program schemas
Author
Flener, Pierre
Lau, K. K.
Ornaghi, M.
Date
1998Source Title
Logic Program Synthesis and Transformation
Print ISSN
0302-9743
Publisher
Springer, Berlin, Heidelberg
Volume
1463
Pages
128 - 147
Language
English
Type
Conference PaperItem Usage Stats
119
views
views
70
downloads
downloads
Abstract
We present our work on the representation and correctness of program schemas, in the context of logic program synthesis. Whereas most researchers represent schemas purely syntactically as higher-order expressions, we shall express a schema as an open rst-order theory that axiomatises a problem domain, called a specication framework, containing an open program that represents the template of the schema. We will show that using our approach we can dene a meaningful notion of correctness for schemas, viz. that correct program schemas can be expressed as parametric specication frameworks containing templates that are steadfast, i.e. programs that are always correct provided their open relations are computed correctly. © Springer-Verlag Berlin Heidelberg 1998.
Keywords
Formal logicSynthesis (chemical)
Higher-order
Logic programs
Order theory
Problem domain
Logic programming