Adam Koprowski

According to our database1, Adam Koprowski authored at least 12 papers between 2005 and 2011.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates.
Math. Struct. Comput. Sci., 2011

TRX: A Formally Verified Parser Interpreter
Log. Methods Comput. Sci., 2011

2010
Automated Machine-Checked Hybrid System Safety Proofs.
Proceedings of the Interactive Theorem Proving, First International Conference, 2010

2009
Max/Plus Tree Automata for Termination of Term Rewriting.
Acta Cybern., 2009

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

2008
Certification of Proving Termination of Term Rewriting by Matrix Interpretations.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

Arctic Termination ...Below Zero.
Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

2007
Predictive Labeling with Dependency Pairs Using SAT.
Proceedings of the Automated Deduction, 2007

2006
TPA: Termination Proved Automatically.
Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

Certified Higher-Order Recursive Path Ordering.
Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems.
Proceedings of the Automated Reasoning, Third International Joint Conference, 2006

2005
Proving Liveness with Fairness Using Rewriting.
Proceedings of the Frontiers of Combining Systems, 5th International Workshop, 2005


  Loading...