Logic based program synthesis and transformation. 13th international symposium, LOPSTR 2003, Uppsala, Sweden, August 25--27, 2003. Revised selected papers. (Q1890044)

The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 1045.68013). Indexed articles: \textit{Lehmann, Helko; Leuschel, Michael}, Inductive theorem proving by program specialisation: Generating proofs for Isabelle using Ecce, 1-19 [Zbl 1099.68730] \textit{Alexandre, Francis; Bsaïes, Khaled; Demba, Moussa}, Predicate synthesis from inductive proof attempt of faulty conjectures, 20-33 [Zbl 1099.68094] \textit{Lau, Kung-Kiu; Ornaghi, Mario}, Correct OO systems in computational logic, 34-53 [Zbl 1099.68587] \textit{Fischer, Bernd; Visser, Eelco}, Adding concrete syntax to a Prolog-based program synthesis system (extended abstract), 56-58 [Zbl 1099.68592] \textit{Berghammer, Rudolf; Müller-Olm, Markus}, Formal development and verification of approximation algorithms using auxiliary variables, 59-74 [Zbl 1099.68585] \textit{Ruiz-Reina, José Luis; Alonso-Jiménez, José Antonio; Hidalgo, María José; Martín-Mateos, Francisco Jesús}, Formal reasoning about efficient data structures: A case study in ACL2, 75-91 [Zbl 1099.68660] \textit{Gallagher, John P.}, A program transformation for backwards analysis of logic programs, 92-105 [Zbl 1099.68547] \textit{Murakami, Takuma; Hu, Zhenjiang; Kakehi, Kazuhiko; Takeichi, Masato}, An efficient staging algorithm for binding-time analysis, 106-107 [Zbl 1099.68595] \textit{Serebrenik, Alexander; De Schreye, Danny}, Proving termination with adornments, 108-109 [Zbl 1099.68589] \textit{Weber, Tjark; Caldwell, James}, Constructively characterizing fold and unfold, 110-127 [Zbl 1099.68023] \textit{Yokoyama, Tetsuo; Hu, Zhenjiang; Takeichi, Masato}, Deterministic higher-order patterns for program transformation, 128-142 [Zbl 1099.68591] \textit{Biernacki, Dariusz; Danvy, Olivier}, From interpreter to logic engine by defunctionalization, 143-159 [Zbl 1099.68546] \textit{Alves, Sandra; Florido, Mário}, Linearization by program transformation, 160-175 [Zbl 1099.68020] \textit{Wang, Qian; Gupta, Gopal}, Continuation semantics as Horn clauses, 176-177 [Zbl 1099.68590] \textit{Christiansen, Henning; Martinenghi, Davide}, Simplification of database integrity constraints revisited: A transformational approach, 178-197 [Zbl 1099.68611] \textit{Abdennadher, Slim; Frühwirth, Thom}, Integration and optimization of rule-based constraint solvers, 198-213 [Zbl 1099.68718] \textit{Flener, Pierre; Pearson, Justin; Ågren, Magnus}, Introducing ESRA, a relational language for modelling combinatorial problems, 214-232 [Zbl 1099.68543]