[ACM Press the 7th ACM SIGPLAN International Conference - Los Angeles, CA, USA (2018.01.08-2018.01.09)] Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018 - Formal proof of polynomial-time complexity with quasi-interpretations
Férée, Hugo; Hym, Samuel; Mayero, Micaela; Moyen, Jean-Yves; Nowak, David
- 作者Férée, Hugo; Hym, Samuel; Mayero, Micaela; Moyen, Jean-Yves; Nowak, David
- 文件大小749.09KB
- 发表时间2018
- DOI10.1145/3176245.3167097
- 页码146-157