Formal proof of polynomial-time complexity with quasi-interpretations-Reference-Cited by-同舟云学术

Formal proof of polynomial-time complexity with quasi-interpretations

Published:2018 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018
language:
Short-container-title:

Author:

Férée Hugo¹,Hym Samuel²,Mayero Micaela³,Moyen Jean-Yves⁴,Nowak David⁵

Affiliation:

1. University of Kent, UK

2. University of Lille, France

3. University of Paris 13, France

4. University of Copenhagen, Denmark

5. CNRS, France / University of Lille, France

Funder

EPSRC

Marie Sklodowska--Curie action Walgoa, program H2020-MSCA-IF-2014

Publisher

ACM Press

Reference31 articles.

1. Reynald Affeldt, Miki Tanaka, and Nicolas Marti. 2007. Formal Proof of Provable Security by Game-Playing in a Proof Assistant. In Provable Security, First International Conference, ProvSec 2007, Wollongong, Australia, November 1-2, 2007, Proceedings (Lecture Notes in Computer Science), Willy Susilo, Joseph K. Liu, and Yi Mu (Eds.), Vol. 4784. Springer, 151–168.

2. Martin Avanzini, Georg Moser, and Michael Schaper. 2016. TcT: Tyrolean Complexity Tool. In Tools and Algorithms for the Construction and Analysis of Systems - 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings (Lecture Notes in Computer Science), Marsha Chechik and Jean-François Raskin (Eds.), Vol. 9636. Springer, 407–423.

3. Patrick Baillot, Gilles Barthe, and Ugo Dal Lago. 2015. Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs. In Logic for Programming, Artificial Intelligence, and Reasoning - 20th International Conference, LPAR-20 2015, Suva, Fiji, November 24-28, 2015, Proceedings (Lecture Notes in Computer Science), Martin Davis, Ansgar Fehnker, Annabelle McIver, and Andrei Voronkov (Eds.), Vol. 9450. Springer, 203–218.

4. Patrick Baillot, Ugo Dal Lago, and Jean-Yves Moyen. 2012. On quasiinterpretations, blind abstractions and implicit complexity. Mathematical Structures in Computer Science 22, 4 (2012), 549–580.

5. Gilles Barthe, Juan Manuel Crespo, Benjamin Grégoire, César Kunz, and Santiago Zanella Béguelin. 2012. Computer-Aided Cryptographic Proofs. In Interactive Theorem Proving - Third International Conference, ITP 2012, Princeton, NJ, USA, August 13-15, 2012. Proceedings (Lecture Notes in Computer Science), Lennart Beringer and Amy P. Felty (Eds.), Vol. 7406. Springer, 11–27.