Adam Koprowski

14 papers A 3B 2Journal 5Unranked 4
YearRankTypeTitle / Venue / Authors
2012 J jnl
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates.
CoRR
Frédéric Blanqui, Adam Koprowski
2011 J jnl
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates.
Math. Struct. Comput. Sci.
Frédéric Blanqui, Adam Koprowski
2011 J jnl
TRX: A Formally Verified Parser Interpreter
Log. Methods Comput. Sci.
Adam Koprowski, Henri Binsztok
2010 B conf
Automated Machine-Checked Hybrid System Safety Proofs.
ITP
Herman Geuvers, Adam Koprowski, Dan Synek, Eelis van der Weegen
2010 A conf
TRX: A Formally Verified Parser Interpreter.
ESOP
Adam Koprowski, Henri Binsztok
2009 J jnl
Coq formalization of the higher-order recursive path ordering.
Appl. Algebra Eng. Commun. Comput.
Adam Koprowski
2009 J jnl
Max/Plus Tree Automata for Termination of Term Rewriting.
Acta Cybern.
Adam Koprowski, Johannes Waldmann
2008 — conf
Arctic Termination ...Below Zero.
RTA
Adam Koprowski, Johannes Waldmann
2008 B conf
Certification of Proving Termination of Term Rewriting by Matrix Interpretations.
SOFSEM
Adam Koprowski, Hans Zantema
2007 A conf
Predictive Labeling with Dependency Pairs Using SAT.
CADE
Adam Koprowski, Aart Middeldorp
2006 A conf
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems.
IJCAR
Adam Koprowski, Hans Zantema
2006 — conf
Certified Higher-Order Recursive Path Ordering.
RTA
Adam Koprowski
2006 — conf
TPA: Termination Proved Automatically.
RTA
Adam Koprowski
2005 — conf
Proving Liveness with Fairness Using Rewriting.
FroCoS
Adam Koprowski, Hans Zantema