Logic Based Program Synthesis and Transformation

1. Front Matter

   PDF

2. Invited Talk

   1. Inductive Theorem Proving by Program Specialisation: Generating Proofs for Isabelle Using Ecce

      • Helko Lehmann, Michael Leuschel

      Pages 1-19

3. Specification and Synthesis

   1. Predicate Synthesis from Inductive Proof Attempt of Faulty Conjectures

      • Francis Alexandre, Khaled Bsaïes, Moussa Demba

      Pages 20-33

   2. Correct OO Systems in Computational Logic

      • Kung-Kiu Lau, Mario Ornaghi

      Pages 34-53

   3. Specification and Synthesis of Hybrid Automata for Physics-Based Animation

      • Thomas Ellman

      Pages 54-55

   4. Adding Concrete Syntax to a Prolog-Based Program Synthesis System

      • Bernd Fischer, Eelco Visser

      Pages 56-58

4. Verification

   1. Formal Development and Verification of Approximation Algorithms Using Auxiliary Variables

      • Rudolf Berghammer, Markus Müller-Olm

      Pages 59-74

   2. Formal Reasoning about Efficient Data Structures: A Case Study in ACL2

      • José Luis Ruiz-Reina, José Antonio Alonso-Jiménez, María José Hidalgo, Francisco Jesús Martín-Mateos

      Pages 75-91

5. Analysis

   1. A Program Transformation for Backwards Analysis of Logic Programs

      • John P. Gallagher

      Pages 92-105

   2. An Efficient Staging Algorithm for Binding-Time Analysis

      • Takuma Murakami, Zhenjiang Hu, Kazuhiko Kakehi, Masato Takeichi

      Pages 106-107

   3. Proving Termination with Adornments

      • Alexander Serebrenik, Danny De Schreye

      Pages 108-109

6. Transformation and Specialisation

   1. Constructively Characterizing Fold and Unfold

      • Tjark Weber, James Caldwell

      Pages 110-127

   2. Deterministic Higher-Order Patterns for Program Transformation

      • Tetsuo Yokoyama, Zhenjiang Hu, Masato Takeichi

      Pages 128-142

   3. From Interpreter to Logic Engine by Defunctionalization

      • Dariusz Biernacki, Olivier Danvy

      Pages 143-159

   4. Linearization by Program Transformation

      • Sandra Alves, Mário Florido

      Pages 160-175

   5. Continuation Semantics as Horn Clauses

      • Qian Wang, Gopal Gupta

      Pages 176-177

7. Constraints

   1. Simplification of Database Integrity Constraints Revisited: A Transformational Approach

      • Henning Christiansen, Davide Martinenghi

      Pages 178-197

   2. Integration and Optimization of Rule-Based Constraint Solvers

      • Slim Abdennadher, Thom Frühwirth

      Pages 198-213

   3. Introducing esra, a Relational Language for Modelling Combinatorial Problems

      • Pierre Flener, Justin Pearson, Magnus Ågren

      Pages 214-232

8. Back Matter

   PDF

This volume contains selected papers from LOPSTR 2003, the 13th Inter- tional Symposium on Logic-Based Program Synthesis and Transformation. The LOPSTR series is devoted to research in logic-based program development. P- ticular topics of interest are speci?cation, synthesis, veri?cation, transformation, specialization, analysis, optimization, composition, reuse, component-based so- ware development, agent-based software development, software architectures, design patterns and frameworks, program re?nement and logics for re?nement, proofs as programs, and applications and tools. LOPSTR 2003 took place at the University of Uppsala from August 25 to August 27 as part of PLI 2003 (Principles, Logics, and Implementations of High- Level Programming Languages). PLI was an ACM-organized confederation of conferences and workshops with ICFP 2003 (ACM-SIGPLAN International C- ference on Functional Programming) and PPDP 2003 (ACM-SIGPLAN Inter- tional Conference on Principles and Practice of Declarative Programming) as the main events. The LOPSTR community pro?ted from the shared lectures of the invited speakers, and the active scienti?c discussions enabled by the co-location. LOPSTR 2003 was the thirteenth in a series of events. Past events were held in Manchester, UK (1991, 1992, 1998), Louvain-la-Neuve, Belgium (1993), Pisa, Italy (1994), Arnhem, The Netherlands (1995), Stockholm, Sweden (1996), L- ven, Belgium (1997), Venice, Italy (1999), London, UK (2000), Paphos, Cyprus (2001), and Madrid, Spain (2002).

• Syntax
• algorithms
• automata
• computational logic
• data structure
• functional programming
• imperative programming
• logic
• logic program manipulation
• logic programming
• optimization
• program analysis
• program syntesis
• program transformation
• semantics

• Department of Computer Science, Katholieke Universiteit Leuven, Belgium

  Maurice Bruynooghe

Policies and ethics