- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| i1 |      | |
| 2011 | ||
| j4 | | Adam Koprowski, Henri Binsztok: TRX: A Formally Verified Parser Interpreter. Logical Methods in Computer Science 7(2) (2011) |
| j3 | | 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 | ||
| c9 | | |
| c8 | | Herman Geuvers, Adam Koprowski, Dan Synek, Eelis van der Weegen: Automated Machine-Checked Hybrid System Safety Proofs. ITP 2010: 259-274 |
| 2009 | ||
| j2 | | Adam Koprowski: Coq formalization of the higher-order recursive path ordering. Appl. Algebra Eng. Commun. Comput. 20(5-6): 379-425 (2009) |
| j1 | | Adam Koprowski, Johannes Waldmann: Max/Plus Tree Automata for Termination of Term Rewriting. Acta Cybern. 19(2): 357-392 (2009) |
| 2008 | ||
| c7 | | |
| c6 | | Adam Koprowski, Hans Zantema: Certification of Proving Termination of Term Rewriting by Matrix Interpretations. SOFSEM 2008: 328-339 |
| 2007 | ||
| c5 | | Adam Koprowski, Aart Middeldorp: Predictive Labeling with Dependency Pairs Using SAT. CADE 2007: 410-425 |
| 2006 | ||
| c4 | | Adam Koprowski, Hans Zantema: Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems. IJCAR 2006: 332-346 |
| c3 | | |
| c2 | | |
| 2005 | ||
| c1 | | |
| 1 | Henri Binsztok | |
| 2 | Frédéric Blanqui | |
| 3 | Herman Geuvers | |
| 4 | Aart Middeldorp | |
| 5 | Dan Synek | |
| 6 | Johannes Waldmann | |
| 7 | Eelis van der Weegen | |
| 8 | Hans Zantema |
Data released under the ODC-BY 1.0 license — See also our legal information page