Logic-Based Program Synthesis and Transformation 19th International Symposium, LOPSTR 2009, Coimbra, Portugal, September 2009, Revised Selected Papers /
Cote: | Libro Electrónico |
---|---|
Collectivité auteur: | |
Autres auteurs: | |
Format: | Électronique eBook |
Langue: | Inglés |
Publié: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2010.
|
Édition: | 1st ed. 2010. |
Collection: | Theoretical Computer Science and General Issues,
6037 |
Sujets: | |
Accès en ligne: | Texto Completo |
Table des matières:
- 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.