Resource Analysis by Sup-interpretation. - Jean-Yves Marion; Romain Péchoux (FLOPS, 2006)

A Characterization of Alternating Log Time by First Order Functional Programs. - Guillaume Bonfante; Jean-Yves Marion; Romain Péchoux (LPAR, 2006)

Quasi-friendly sup-interpretations - Jean-Yves Marion; Romain Péchoux (CoRR, 2006)

Quasi-interpretation Synthesis by Decomposition. - Guillaume Bonfante; Jean-Yves Marion; Romain Péchoux (ICTAC, 2007)

Resource control of object-oriented programs - Jean-Yves Marion; Romain Péchoux (CoRR, 2007)

Analyse de la complexité des programmes par interprétation sémantique. (Program complexity analysis by semantics interpretation). - Romain Péchoux (2007)

Analyzing the Implicit Computational Complexity of object-oriented programs. - Jean-Yves Marion; Romain Péchoux (FSTTCS, 2008)

Characterizations of polynomial complexity classes with a better intensionality. - Jean-Yves Marion; Romain Péchoux (PPDP, 2008)

A Characterization of NCk. - Jean-Yves Marion; Romain Péchoux (TAMC, 2008)

Upper Bounds on Stream I/O Using Semantic Interpretations. - Marco Gaboardi; Romain Péchoux (CSL, 2009)

Global and Local Space Properties of Stream Programs. - Marco Gaboardi; Romain Péchoux (FOPARA, 2009)

Sup-interpretations, a semantic method for static analysis of program resources. - Jean-Yves Marion; Romain Péchoux (ACM Trans. Comput. Log., 2009)

Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity. - Hugo Férée; Emmanuel Hainry; Mathieu Hoyrup; Romain Péchoux (ISAAC (1), 2010)

Type-Based Complexity Analysis for Fork Processes. - Emmanuel Hainry; Jean-Yves Marion; Romain Péchoux (FoSSaCS, 2013)

Synthesis of sup-interpretations: A survey. - Romain Péchoux (Theor. Comput. Sci., 2013)

Complexity Information Flow in a Multi-threaded Imperative Language. - Jean-Yves Marion; Romain Péchoux (TAMC, 2014)

A Categorical Treatment of Malicious Behavioral Obfuscation. - Romain Péchoux; Thanh Dinh Ta (TAMC, 2014)

Objects in Polynomial Time. - Emmanuel Hainry; Romain Péchoux (APLAS, 2015)

Algebras and coalgebras in the light affine Lambda calculus. - Marco Gaboardi; Romain Péchoux (ICFP, 2015)

On bounding space usage of streams using interpretation analysis. - Marco Gaboardi; Romain Péchoux (Sci. Comput. Program., 2015)

Characterizing polynomial time complexity of stream programs using interpretations. - Hugo Férée; Emmanuel Hainry; Mathieu Hoyrup; Romain Péchoux (Theor. Comput. Sci., 2015)

Median Based Calculus for Lattice Polynomials and Monotone Boolean Functions. - Miguel Couceiro; Pierre Mercuriali; Romain Péchoux; Abdallah Saffidine (ISMVL, 2017)

Higher order interpretation for higher order complexity. - Emmanuel Hainry; Romain Péchoux (LPAR, 2017)

A type-based complexity analysis of Object Oriented programs. - Emmanuel Hainry; Romain Péchoux (Inf. Comput., 2018)

On the Complexity of Minimizing Median Normal Forms of Monotone Boolean Functions and Lattice Polynomials. - Miguel Couceiro; Pierre Mercuriali; Romain Péchoux; Abdallah Saffidine (J. Multiple Valued Log. Soft Comput., 2019)

Complexité implicite : bilan et perspectives. (Implicit Computational Complexity: past and future). - Romain Péchoux (2020)

Polynomial Time over the Reals with Parsimony. - Emmanuel Hainry; Damiano Mazza; Romain Péchoux (FLOPS, 2020)

Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory. - Romain Péchoux; Simon Perdrix; Mathys Rennela; Vladimir Zamdzhiev (FoSSaCS, 2020)

Theory of higher order interpretations and application to Basic Feasible Functions. - Emmanuel Hainry; Romain Péchoux (Log. Methods Comput. Sci., 2020)

On the efficiency of normal form systems for representing Boolean functions. - Miguel Couceiro; Erkko Lehtonen; Pierre Mercuriali; Romain Péchoux (Theor. Comput. Sci., 2020)

ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs. - Emmanuel Hainry; Emmanuel Jeandel; Romain Péchoux; Olivier Zeyen (ICTAC, 2021)

Quantum Expectation Transformers for Cost Analysis. - Martin Avanzini; Georg Moser; Romain Péchoux; Simon Perdrix; Vladimir Zamdzhiev (LICS, 2022)

A tier-based typed programming language characterizing Feasible Functionals. - Emmanuel Hainry; Bruce M. Kapron; Jean-Yves Marion; Romain Péchoux (Log. Methods Comput. Sci., 2022)

A Programming Language Characterizing Quantum Polynomial Time. - Emmanuel Hainry; Romain Péchoux; Mário Silva 001 (FoSSaCS, 2023)

A feasible and unitary programming language with quantum control. - Alejandro Díaz-Caro; Emmanuel Hainry; Romain Péchoux; Mário Silva 001 (CoRR, 2023)

A General Noninterference Policy for Polynomial Time. - Emmanuel Hainry; Romain Péchoux (Proc. ACM Program. Lang., 2023)

On the Hardness of Analyzing Quantum Programs Quantitatively. - Martin Avanzini; Georg Moser; Romain Péchoux; Simon Perdrix (ESOP (2), 2024)

Declassification Policy for Program Complexity Analysis. - Emmanuel Hainry; Bruce M. Kapron; Jean-Yves Marion; Romain Péchoux (LICS, 2024)

Branch Sequentialization in Quantum Polytime. - Emmanuel Hainry; Romain Péchoux; Mário Alberto Machado da Silva (CoRR, 2024)

Combining quantum and classical control: syntax, semantics and adequacy. - Kinnari Dave; Louis Lemonnier; Romain Péchoux; Vladimir Zamdzhiev (FoSSaCS, 2025)

Branch Sequentialization in Quantum Polytime. - Emmanuel Hainry; Romain Péchoux; Mário Silva 001 (FSCD, 2025)

Quantum Programming in Polylogarithmic Time. - Florent Ferrari; Emmanuel Hainry; Romain Péchoux; Mário Silva 001 (MFCS, 2025)

Complete and tractable machine-independent characterizations of second-order polytime. - Emmanuel Hainry; Bruce M. Kapron; Jean-Yves Marion; Romain Péchoux (Log. Methods Comput. Sci., 2025)

Expectation-based Analysis of Higher-Order Quantum Programs. - Martin Avanzini; Alejandro Díaz-Caro; Emmanuel Hainry; Romain Péchoux (CoRR, 2025)

A Quantum Programming Language for Coherent Control. - Kathleen Barsse; Romain Péchoux; Simon Perdrix (CoRR, 2025)