Conferences in DBLP

International Workshop on Logic Program Synthesis and Transformation (LOPSTR) (lopstr)
2003 (conf/lopstr/2003)

1. Helko Lehmann, Michael Leuschel
   Inductive Theorem Proving by Program Specialisation: Generating Proofs for Isabelle Using Ecce. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2003, pp:1-19 [Conf]
   
2. Francis Alexandre, Khaled Bsaïes, Moussa Demba
   Predicate Synthesis from Inductive Proof Attempt of Faulty Conjectures. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2003, pp:20-33 [Conf]
   
3. Kung-Kiu Lau, Mario Ornaghi
   Correct OO Systems in Computational Logic. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2003, pp:34-53 [Conf]
   
4. Thomas Ellman
   Specification and Synthesis of Hybrid Automata for Physics-Based Animation. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2003, pp:54-55 [Conf]
   
5. Bernd Fischer, Eelco Visser
   Adding Concrete Syntax to a Prolog-Based Program Synthesis System (Extended Abstract). [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2003, pp:56-58 [Conf]
   
6. Rudolf Berghammer, Markus Müller-Olm
   Formal Development and Verification of Approximation Algorithms Using Auxiliary Variables. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2003, pp:59-74 [Conf]
   
7. 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. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2003, pp:75-91 [Conf]
   
8. John P. Gallagher
   A Program Transformation for Backwards Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2003, pp:92-105 [Conf]
   
9. Takuma Murakami, Zhenjiang Hu, Kazuhiko Kakehi, Masato Takeichi
   An Efficient Staging Algorithm for Binding-Time Analysis. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2003, pp:106-107 [Conf]
   
10. Alexander Serebrenik, Danny De Schreye
    Proving Termination with Adornments. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2003, pp:108-109 [Conf]
    
11. Tjark Weber, James L. Caldwell
    Constructively Characterizing Fold and Unfold. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2003, pp:110-127 [Conf]
    
12. Tetsuo Yokoyama, Zhenjiang Hu, Masato Takeichi
    Deterministic Higher-Order Patterns for Program Transformation. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2003, pp:128-142 [Conf]
    
13. Dariusz Biernacki, Olivier Danvy
    From Interpreter to Logic Engine by Defunctionalization. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2003, pp:143-159 [Conf]
    
14. Sandra Alves, Mário Florido
    Linearization by Program Transformation. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2003, pp:160-175 [Conf]
    
15. Qian Wang, Gopal Gupta
    Continuation Semantics as Horn Clauses. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2003, pp:176-177 [Conf]
    
16. Henning Christiansen, Davide Martinenghi
    Simplification of Database Integrity Constraints Revisited: A Transformational Approach. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2003, pp:178-197 [Conf]
    
17. Slim Abdennadher, Thom W. Frühwirth
    Integration and Optimization of Rule-Based Constraint Solvers. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2003, pp:198-213 [Conf]
    
18. Pierre Flener, Justin Pearson, Magnus Ågren
    Introducing esra, a Relational Language for Modelling Combinatorial Problems. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2003, pp:214-232 [Conf]