Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Logic Based Program Synthesis and Transformation: 13th International Symposium LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected Papers > Linearization by Program Transformation
Logic Based Program Synthesis and Transformation: 13th International Symposium LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected Papers |
Maurice Bruynooghe
Springer Berlin Heidelberg
Logic Based Program Synthesis and Transformation: 13th International Symposium LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected Papers
Linearization by Program Transformation
Authors

Sandra Alves; Mário Florido

ARI Id

1664569421075_2241202

Access

Not Available Free

Pages

160-175

DOI

10.1007/978-3-540-25938-1_14

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-540-25938-1_14

Table of Contents of Book
Showing 1 to 20 of 20 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Inductive Theorem Proving by Program Specialisation: Generating Proofs for Isabelle Using Ecce
Helko Lehmann; Michael Leuschel
1-19
Predicate Synthesis from Inductive Proof Attempt of Faulty Conjectures
Francis Alexandre; Khaled Bsaïes; Moussa Demba
20-33
Correct OO Systems in Computational Logic
Kung-Kiu Lau; Mario Ornaghi
34-53
Specification and Synthesis of Hybrid Automata for Physics-Based Animation
Thomas Ellman
54-55
Adding Concrete Syntax to a Prolog-Based Program Synthesis System
Bernd Fischer; Eelco Visser
56-58
Formal Development and Verification of Approximation Algorithms Using Auxiliary Variables
Rudolf Berghammer; Markus Müller-Olm
59-74
Formal Reasoning about Efficient Data Structures: A Case Study in ACL2
José Luis Ruiz-Reina; José Antonio Alonso-Jiménez; María José Hidalgo; Francisco Jesús Martín-Mateos
75-91
A Program Transformation for Backwards Analysis of Logic Programs
John P. Gallagher
92-105
An Efficient Staging Algorithm for Binding-Time Analysis
Takuma Murakami; Zhenjiang Hu; Kazuhiko Kakehi; Masato Takeichi
106-107
Proving Termination with Adornments
Alexander Serebrenik; Danny De Schreye
108-109
Constructively Characterizing Fold and Unfold
Tjark Weber; James Caldwell
110-127
Deterministic Higher-Order Patterns for Program Transformation
Tetsuo Yokoyama; Zhenjiang Hu; Masato Takeichi
128-142
From Interpreter to Logic Engine by Defunctionalization
Dariusz Biernacki; Olivier Danvy
143-159
Linearization by Program Transformation
Sandra Alves; Mário Florido
160-175
Continuation Semantics as Horn Clauses
Qian Wang; Gopal Gupta
176-177
Simplification of Database Integrity Constraints Revisited: A Transformational Approach
Henning Christiansen; Davide Martinenghi
178-197
Integration and Optimization of Rule-Based Constraint Solvers
Slim Abdennadher; Thom Frühwirth
198-213
Introducing esra, a Relational Language for Modelling Combinatorial Problems
Pierre Flener; Justin Pearson; Magnus Ågren
214-232
Back Matter
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 20 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings