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]

@inproceedings{FereeHMMN18,
  title = {Formal proof of polynomial-time complexity with quasi-interpretations},
  author = {Hugo Férée and Samuel Hym and Micaela Mayero and Jean-Yves Moyen and David Nowak},
  year = {2018},
  doi = {10.1145/3167097},
  url = {http://doi.acm.org/10.1145/3167097},
  researchr = {https://researchr.org/publication/FereeHMMN18},
  cites = {0},
  citedby = {0},
  pages = {146-157},
  booktitle = {Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2018, Los Angeles, CA, USA, January 8-9, 2018},
  editor = {June Andronick and Amy P. Felty},
  publisher = {ACM},
  isbn = {978-1-4503-5586-5},
}