Logic Based Program Synthesis and Transformation [electronic resource] : 14th International Symposium, LOPSTR 2004, Verona, Italy, August 26 – 28, 2004, Revised Selected Papers / edited by Sandro Etalle.

Contributor(s): Etalle, Sandro [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 3573Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005Description: VIII, 284 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540316831Subject(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:
Verification and Analysis -- Searching Semantically Equivalent Code Fragments in Logic Programs -- Determinacy Analysis for Logic Programs Using Mode and Type Information -- Mechanical Verification of Automatic Synthesis of Fault-Tolerant Programs -- Fully Automatic Binding-Time Analysis for Prolog -- Theory and Security -- Logical Mobility and Locality Types -- Unwinding Conditions for Security in Imperative Languages -- Natural Rewriting for General Term Rewriting Systems -- Transformations -- Negation Elimination for Finite PCFGs -- Specialization of Concurrent Guarded Multi-set Transformation Rules -- Efficient Local Unfolding with Ancestor Stacks for Full Prolog -- Program Development -- Schema-Guided Synthesis of Imperative Programs by Constraint Solving -- Run-Time Profiling of Functional Logic Programs -- Constructive Specifications for Compositional Units -- Termination -- Input-Termination of Logic Programs -- On Termination of Binary CLP Programs -- Program Development and Synthesis -- From Natural Semantics to Abstract Machines -- Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis.
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 EBK3573

Verification and Analysis -- Searching Semantically Equivalent Code Fragments in Logic Programs -- Determinacy Analysis for Logic Programs Using Mode and Type Information -- Mechanical Verification of Automatic Synthesis of Fault-Tolerant Programs -- Fully Automatic Binding-Time Analysis for Prolog -- Theory and Security -- Logical Mobility and Locality Types -- Unwinding Conditions for Security in Imperative Languages -- Natural Rewriting for General Term Rewriting Systems -- Transformations -- Negation Elimination for Finite PCFGs -- Specialization of Concurrent Guarded Multi-set Transformation Rules -- Efficient Local Unfolding with Ancestor Stacks for Full Prolog -- Program Development -- Schema-Guided Synthesis of Imperative Programs by Constraint Solving -- Run-Time Profiling of Functional Logic Programs -- Constructive Specifications for Compositional Units -- Termination -- Input-Termination of Logic Programs -- On Termination of Binary CLP Programs -- Program Development and Synthesis -- From Natural Semantics to Abstract Machines -- Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis.

There are no comments on this title.

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

Powered by Koha