47 citations · 60 across the 2 of their papers we have counts for
2 papers
cs.LO2012★ 47 cited
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates
Frédéric Blanqui, Adam Koprowski
Termination is an important property of programs; notably required for programs formulated in proof assistants. It is a very active subject of research in the Turing-complete forma…
cs.LO2011★ 13 cited
TRX: A Formally Verified Parser Interpreter
Adam Koprowski, Henri Binsztok
Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser inter…