| 2008 |
|---|
| 6 | EE | Adam Koprowski,
Hans Zantema:
Certification of Proving Termination of Term Rewriting by Matrix Interpretations.
SOFSEM 2008: 328-339 |
| 2007 |
|---|
| 5 | EE | Adam Koprowski,
Aart Middeldorp:
Predictive Labeling with Dependency Pairs Using SAT.
CADE 2007: 410-425 |
| 2006 |
|---|
| 4 | EE | Adam Koprowski,
Hans Zantema:
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems.
IJCAR 2006: 332-346 |
| 3 | EE | Adam Koprowski:
Certified Higher-Order Recursive Path Ordering.
RTA 2006: 227-241 |
| 2 | EE | Adam Koprowski:
TPA: Termination Proved Automatically.
RTA 2006: 257-266 |
| 2005 |
|---|
| 1 | EE | Adam Koprowski,
Hans Zantema:
Proving Liveness with Fairness Using Rewriting.
FroCos 2005: 232-247 |
