| System and method for creating a parser generator and associated computer program H Binsztok, A Koprowski US Patent App. 13/384,326, 2012 | 193 | 2012 |
| CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates F Blanqui, A Koprowski Mathematical Structures in Computer Science 21 (4), 827-859, 2011 | 83 | 2011 |
| TRX: A formally verified parser interpreter A Koprowski, H Binsztok Logical Methods in Computer Science 7, 2011 | 68 | 2011 |
| CoLoR: a Coq Library on Rewriting and termination F Blanqui, S Coupet-Grimal, W Delobel, S Hinderer, A Koprowski Eighth International Workshop on Termination-WST 2006, 2006 | 66 | 2006 |
| Arctic termination... below zero A Koprowski, J Waldmann International Conference on Rewriting Techniques and Applications, 202-216, 2008 | 55 | 2008 |
| Max/plus tree automata for termination of term rewriting A Koprowski, J Waldmann Acta Cybernetica 19 (2), 357-392, 2009 | 39 | 2009 |
| TPA: Termination proved automatically A Koprowski Term Rewriting and Applications: 17th International Conference, RTA 2006 …, 2006 | 39 | 2006 |
| Automation of recursive path ordering for infinite labelled rewrite systems A Koprowski, H Zantema Automated Reasoning: Third International Joint Conference, IJCAR 2006 …, 2006 | 21 | 2006 |
| Predictive labeling with dependency pairs using SAT A Koprowski, A Middeldorp International Conference on Automated Deduction, 410-425, 2007 | 17 | 2007 |
| Automated machine-checked hybrid system safety proofs H Geuvers, A Koprowski, D Synek, E van der Weegen Interactive Theorem Proving: First International Conference, ITP 2010 …, 2010 | 16 | 2010 |
| Coq formalization of the higher-order recursive path ordering A Koprowski Applicable Algebra in Engineering, Communication and Computing 20, 379-425, 2009 | 14 | 2009 |
| Certified higher-order recursive path ordering A Koprowski Term Rewriting and Applications: 17th International Conference, RTA 2006 …, 2006 | 13 | 2006 |
| Proving liveness with fairness using rewriting A Koprowski, H Zantema Frontiers of Combining Systems: 5th International Workshop, FroCoS 2005 …, 2005 | 11 | 2005 |
| Termination of rewriting and its certification A Koprowski | 10 | 2008 |
| Opa: Up and Running: Rapid and Secure Web Development H Binsztok, A Koprowski, I Swarczewskaja " O'Reilly Media, Inc.", 2013 | 9 | 2013 |
| Certification of proving termination of term rewriting by matrix interpretations A Koprowski, H Zantema International Conference on Current Trends in Theory and Practice of …, 2008 | 9 | 2008 |
| Well-foundedness of the higher-order recursive path ordering in Coq A Koprowski Master thesis, Free University of Amsterdam (The Netherlands) and Warsaw …, 2004 | 9 | 2004 |
| Certification of matrix interpretations in Coq A Koprowski, H Zantema 9th WST, 2007 | 2 | 2007 |
| A Formalization of the Simply Typed Lambda Calculus in Coq A Koprowski INRIA: Le Chesnay-Rocquencourt, France, 2006 | 2 | 2006 |
| Well-foundedness of the recursive path ordering in Coq N de Kleijn, A Koprowski, F van Raamsdonk Dutch Proof Tools Day 2004, 53, 2004 | 1 | 2004 |
hans zantemaEindhoven university of technology在 tue.nl 的电子邮件经过验证
hans zantemaEindhoven university of technology在 tue.nl 的电子邮件经过验证
Herman GeuversRadboud University Nijmegen, the Netherlands在 cs.ru.nl 的电子邮件经过验证