×

zbMATH — the first resource for mathematics

Koprowski, Adam

Compute Distance To:
Author ID: koprowski.adam Recent zbMATH articles by "Koprowski, Adam"
Published as: Koprowski, Adam
External Links: MGP
Documents Indexed: 12 Publications since 2005

Publications by Year

Citations contained in zbMATH Open

12 Publications have been cited 55 times in 42 Documents Cited by Year
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verifications of termination certificates. Zbl 1223.68101
Blanqui, Frédéric; Koprowski, Adam
12
2011
TPA: termination proved automatically. Zbl 1151.68635
Koprowski, Adam
9
2006
Arctic termination \(\dots \) below zero. Zbl 1145.68450
Koprowski, Adam; Waldmann, Johannes
7
2008
TRX: a formally verified parser interpreter. Zbl 1260.68194
Koprowski, Adam; Binsztok, Henri
6
2010
Max/Plus tree automata for termination of term rewriting. Zbl 1224.68041
Koprowski, Adam; Waldmann, Johannes
4
2009
Certification of proving termination of term rewriting by matrix interpretations. Zbl 1132.68431
Koprowski, Adam; Zantema, Hans
4
2008
Predictive labeling with dependency pairs using SAT. Zbl 1213.68349
Koprowski, Adam; Middeldorp, Aart
4
2007
Automation of recursive path ordering for infinite labelled rewrite systems. Zbl 1222.68366
Koprowski, Adam; Zantema, Hans
3
2006
Certified higher-order recursive path ordering. Zbl 1151.68634
Koprowski, Adam
2
2006
Proving liveness with fairness using rewriting. Zbl 1171.68513
Koprowski, Adam; Zantema, Hans
2
2005
Automated machine-checked hybrid system safety proofs. Zbl 1291.68343
Geuvers, Herman; Koprowski, Adam; Synek, Dan; van der Weegen, Eelis
1
2010
Coq formalization of the higher-order recursive path ordering. Zbl 1185.68628
Koprowski, Adam
1
2009
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verifications of termination certificates. Zbl 1223.68101
Blanqui, Frédéric; Koprowski, Adam
12
2011
TRX: a formally verified parser interpreter. Zbl 1260.68194
Koprowski, Adam; Binsztok, Henri
6
2010
Automated machine-checked hybrid system safety proofs. Zbl 1291.68343
Geuvers, Herman; Koprowski, Adam; Synek, Dan; van der Weegen, Eelis
1
2010
Max/Plus tree automata for termination of term rewriting. Zbl 1224.68041
Koprowski, Adam; Waldmann, Johannes
4
2009
Coq formalization of the higher-order recursive path ordering. Zbl 1185.68628
Koprowski, Adam
1
2009
Arctic termination \(\dots \) below zero. Zbl 1145.68450
Koprowski, Adam; Waldmann, Johannes
7
2008
Certification of proving termination of term rewriting by matrix interpretations. Zbl 1132.68431
Koprowski, Adam; Zantema, Hans
4
2008
Predictive labeling with dependency pairs using SAT. Zbl 1213.68349
Koprowski, Adam; Middeldorp, Aart
4
2007
TPA: termination proved automatically. Zbl 1151.68635
Koprowski, Adam
9
2006
Automation of recursive path ordering for infinite labelled rewrite systems. Zbl 1222.68366
Koprowski, Adam; Zantema, Hans
3
2006
Certified higher-order recursive path ordering. Zbl 1151.68634
Koprowski, Adam
2
2006
Proving liveness with fairness using rewriting. Zbl 1171.68513
Koprowski, Adam; Zantema, Hans
2
2005

Citations by Year