Skip to Main content Skip to Navigation
Conference papers

Formal proof of polynomial-time complexity with quasi-interpretations

Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01712390
Contributor : David Nowak Connect in order to contact the contributor
Submitted on : Monday, February 19, 2018 - 2:32:17 PM
Last modification on : Wednesday, September 7, 2022 - 8:14:05 AM

Identifiers

Citation

Hugo Férée, Samuel Hym, Micaela Mayero, Jean-Yves Moyen, David Nowak. Formal proof of polynomial-time complexity with quasi-interpretations. 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2018, Jan 2018, Los Angeles, United States. ⟨10.1145/3167097⟩. ⟨hal-01712390⟩

Share

Metrics

Record views

110