Conferences in DBLP

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

1. Wim Vanhoof
   Searching Semantically Equivalent Code Fragments in Logic Programs. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2004, pp:1-18 [Conf]
   
2. Pedro López-García, Francisco Bueno, Manuel V. Hermenegildo
   Determinacy Analysis for Logic Programs Using Mode and Type Information. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2004, pp:19-35 [Conf]
   
3. Sandeep S. Kulkarni, Borzoo Bonakdarpour, Ali Ebnenasir
   Mechanical Verification of Automatic Synthesis of Fault-Tolerant Programs. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2004, pp:36-52 [Conf]
   
4. Stephen-John Craig, John P. Gallagher, Michael Leuschel, Kim S. Henriksen
   Fully Automatic Binding-Time Analysis for Prolog. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2004, pp:53-68 [Conf]
   
5. Jonathan Moody
   Logical Mobility and Locality Types. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2004, pp:69-84 [Conf]
   
6. Annalisa Bossi, Carla Piazza, Sabina Rossi
   Unwinding Conditions for Security in Imperative Languages. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2004, pp:85-100 [Conf]
   
7. Santiago Escobar, José Meseguer, Prasanna Thati
   Natural Rewriting for General Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2004, pp:101-116 [Conf]
   
8. Taisuke Sato, Yoshitaka Kameya
   Negation Elimination for Finite PCFGs. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2004, pp:117-132 [Conf]
   
9. Thom W. Frühwirth
   Specialization of Concurrent Guarded Multi-set Transformation Rules. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2004, pp:133-148 [Conf]
   
10. Germán Puebla, Elvira Albert, Manuel V. Hermenegildo
    Efficient Local Unfolding with Ancestor Stacks for Full Prolog. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2004, pp:149-165 [Conf]
    
11. Michael Colón
    Schema-Guided Synthesis of Imperative Programs by Constraint Solving. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2004, pp:166-181 [Conf]
    
12. Bernd Brassel, Michael Hanus, Frank Huch, Josep Silva, Germán Vidal
    Run-Time Profiling of Functional Logic Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2004, pp:182-197 [Conf]
    
13. Kung-Kiu Lau, Alberto Momigliano, Mario Ornaghi
    Constructive Specifications for Compositional Units. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2004, pp:198-214 [Conf]
    
14. M. R. K. Krishna Rao
    Input-Termination of Logic Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2004, pp:215-230 [Conf]
    
15. Alexander Serebrenik, Frédéric Mesnard
    On Termination of Binary CLP Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2004, pp:231-244 [Conf]
    
16. Mads Sig Ager
    From Natural Semantics to Abstract Machines. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2004, pp:245-261 [Conf]
    
17. J. B. Wells, Boris Yakobowski
    Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2004, pp:262-277 [Conf]