Logic-Based Program Synthesis and Transformation

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

AvGermán Puebla

Häftad, Engelska, 2007

Del i serien Lecture Notes in Computer Science

561 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the thoroughly refereed postproceedings of the 16th International Symposium on Logic Based Program Synthesis and Transformation, LOPSTR 2006, held in Venice, Italy, July 2006 in conjunction with ICALP 2006, PPDP 2006, and CSFW 2006. The 14 revised full papers cover tools for program development, partial evaluation and program transformation, security and synthesis, debugging and testing, as well as termination and analysis.

Produktinformation

Utgivningsdatum:2007-03-16
Mått:155 x 235 x undefined mm
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:240
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540714095

Utforska kategorier

Programmeringsböcker inom Data och IT

Innehållsförteckning

Invited Talks.- How to Talk to a Human: The Semantic Web and the Clash of the Titans.- CHESS: Systematic Stress Testing of Concurrent Software.- Program Development.- ARM: Automatic Rule Miner.- Constructing Consensus Logic Programs.- Partial Evaluation and Program Transformation.- Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques.- Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs.- Towards Description and Optimization of Abstract Machines in an Extension of Prolog.- Security and Synthesis.- Combining Different Proof Techniques for Verifying Information Flow Security.- On the Automated Synthesis of Proof-Carrying Temporal Reference Monitors.- Synthesis of Asynchronous Systems.- Debugging and Testing.- A Comparative Study of Algorithmic Debugging Strategies.- A Program Transformation for Tracing Functional Logic Computations.- Termination and Analysis.- Automated Termination Analysis for Logic Programs by Term Rewriting.- Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator.- Polytool: Proving Termination Automatically Based on Polynomial Interpretations.- Grids: A Domain for Analyzing the Distribution of Numerical Values.