Search the dblp DataBase

Publications of Author

1. Jürgen Giesl, Peter Schneider-Kamp, René Thiemann
   Automatic Termination Proofs in the Dependency Pair Framework. [Citation Graph (0, 0)][DBLP]
   IJCAR, 2006, pp:281-286 [Conf]
   
2. René Thiemann, Jürgen Giesl, Peter Schneider-Kamp
   Improved Modular Termination Proofs Using Dependency Pairs. [Citation Graph (0, 0)][DBLP]
   IJCAR, 2004, pp:75-90 [Conf]
   
3. Jürgen Giesl, René Thiemann, Peter Schneider-Kamp
   Proving and Disproving Termination in the Dependency Pair Framework. [Citation Graph (0, 0)][DBLP]
   Deduction and Applications, 2005, pp:- [Conf]
   
4. Jürgen Giesl, René Thiemann, Peter Schneider-Kamp
   Proving and Disproving Termination of Higher-Order Functions. [Citation Graph (0, 0)][DBLP]
   FroCos, 2005, pp:216-231 [Conf]
   
5. Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann
   Automated Termination Analysis for Logic Programs by Term Rewriting. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2006, pp:177-193 [Conf]
   
6. Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl
   SAT Solving for Argument Filterings. [Citation Graph (0, 0)][DBLP]
   LPAR, 2006, pp:30-44 [Conf]
   
7. Jürgen Giesl, René Thiemann, Peter Schneider-Kamp
   The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. [Citation Graph (0, 0)][DBLP]
   LPAR, 2004, pp:301-331 [Conf]
   
8. Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke
   Improving Dependency Pairs. [Citation Graph (0, 0)][DBLP]
   LPAR, 2003, pp:167-182 [Conf]
   
9. Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann
   Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages. [Citation Graph (0, 0)][DBLP]
   RTA, 2006, pp:297-312 [Conf]
   
10. Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke
    Automated Termination Proofs with AProVE. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:210-220 [Conf]
    
11. René Thiemann, Jürgen Giesl
    Size-Change Termination for Term Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 2003, pp:264-278 [Conf]
    
12. René Thiemann, Jürgen Giesl
    The size-change principle and dependency pairs for termination of term rewriting. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2005, v:16, n:4, pp:229-270 [Journal]
    
13. Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke
    Mechanizing and Improving Dependency Pairs. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2006, v:37, n:3, pp:155-203 [Journal]
    
14. Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp
    Proving Termination by Bounded Increase. [Citation Graph (0, 0)][DBLP]
    CADE, 2007, pp:443-459 [Conf]
    
15. Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl
    Proving Termination Using Recursive Path Orders and SAT Solving. [Citation Graph (0, 0)][DBLP]
    FroCos, 2007, pp:267-282 [Conf]
    
16. Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl
    SAT Solving for Termination Analysis with Polynomial Interpretations. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:340-354 [Conf]
    
17. Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl
    SAT Solving for Argument Filterings [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
    
18. 
    Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs. [Citation Graph (, )][DBLP]
    
    
19. 
    Implementing RPO and POLO using SAT. [Citation Graph (, )][DBLP]
    
    
20. 
    Termination of Programs using Term Rewriting and SAT Solving. [Citation Graph (, )][DBLP]
    
    
21. 
    Decision Procedures for Loop Detection. [Citation Graph (, )][DBLP]
    
    
22. 
    Improving Context-Sensitive Dependency Pairs. [Citation Graph (, )][DBLP]
    
    
23. 
    Maximal Termination. [Citation Graph (, )][DBLP]
    
    
24. 
    Loops under Strategies. [Citation Graph (, )][DBLP]
    
    
25. 
    Deciding Innermost Loops. [Citation Graph (, )][DBLP]
    
    
26. 
    Certified Subterm Criterion and Certified Usable Rules. [Citation Graph (, )][DBLP]
    
    
27. 
    From Outermost Termination to Innermost Termination. [Citation Graph (, )][DBLP]
    
    
28. 
    Certification of Termination Proofs Using CeTA. [Citation Graph (, )][DBLP]
    
    
29. 
    Adding constants to string rewriting. [Citation Graph (, )][DBLP]
    
    
30. 
    Automated Termination Proofs for Logic Programs by Term Rewriting [Citation Graph (, )][DBLP]
    
    
31. 
    Automated Termination Analysis for Logic Programs with Cut [Citation Graph (, )][DBLP]
    
    
32. 
    Innermost Termination of Rewrite Systems by Labeling. [Citation Graph (, )][DBLP]