[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Logic-Based Program Synthesis and Transformation

19th International Symposium, LOPSTR 2009, Coimbra, Portugal, September 2009, Revised Selected Papers

  • Conference proceedings
  • © 2010

Overview

Editors:
  1. Danny Schreye

    1. Department of Computer Science, K.U.Leuven, Heverlee, Belgium

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6037)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: LOPSTR 2009.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book GBP 44.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (14 papers)

  1. Front Matter

    Download chapter PDF

  2. Towards Scalable Partial Evaluation of Declarative Programs

    • Germán Vidal
    Pages 1-4

  3. Deciding Full Branching Time Logic by Program Transformation

    • Alberto Pettorossi, Maurizio Proietti, Valerio Senni
    Pages 5-21

  4. A Transformational Approach for Proving Properties of the CHR Constraint Store

    • Paolo Pilozzi, Tom Schrijvers, Maurice Bruynooghe
    Pages 22-36

  5. The Dependency Triple Framework for Termination of Logic Programs

    • Peter Schneider-Kamp, Jürgen Giesl, Manh Thang Nguyen
    Pages 37-51

  6. Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing

    • José Iborra, Naoki Nishida, Germán Vidal
    Pages 52-66

  7. LP with Flexible Grouping and Aggregates Using Modes

    • Marcin Czenko, Sandro Etalle
    Pages 67-81

  8. On Inductive and Coinductive Proofs via Unfold/Fold Transformations

    • Hirohisa Seki
    Pages 82-96

  9. Coinductive Logic Programming with Negation

    • Richard Min, Gopal Gupta
    Pages 97-112

  10. Refining Exceptions in Four-Valued Logic

    • Susumu Nishimura
    Pages 113-127

  11. Towards a Framework for Constraint-Based Test Case Generation

    • François Degrave, Tom Schrijvers, Wim Vanhoof
    Pages 128-142

  12. Using Rewrite Strategies for Testing BUpL Agents

    • Lăcrămioara Aştefănoaei, Frank S. de Boer, M. Birna van Riemsdijk
    Pages 143-157

  13. Towards Just-In-Time Partial Evaluation of Prolog

    • Carl Friedrich Bolz, Michael Leuschel, Armin Rigo
    Pages 158-172

  14. Program Parallelization Using Synchronized Pipelining

    • Leonardo Scandolo, César Kunz, Manuel Hermenegildo
    Pages 173-187

  15. Defining Datalog in Rewriting Logic

    • M. Alpuente, M. A. Feliú, C. Joubert, A. Villanueva
    Pages 188-204

  16. Back Matter

    Download chapter PDF
Back to top

Other volumes

  1. Logic-Based Program Synthesis and Transformation

Editors and Affiliations

  • Department of Computer Science, K.U.Leuven, Heverlee, Belgium

    Danny Schreye

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation