Search the dblp DataBase

Publications of Author

1. Harald Zankl, Aart Middeldorp
   Satisfying KBO Constraints. [Citation Graph (0, 0)][DBLP]
   RTA, 2007, pp:389-403 [Conf]
   
2. 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]
   
3. Harald Zankl, Nao Hirokawa, Aart Middeldorp
   Constraints for Argument Filterings. [Citation Graph (0, 0)][DBLP]
   SOFSEM (1), 2007, pp:579-590 [Conf]
   
4. Harald Zankl
   SAT Techniques for Lexicographic Path Orders [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
5. Harald Zankl, Aart Middeldorp
   Satisfying KBO Constraints [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
6. 
   Increasing Interpretations. [Citation Graph (, )][DBLP]
   
   
7. 
   Monotonicity Criteria for Polynomial Interpretations over the Naturals. [Citation Graph (, )][DBLP]
   
   
8. 
   Implementing RPO and POLO using SAT. [Citation Graph (, )][DBLP]
   
   
9. 
   Uncurrying for Termination. [Citation Graph (, )][DBLP]
   
   
10. 
    Tyrolean Termination Tool 2. [Citation Graph (, )][DBLP]
    
    
11. 
    Maximal Termination. [Citation Graph (, )][DBLP]
    
    
12. 
    Modular Complexity Analysis via Relative Complexity. [Citation Graph (, )][DBLP]
    
    
13. 
    Finding and Certifying Loops. [Citation Graph (, )][DBLP]
    
    
14. 
    Increasing interpretations. [Citation Graph (, )][DBLP]
    
    
15. 
    Transforming SAT into Termination of Rewriting. [Citation Graph (, )][DBLP]