marks full paper refereed publications.
Adam Koprowski
Termination of Rewriting and Its Certification
PhD thesis, Eindhoven University of Technology, September 2008
Frédéric Blanqui and Adam Koprowski
CoLoR: Automated Verification of Certificates for Termination Proofs. (draft)
Adam Koprowski and Johannes Waldmann
Arctic Termination ... Below Zero.
In Proceedings of the 19th International Conference on Rewriting Techniques and Applications,
(RTA '08), Hagenberg, Austria.
Adam Koprowski and Hans Zantema
Certification of Proving Termination of Term Rewriting by Matrix Interpretations.
In Proceedings of the 34th International Conference on Current Trends in Theory and Practice of Computer Science,
(SOFSEM '08), Nový Smokovec, Slovakia.
Adam Koprowski and Aart Middeldorp
Predictive Labeling with Dependency Pairs using SAT.
In Proceedings of the 21st Conference on Automated Deduction,
(CADE '07), Bremen, Germany
Adam Koprowski and Hans Zantema
Certification of Matrix Interpretations in Coq.
In Proceedings of the 9th International Workshop on Termination,
(WST '07), Paris, France
Adam Koprowski
Coq formalization of the Higher-Order Recursive Path Ordering.
Technical Report CSR-06-21, Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands, August 2006
Adam Koprowski
A Formalization of the Simply Typed Lambda Calculus in Coq. (draft)
Adam Koprowski
Certified Higher-Order Recursive Path Ordering.
In Proceedings of the 17th International Conference on Rewriting Techniques and Applications, (RTA '06), Seattle, WA, USA.
Adam Koprowski and Hans Zantema
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems.
In Proceedings of the 3rd International Joint Conference on Automated Reasoning, (IJCAR '06), Seattle, WA, USA.
Adam Koprowski
TPA: Termination Proved Automatically.
In Proceedings of the 17th International Conference on Rewriting Techniques and Applications, (RTA '06), Seattle, WA, USA.
Frédéric Blanqui, William Delobel, Solange Coupet-Grimal, Sébastien Hinderer and Adam Koprowski
CoLoR, a Coq Library on Rewriting and termination.
In Proceedings of the 8th International Workshop on Termination, (WST '06), Seattle, WA, USA.
Adam Koprowski
Application of Rewriting Techniques to Verification Problems.
In IFM2005 Doctoral Symposium on Integrated Formal Methods
Technical Report CSR-05-29, Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands, November 2005
Adam Koprowski and Hans Zantema
Proving Liveness with Fairness using Rewriting.
In Proceedings of the 5th International Workshop on Frontiers of Combining Systems, (FroCoS '05), Vienna, Austria
Adam Koprowski
Well-foundedness of the Higher Order Recursive Path Ordering in Coq.
Master's Thesis printed as Technical Report TI-IR-004, Department of Theoretical Computer Science, Vrije Universiteit, Amsterdam, The Netherlands
Nicole de Kleijn, Adam Koprowski and Femke van Raamsdonk
Well-foundedness of the Recursive Path Ordering in Coq.
Dutch Proof Tools Day 2004, Program + Proceedings, University of Nijmegen, Nijmegen, The Netherlands, July 2004