Logic Based Program Synthesis and Transformation: 13th International Symposium Lopstr 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected Pape

ISBN-13: 9783540221746 / Angielski / Miękka / 2004 / 238 str.

M. Bruynooghe; Maurice Bruynooghe; Lopstr 2003 (13th 2003 Uppsala International Symposium

Opis

This book constitutes the thoroughly refereed postproceedings of the 13th International Symposium on Logic Based Program Synthesis and Transformation, LOPSTR 2003, held in Uppsala, Sweden in August 2003. rounds of reviewing and revision from 32 submissions. Also included are an invited paper and abstracts of 5 papers presented at the workshop. The papers are organized in topical sections on specification and synthesis, verification, analysis, transformation and specialization, and constraints.

Spis treści

Invited Talk.- Inductive Theorem Proving by Program Specialisation: Generating Proofs for Isabelle Using Ecce.- Specification and Synthesis.- Predicate Synthesis from Inductive Proof Attempt of Faulty Conjectures.- Correct OO Systems in Computational Logic.- Specification and Synthesis of Hybrid Automata for Physics-Based Animation.- Adding Concrete Syntax to a Prolog-Based Program Synthesis System.- Verification.- Formal Development and Verification of Approximation Algorithms Using Auxiliary Variables.- Formal Reasoning about Efficient Data Structures: A Case Study in ACL2.- Analysis.- A Program Transformation for Backwards Analysis of Logic Programs.- An Efficient Staging Algorithm for Binding-Time Analysis.- Proving Termination with Adornments.- Transformation and Specialisation.- Constructively Characterizing Fold and Unfold.- Deterministic Higher-Order Patterns for Program Transformation.- From Interpreter to Logic Engine by Defunctionalization.- Linearization by Program Transformation.- Continuation Semantics as Horn Clauses.- Constraints.- Simplification of Database Integrity Constraints Revisited: A Transformational Approach.- Integration and Optimization of Rule-Based Constraint Solvers.- Introducing esra, a Relational Language for Modelling Combinatorial Problems.