Logic-Based Program Synthesis and Transformation [electronic resource] : 16th International Symposium, LOPSTR 2006, Venice, Italy, July 12-14, 2006, Revised Selected Papers / edited by Germán Puebla.
Contributor(s): Puebla, Germán [editor.] | SpringerLink (Online service).
Material type: BookSeries: Theoretical Computer Science and General Issues: 4407Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007Edition: 1st ed. 2007.Description: VIII, 240 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540714101.Subject(s): Software engineering | Computer science | Computer programming | Machine theory | Artificial intelligence | Software Engineering | Computer Science Logic and Foundations of Programming | Programming Techniques | Formal Languages and Automata Theory | Artificial IntelligenceAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 005.1 Online resources: Click here to access onlineInvited 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.
There are no comments for this item.