Ebook: Logic-Based Program Synthesis and Transformation: 21st International Symposium, LOPSTR 2011, Odense, Denmark, July 18-20, 2011. Revised Selected Papers

This book constitutes the thoroughly refereed proceedings of the 21st International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2011, held in Odense, Denmark in July 2011. The 6 revised full papers presented together with 8 additional papers were carefully reviewed and selected from 28 submissions. Among the topics covered are specification, synthesis, verification, analysis, optimization, specialization, security, certification, applications and tools, program/model manipulation, and transformation techniques for any programming language paradigm.

---

This book constitutes the thoroughly refereed proceedings of the 21st International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2011, held in Odense, Denmark in July 2011. The 6 revised full papers presented together with 8 additional papers were carefully reviewed and selected from 28 submissions. Among the topics covered are specification, synthesis, verification, analysis, optimization, specialization, security, certification, applications and tools, program/model manipulation, and transformation techniques for any programming language paradigm.

---

This book constitutes the thoroughly refereed proceedings of the 21st International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2011, held in Odense, Denmark in July 2011. The 6 revised full papers presented together with 8 additional papers were carefully reviewed and selected from 28 submissions. Among the topics covered are specification, synthesis, verification, analysis, optimization, specialization, security, certification, applications and tools, program/model manipulation, and transformation techniques for any programming language paradigm.
Content:
Front Matter....Pages -
Analysis of Logic Programs Using Regular Tree Languages....Pages 1-3
Dynamic Symbolic Computation for Domain-Specific Language Implementation....Pages 4-24
Resource-Driven CLP-Based Test Case Generation....Pages 25-41
A Declarative Embedding of XQuery in a Functional-Logic Language....Pages 42-56
Automata-Based Computation of Temporal Equilibrium Models....Pages 57-72
Simplifying Questions in Maude Declarative Debugger by Transforming Proof Trees....Pages 73-89
Clones in Logic Programs and How to Detect Them....Pages 90-105
Using Real Relaxations during Program Specialization....Pages 106-122
Marker-Directed Optimization of UnCAL Graph Transformations....Pages 123-138
Modular Extensions for Modular (Logic) Languages....Pages 139-154
Meta-predicate Semantics....Pages 155-172
A Strategy Language for Graph Rewriting....Pages 173-188
Improved Termination Analysis of CHR Using Self-sustainability Analysis....Pages 189-204
Proving Properties of Co-Logic Programs by Unfold/Fold Transformations....Pages 205-220
Probabilistic Termination of CHRiSM Programs....Pages 221-236
A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog ....Pages 237-252
Back Matter....Pages -

---

This book constitutes the thoroughly refereed proceedings of the 21st International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2011, held in Odense, Denmark in July 2011. The 6 revised full papers presented together with 8 additional papers were carefully reviewed and selected from 28 submissions. Among the topics covered are specification, synthesis, verification, analysis, optimization, specialization, security, certification, applications and tools, program/model manipulation, and transformation techniques for any programming language paradigm.
Content:
Front Matter....Pages -
Analysis of Logic Programs Using Regular Tree Languages....Pages 1-3
Dynamic Symbolic Computation for Domain-Specific Language Implementation....Pages 4-24
Resource-Driven CLP-Based Test Case Generation....Pages 25-41
A Declarative Embedding of XQuery in a Functional-Logic Language....Pages 42-56
Automata-Based Computation of Temporal Equilibrium Models....Pages 57-72
Simplifying Questions in Maude Declarative Debugger by Transforming Proof Trees....Pages 73-89
Clones in Logic Programs and How to Detect Them....Pages 90-105
Using Real Relaxations during Program Specialization....Pages 106-122
Marker-Directed Optimization of UnCAL Graph Transformations....Pages 123-138
Modular Extensions for Modular (Logic) Languages....Pages 139-154
Meta-predicate Semantics....Pages 155-172
A Strategy Language for Graph Rewriting....Pages 173-188
Improved Termination Analysis of CHR Using Self-sustainability Analysis....Pages 189-204
Proving Properties of Co-Logic Programs by Unfold/Fold Transformations....Pages 205-220
Probabilistic Termination of CHRiSM Programs....Pages 221-236
A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog ....Pages 237-252
Back Matter....Pages -
....