Adam Koprowski

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verifications of termination certificates Mathematical Structures in Computer Science	2011-10-21	Paper
Max/Plus tree automata for termination of term rewriting	2011-02-22	Paper
Automated Machine-Checked Hybrid System Safety Proofs Interactive Theorem Proving	2010-09-14	Paper
TRX: a formally verified parser interpreter Programming Languages and Systems	2010-05-04	Paper
Coq formalization of the higher-order recursive path ordering Applicable Algebra in Engineering, Communication and Computing	2010-01-18	Paper
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems Automated Reasoning	2009-03-12	Paper
Predictive Labeling with Dependency Pairs Using SAT Automated Deduction – CADE-21	2009-03-06	Paper
TPA: Termination Proved Automatically Lecture Notes in Computer Science	2008-09-25	Paper
Certified Higher-Order Recursive Path Ordering Lecture Notes in Computer Science	2008-09-25	Paper
Arctic Termination ...Below Zero Rewriting Techniques and Applications	2008-08-28	Paper
Certification of Proving Termination of Term Rewriting by Matrix Interpretations SOFSEM 2008: Theory and Practice of Computer Science	2008-03-07	Paper
Frontiers of Combining Systems Lecture Notes in Computer Science	2006-10-10	Paper

Research outcomes over time

This page was built for person: Adam Koprowski