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: TextTextSeries: Lecture Notes in Computer Science ; 4407Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007Description: VIII, 240 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540714101Subject(s): Computer science | Logic design | Artificial intelligence | Computer Science | Logics and Meanings of Programs | Programming Techniques | Mathematical Logic and Formal Languages | Artificial Intelligence (incl. Robotics)Additional physical formats: Printed edition:: No titleDDC classification: 005.1015113 LOC classification: QA76.9.L63QA76.5913QA76.63Online resources: Click here to access online
Contents:
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.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK7522

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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha