Logic Based Program Synthesis and Transformation: 14th International Symposium, LOPSTR 2004, Verona, Italy, August 26 – 28, 2004, 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 book constitutes the thoroughly refereed postproceedings of the 14th International Symposium on Logic Based Program Synthesis and Transformation, LOPSTR 2004, held in Verona, Italy in August 2004.

The 17 revised full papers presented were carefully selected and revised from 23 full paper and 11 extended abstract submissions. The papers are organized in topical sections on verification and analysis, theory and security, transformations, program development, termination, and program development and synthesis.

Author(s): Wim Vanhoof (auth.), Sandro Etalle (eds.)
Series: Lecture Notes in Computer Science 3573 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2005

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

Front Matter....Pages -
Searching Semantically Equivalent Code Fragments in Logic Programs....Pages 1-18
Determinacy Analysis for Logic Programs Using Mode and Type Information....Pages 19-35
Mechanical Verification of Automatic Synthesis of Fault-Tolerant Programs....Pages 36-52
Fully Automatic Binding-Time Analysis for Prolog....Pages 53-68
Logical Mobility and Locality Types....Pages 69-84
Unwinding Conditions for Security in Imperative Languages....Pages 85-100
Natural Rewriting for General Term Rewriting Systems....Pages 101-116
Negation Elimination for Finite PCFGs....Pages 117-132
Specialization of Concurrent Guarded Multi-set Transformation Rules....Pages 133-148
Efficient Local Unfolding with Ancestor Stacks for Full Prolog....Pages 149-165
Schema-Guided Synthesis of Imperative Programs by Constraint Solving....Pages 166-181
Run-Time Profiling of Functional Logic Programs....Pages 182-197
Constructive Specifications for Compositional Units....Pages 198-214
Input-Termination of Logic Programs....Pages 215-230
On Termination of Binary CLP Programs....Pages 231-244
From Natural Semantics to Abstract Machines....Pages 245-261
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis....Pages 262-277
Back Matter....Pages -