Abstract is missing.
- Inductive Theorem Proving by Program Specialisation: Generating Proofs for Isabelle Using EcceHelko Lehmann, Michael Leuschel. 1-19 [doi]
- Predicate Synthesis from Inductive Proof Attempt of Faulty ConjecturesFrancis Alexandre, Khaled Bsaïes, Moussa Demba. 20-33 [doi]
- Correct OO Systems in Computational LogicKung-Kiu Lau, Mario Ornaghi. 34-53 [doi]
- Specification and Synthesis of Hybrid Automata for Physics-Based AnimationThomas Ellman. 54-55 [doi]
- Adding Concrete Syntax to a Prolog-Based Program Synthesis System (Extended Abstract)Bernd Fischer, Eelco Visser. 56-58 [doi]
- Formal Development and Verification of Approximation Algorithms Using Auxiliary VariablesRudolf Berghammer, Markus Müller-Olm. 59-74 [doi]
- Formal Reasoning about Efficient Data Structures: A Case Study in ACL2José-Luis Ruiz-Reina, José Antonio Alonso Jimenez, María-José Hidalgo, Francisco-Jesús Martín-Mateos. 75-91 [doi]
- A Program Transformation for Backwards Analysis of Logic ProgramsJohn P. Gallagher. 92-105 [doi]
- An Efficient Staging Algorithm for Binding-Time AnalysisTakuma Murakami, Zhenjiang Hu, Kazuhiko Kakehi, Masato Takeichi. 106-107 [doi]
- Proving Termination with AdornmentsAlexander Serebrenik, Danny De Schreye. 108-109 [doi]
- Constructively Characterizing Fold and UnfoldTjark Weber, James L. Caldwell. 110-127 [doi]
- Deterministic Higher-Order Patterns for Program TransformationTetsuo Yokoyama, Zhenjiang Hu, Masato Takeichi. 128-142 [doi]
- From Interpreter to Logic Engine by DefunctionalizationDariusz Biernacki, Olivier Danvy. 143-159 [doi]
- Linearization by Program TransformationSandra Alves, Mário Florido. 160-175 [doi]
- Continuation Semantics as Horn ClausesQian Wang, Gopal Gupta. 176-177 [doi]
- Simplification of Database Integrity Constraints Revisited: A Transformational ApproachHenning Christiansen, Davide Martinenghi. 178-197 [doi]
- Integration and Optimization of Rule-Based Constraint SolversSlim Abdennadher, Thom W. Frühwirth. 198-213 [doi]
- Introducing esra, a Relational Language for Modelling Combinatorial ProblemsPierre Flener, Justin Pearson, Magnus Ågren. 214-232 [doi]