Formal proof of polynomial-time complexity with quasi-interpretations

Hugo Férée, Samuel Hym, Micaela Mayero, Jean-Yves Moyen, David Nowak. Formal proof of polynomial-time complexity with quasi-interpretations. In June Andronick, Amy P. Felty, editors, Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2018, Los Angeles, CA, USA, January 8-9, 2018. pages 146-157, ACM, 2018. [doi]

Abstract

Abstract is missing.