Amazon cover image
Image from Amazon.com
Image from Google Jackets

Logic-Based Program Synthesis and Transformation [electronic resource] : 19th International Symposium, LOPSTR 2009, Coimbra, Portugal, September 2009, Revised Selected Papers / edited by Danny Schreye.

Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science ; 6037Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010Description: X, 205p. 29 illus. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783642125928
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 005.1015113 23
LOC classification:
  • QA76.9.L63
  • QA76.5913
  • QA76.63
Online resources:
Contents:
Towards Scalable Partial Evaluation of Declarative Programs -- Deciding Full Branching Time Logic by Program Transformation -- A Transformational Approach for Proving Properties of the CHR Constraint Store -- The Dependency Triple Framework for Termination of Logic Programs -- Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing -- LP with Flexible Grouping and Aggregates Using Modes -- On Inductive and Coinductive Proofs via Unfold/Fold Transformations -- Coinductive Logic Programming with Negation -- Refining Exceptions in Four-Valued Logic -- Towards a Framework for Constraint-Based Test Case Generation -- Using Rewrite Strategies for Testing BUpL Agents -- Towards Just-In-Time Partial Evaluation of Prolog -- Program Parallelization Using Synchronized Pipelining -- Defining Datalog in Rewriting Logic.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Call number Materials specified URL Status Date due Barcode
IMSc Library Link to resource Available EBK9008

Towards Scalable Partial Evaluation of Declarative Programs -- Deciding Full Branching Time Logic by Program Transformation -- A Transformational Approach for Proving Properties of the CHR Constraint Store -- The Dependency Triple Framework for Termination of Logic Programs -- Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing -- LP with Flexible Grouping and Aggregates Using Modes -- On Inductive and Coinductive Proofs via Unfold/Fold Transformations -- Coinductive Logic Programming with Negation -- Refining Exceptions in Four-Valued Logic -- Towards a Framework for Constraint-Based Test Case Generation -- Using Rewrite Strategies for Testing BUpL Agents -- Towards Just-In-Time Partial Evaluation of Prolog -- Program Parallelization Using Synchronized Pipelining -- Defining Datalog in Rewriting Logic.

There are no comments on this title.

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