Proving Liveness with Fairness Using Rewriting. - Adam Koprowski; Hans Zantema (FroCoS, 2005)

Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems. - Adam Koprowski; Hans Zantema (IJCAR, 2006)

Certified Higher-Order Recursive Path Ordering. - Adam Koprowski (RTA, 2006)

TPA: Termination Proved Automatically. - Adam Koprowski (RTA, 2006)

Predictive Labeling with Dependency Pairs Using SAT. - Adam Koprowski; Aart Middeldorp (CADE, 2007)

Arctic Termination ...Below Zero. - Adam Koprowski; Johannes Waldmann (RTA, 2008)

Certification of Proving Termination of Term Rewriting by Matrix Interpretations. - Adam Koprowski; Hans Zantema (SOFSEM, 2008)

Coq formalization of the higher-order recursive path ordering. - Adam Koprowski (Appl. Algebra Eng. Commun. Comput., 2009)

Max/Plus Tree Automata for Termination of Term Rewriting. - Adam Koprowski; Johannes Waldmann (Acta Cybern., 2009)

Automated Machine-Checked Hybrid System Safety Proofs. - Herman Geuvers; Adam Koprowski; Dan Synek; Eelis van der Weegen (ITP, 2010)

TRX: A Formally Verified Parser Interpreter - Adam Koprowski; Henri Binsztok (Log. Methods Comput. Sci., 2011)

CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates. - Frédéric Blanqui; Adam Koprowski (Math. Struct. Comput. Sci., 2011)