 | 2012 |
|---|
| 14 |       | Frédéric Blanqui,
Adam Koprowski:
CoLoR: a Coq library on
CoRR abs/1202.6473: (2012) |
| 2011 |
|---|
| 13 | | Adam Koprowski,
Henri Binsztok:
TRX: A Formally Verified Parser Interpreter
Logical Methods in Computer Science 7(2): (2011) |
| 12 | | Frédéric Blanqui,
Adam Koprowski:
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates.
Mathematical Structures in Computer Science 21(4): 827-859 (2011) |
| 2010 |
|---|
| 11 | | Adam Koprowski,
Henri Binsztok:
TRX: A Formally Verified Parser Interpreter.
ESOP 2010: 345-365 |
| 10 | | Herman Geuvers,
Adam Koprowski,
Dan Synek,
Eelis van der Weegen:
Automated Machine-Checked Hybrid System Safety Proofs.
ITP 2010: 259-274 |
| 2009 |
|---|
| 9 | | Adam Koprowski,
Johannes Waldmann:
Max/Plus Tree Automata for Termination of Term Rewriting.
Acta Cybern. 19(2): 357-392 (2009) |
| 8 | | Adam Koprowski:
Coq formalization of the higher-order recursive path ordering.
Appl. Algebra Eng. Commun. Comput. 20(5-6): 379-425 (2009) |
| 2008 |
|---|
| 7 | | Adam Koprowski,
Johannes Waldmann:
Arctic Termination ...Below Zero.
RTA 2008: 202-216 |
| 6 | | Adam Koprowski,
Hans Zantema:
Certification of Proving Termination of Term Rewriting by Matrix Interpretations.
SOFSEM 2008: 328-339 |
| 2007 |
|---|
| 5 | | Adam Koprowski,
Aart Middeldorp:
Predictive Labeling with Dependency Pairs Using SAT.
CADE 2007: 410-425 |
| 2006 |
|---|
| 4 | | Adam Koprowski,
Hans Zantema:
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems.
IJCAR 2006: 332-346 |
| 3 | | Adam Koprowski:
Certified Higher-Order Recursive Path Ordering.
RTA 2006: 227-241 |
| 2 | | Adam Koprowski:
TPA: Termination Proved Automatically.
RTA 2006: 257-266 |
| 2005 |
|---|
| 1 | | Adam Koprowski,
Hans Zantema:
Proving Liveness with Fairness Using Rewriting.
FroCos 2005: 232-247 |
Data released under the ODC-BY 1.0 license — See also our legal information page