


default search action
13th LOPSTR 2003: Uppsala, Sweden
- Maurice Bruynooghe:

Logic Based Program Synthesis and Transformation, 13th International Symposium LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected Papers. Lecture Notes in Computer Science 3018, Springer 2004, ISBN 3-540-22174-3
Invited Talk
- Helko Lehmann, Michael Leuschel:

Inductive Theorem Proving by Program Specialisation: Generating Proofs for Isabelle Using Ecce. 1-19
Specification and Synthesis
- Francis Alexandre, Khaled Bsaïes, Moussa Demba:

Predicate Synthesis from Inductive Proof Attempt of Faulty Conjectures. 20-33 - Kung-Kiu Lau, Mario Ornaghi:

Correct OO Systems in Computational Logic. 34-53 - Thomas Ellman:

Specification and Synthesis of Hybrid Automata for Physics-Based Animation. 54-55 - Bernd Fischer, Eelco Visser

:
Adding Concrete Syntax to a Prolog-Based Program Synthesis System (Extended Abstract). 56-58
Verification
- Rudolf Berghammer, Markus Müller-Olm:

Formal Development and Verification of Approximation Algorithms Using Auxiliary Variables. 59-74 - José-Luis Ruiz-Reina, José Antonio Alonso Jimenez, María-José Hidalgo, Francisco-Jesús Martín-Mateos:

Formal Reasoning about Efficient Data Structures: A Case Study in ACL2. 75-91
Analysis
- John P. Gallagher:

A Program Transformation for Backwards Analysis of Logic Programs. 92-105 - Takuma Murakami, Zhenjiang Hu, Kazuhiko Kakehi, Masato Takeichi:

An Efficient Staging Algorithm for Binding-Time Analysis. 106-107 - Alexander Serebrenik, Danny De Schreye:

Proving Termination with Adornments. 108-109
Transformation and Specialisation
- Tjark Weber, James L. Caldwell

:
Constructively Characterizing Fold and Unfold. 110-127 - Tetsuo Yokoyama, Zhenjiang Hu, Masato Takeichi:

Deterministic Higher-Order Patterns for Program Transformation. 128-142 - Dariusz Biernacki, Olivier Danvy

:
From Interpreter to Logic Engine by Defunctionalization. 143-159 - Sandra Alves

, Mário Florido
:
Linearization by Program Transformation. 160-175 - Qian Wang, Gopal Gupta:

Continuation Semantics as Horn Clauses. 176-177
Constraints
- Henning Christiansen

, Davide Martinenghi
:
Simplification of Database Integrity Constraints Revisited: A Transformational Approach. 178-197 - Slim Abdennadher, Thom W. Frühwirth:

Integration and Optimization of Rule-Based Constraint Solvers. 198-213 - Pierre Flener, Justin Pearson, Magnus Ågren:

Introducing esra, a Relational Language for Modelling Combinatorial Problems. 214-232

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














