Search the dblp DataBase

Publications of Author

1. Adam Koprowski, Hans Zantema
   Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems. [Citation Graph (0, 0)][DBLP]
   IJCAR, 2006, pp:332-346 [Conf]
   
2. Adam Koprowski, Hans Zantema
   Proving Liveness with Fairness Using Rewriting. [Citation Graph (0, 0)][DBLP]
   FroCos, 2005, pp:232-247 [Conf]
   
3. Adam Koprowski
   Certified Higher-Order Recursive Path Ordering. [Citation Graph (0, 0)][DBLP]
   RTA, 2006, pp:227-241 [Conf]
   
4. Adam Koprowski
   TPA: Termination Proved Automatically. [Citation Graph (0, 0)][DBLP]
   RTA, 2006, pp:257-266 [Conf]
   
5. Adam Koprowski, Aart Middeldorp
   Predictive Labeling with Dependency Pairs Using SAT. [Citation Graph (0, 0)][DBLP]
   CADE, 2007, pp:410-425 [Conf]
   
6. 
   TRX: A Formally Verified Parser Interpreter. [Citation Graph (, )][DBLP]
   
   
7. 
   Arctic Termination ...Below Zero. [Citation Graph (, )][DBLP]
   
   
8. 
   Certification of Proving Termination of Term Rewriting by Matrix Interpretations. [Citation Graph (, )][DBLP]
   
   
9. 
   Automated Machine-Checked Hybrid System Safety Proofs. [Citation Graph (, )][DBLP]
   
   
10. 
    Coq formalization of the higher-order recursive path ordering. [Citation Graph (, )][DBLP]
    
    
11. 
    Max/Plus Tree Automata for Termination of Term Rewriting. [Citation Graph (, )][DBLP]