Logic Based Program Synthesis and Transformation: 10th International Workshop, LOPSTR 2000 London, UK, July 24–28, 2000 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 book presents revised full papers from the 10th International Workshop on Logic-Based Program Synthesis and Transformation, LOPSTR 2000, held in London, UK, in July 2000 as part of the International Conference on Computational Logic.
The 10 revised full papers presented have gone through two rounds of reviewing, selection and revision. The book is divided in topical sections on synthesis, transformation, analysis, specialization, and abstract interpretation.

Author(s): Kung-Kiu Lau (auth.)
Series: Lecture Notes in Computer Science 2042
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2001

Language: English
Pages: 188
Tags: Logics and Meanings of Programs; Programming Techniques; Artificial Intelligence (incl. Robotics); Mathematical Logic and Formal Languages

A Formal Framework for Synthesis and Verification of Logic Programs....Pages 1-17
Protocols between Programs and Proofs....Pages 18-37
A Technique for Modular Logic Program Refinement....Pages 38-56
Higher-Order Transformation of Logic Programs....Pages 57-68
Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings....Pages 69-85
A Model for Inter-module Analysis and Optimizing Compilation....Pages 86-102
Measuring the Effectiveness of Partial Evaluation in Functional Logic Languages....Pages 103-124
Automated Strategies for Specializing Constraint Logic Programs....Pages 125-146
Measuring the Precision of Abstract Interpretations....Pages 147-164
Specifying Prolog Trace Models with a Continuation Semantics....Pages 165-181