Logic-Based Program Synthesis and Transformation: 19th International Symposium, LOPSTR 2009, Coimbra, Portugal, September 2009, Revised Selected Papers

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This volume constitutes the thoroughly refereed post-conference proceedings of the 19th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2009, held in Coimbra, Portugal, during September 9-11, 2009. The 14 revised full papers presented together with one invited talk were carefully reviewed and selected for inclusion in the book. LOPSTR traditionally solicits papers in the areas of specification, synthesis, verification, transformation, analysis, optimization, composition, security, reuse, applications and tools, component-based software development, software architectures, agent-based software development, and program refinement.

Author(s): Germán Vidal (auth.), Danny De Schreye (eds.)
Series: Lecture Notes in Computer Science 6037 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010

Language: English
Pages: 205
Tags: Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Artificial Intelligence (incl. Robotics); Programming Techniques; Software Engineering; Programming Languages, Compilers, Interpreters

Front Matter....Pages -
Towards Scalable Partial Evaluation of Declarative Programs....Pages 1-4
Deciding Full Branching Time Logic by Program Transformation....Pages 5-21
A Transformational Approach for Proving Properties of the CHR Constraint Store....Pages 22-36
The Dependency Triple Framework for Termination of Logic Programs....Pages 37-51
Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing....Pages 52-66
LP with Flexible Grouping and Aggregates Using Modes....Pages 67-81
On Inductive and Coinductive Proofs via Unfold/Fold Transformations....Pages 82-96
Coinductive Logic Programming with Negation....Pages 97-112
Refining Exceptions in Four-Valued Logic....Pages 113-127
Towards a Framework for Constraint-Based Test Case Generation....Pages 128-142
Using Rewrite Strategies for Testing BUpL Agents....Pages 143-157
Towards Just-In-Time Partial Evaluation of Prolog....Pages 158-172
Program Parallelization Using Synchronized Pipelining....Pages 173-187
Defining Datalog in Rewriting Logic....Pages 188-204
Back Matter....Pages -