Formalization of the Equivalent Transformation Computation Model

In the equivalent transformation (ET) computation model, a specification provides background knowledge in a problem domain and defines a set of queries of interest. A program is a set of prioritized transformation rules, and computation consists in successive reduction of queries using meaning-preserving transformation with respect to given background knowledge. We present a formalization of the ET model from the viewpoint of program synthesis, where not only computation but also program correctness and correctness relations are of central importance. The notion of program correctness defines “what it means for a program to be correct with respect to a specification,” and a correctness relation provides guidance on “how to obtain such a program.” The correctness relation of the ET model is established, based on which how the basic structure of the ET model facilitates program synthesis is discussed together with program synthesis strategies in this model.

[1]  Alberto Pettorossi,et al.  Transformation of Logic Programs , 1994 .

[2]  Chutiporn Anutariya,et al.  RDF Declarative Description (RDD): A Language for Metadata , 2001, J. Digit. Inf..

[3]  Yuri Gurevich,et al.  Sequential abstract-state machines capture sequential algorithms , 2000, TOCL.

[4]  Kiyoshi Akama,et al.  Semantic Interpretation of Natural Language Descriptions by Program Transformation. , 1995 .

[5]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[6]  Niklaus Wirth,et al.  Program development by stepwise refinement , 1971, CACM.

[7]  Chutiporn Anutariya,et al.  A Data Model for XML Databases , 2001, Journal of Intelligent Information Systems.

[8]  Michael J. Maher,et al.  The Semantics of Constraint Logic Programs , 1998, J. Log. Program..

[9]  Thom W. Frühwirth,et al.  Theory and Practice of Constraint Handling Rules , 1998, J. Log. Program..

[10]  Carroll Morgan,et al.  Programming from specifications , 1990, Prentice Hall International Series in computer science.

[11]  WirthNiklaus.  Program development by stepwise refinement , 1971 .

[12]  Alberto Pettorossi,et al.  Rules and strategies for transforming functional and logic programs , 1996, CSUR.

[13]  Kiyoshi Akama,et al.  A Class of Rewriting Rules and Reverse Transformation for Rule-based Equivalent Transformation , 2001, RULE@PLI.

[14]  Paul Hudak,et al.  Conception, evolution, and application of functional programming languages , 1989, CSUR.

[15]  Jim Woodcock,et al.  Using Z - specification, refinement, and proof , 1996, Prentice Hall international series in computer science.

[16]  Chutiporn Anutariya,et al.  Toward reasoning with unified modeling language diagrams based on extensible markup language declarative description theory , 2004, Int. J. Intell. Syst..

[17]  Joseph M. Morris,et al.  A Theoretical Basis for Stepwise Refinement and the Programming Calculus , 1987, Sci. Comput. Program..

[18]  Kiyoshi Akama,et al.  Program Synthesis Based on the Equivalent Transformation Computation Model , 2002, LOPSTR.