1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.LO2022
Unboundedness for Recursion Schemes: A Simpler Type System
David Barozzini, Paweł Parys, Jan Wróblewski
Decidability of the problems of unboundedness and simultaneous unboundedness (aka. the diagonal problem) for higher-order recursion schemes was established by Clemente, Parys, Salv…
cs.FL2020★ 1 cited
Cost Automata, Safe Schemes, and Downward Closures
David Barozzini, Lorenzo Clemente, Thomas Colcombet +1
In this work we prove decidability of the model-checking problem for safe recursion schemes against properties defined by alternating B-automata. We then exploit this result to sho…