Logic-Based Program Synthesis and Transformation

16th International Symposium, LOPSTR 2006, Venice, Italy, July 12-14, 2006, Revised Selected Papers

Editors:

ISBN: 978-3-540-71409-5 (Print) 978-3-540-71410-1 (Online)

Table of contents (16 chapters)

  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-14

      How to Talk to a Human: The Semantic Web and the Clash of the Titans

    2. No Access

      Book Chapter

      Pages 15-16

      CHESS: Systematic Stress Testing of Concurrent Software

  3. Program Development

    1. No Access

      Book Chapter

      Pages 17-25

      ARM: Automatic Rule Miner

    2. No Access

      Book Chapter

      Pages 26-42

      Constructing Consensus Logic Programs

  4. Partial Evaluation and Program Transformation

    1. No Access

      Book Chapter

      Pages 43-59

      Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques

    2. No Access

      Book Chapter

      Pages 60-76

      Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs

    3. No Access

      Book Chapter

      Pages 77-93

      Towards Description and Optimization of Abstract Machines in an Extension of Prolog

  5. Security and Synthesis

    1. No Access

      Book Chapter

      Pages 94-110

      Combining Different Proof Techniques for Verifying Information Flow Security

    2. No Access

      Book Chapter

      Pages 111-126

      On the Automated Synthesis of Proof-Carrying Temporal Reference Monitors

    3. No Access

      Book Chapter

      Pages 127-142

      Synthesis of Asynchronous Systems

  6. Debugging and Testing

    1. No Access

      Book Chapter

      Pages 143-159

      A Comparative Study of Algorithmic Debugging Strategies

    2. No Access

      Book Chapter

      Pages 160-176

      A Program Transformation for Tracing Functional Logic Computations

  7. Termination and Analysis

    1. No Access

      Book Chapter

      Pages 177-193

      Automated Termination Analysis for Logic Programs by Term Rewriting

    2. No Access

      Book Chapter

      Pages 194-209

      Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator

    3. No Access

      Book Chapter

      Pages 210-218

      Polytool: Proving Termination Automatically Based on Polynomial Interpretations

    4. No Access

      Book Chapter

      Pages 219-235

      Grids: A Domain for Analyzing the Distribution of Numerical Values

  8. Back Matter

    Pages -