Romain Péchoux

Proc. ACM Program. Lang., January, 2023

A feasible and unitary programming language with quantum control.

[BibT_eX]

[DOI]

CoRR, 2023

A Programming Language Characterizing Quantum Polynomial Time.

[BibT_eX]

[DOI]

Mário Silva

Proceedings of the Foundations of Software Science and Computation Structures, 2023

2022

A tier-based typed programming language characterizing Feasible Functionals.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2022

Quantum Expectation Transformers for Cost Analysis.

[BibT_eX]

[DOI]

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Complete and tractable machine-independent characterizations of second-order polytime.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2022

2021

ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2021, 2021

2020

On the efficiency of normal form systems for representing Boolean functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Theory of higher order interpretations and application to Basic Feasible Functions.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2020

Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2020

Polynomial Time over the Reals with Parsimony.

[BibT_eX]

[DOI]

Damiano Mazza

Proceedings of the Functional and Logic Programming - 15th International Symposium, 2020

Complexité implicite : bilan et perspectives. (Implicit Computational Complexity: past and future).

[BibT_eX]

[DOI]

, 2020

2019

On the Complexity of Minimizing Median Normal Forms of Monotone Boolean Functions and Lattice Polynomials.

[BibT_eX]

[DOI]

J. Multiple Valued Log. Soft Comput., 2019

2018

A type-based complexity analysis of Object Oriented programs.

[BibT_eX]

[DOI]

Inf. Comput., 2018

2017

Higher order interpretation for higher order complexity.

[BibT_eX]

[DOI]

Proceedings of the LPAR-21, 2017

Median Based Calculus for Lattice Polynomials and Monotone Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the 47th IEEE International Symposium on Multiple-Valued Logic, 2017

2015

Characterizing polynomial time complexity of stream programs using interpretations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

On bounding space usage of streams using interpretation analysis.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2015

Algebras and coalgebras in the light affine Lambda calculus.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015

Objects in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems - 13th Asian Symposium, 2015

2014

A Categorical Treatment of Malicious Behavioral Obfuscation.

[BibT_eX]

[DOI]

Thanh Dinh Ta

Proceedings of the Theory and Applications of Models of Computation, 2014

Complexity Information Flow in a Multi-threaded Imperative Language.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2014

2013

Synthesis of sup-interpretations: A survey.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Type-Based Complexity Analysis for Fork Processes.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2013

2010

Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

Sup-interpretations, a semantic method for static analysis of program resources.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2009

Global and Local Space Properties of Stream Programs.

[BibT_eX]

[DOI]

Proceedings of the Foundational and Practical Aspects of Resource Analysis, 2009

Upper Bounds on Stream I/O Using Semantic Interpretations.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2008

A Characterization of NCk.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2008

Characterizations of polynomial complexity classes with a better intensionality.

[BibT_eX]

[DOI]

Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2008

Analyzing the Implicit Computational Complexity of object-oriented programs.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2007

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

[BibT_eX]

[DOI]

PhD thesis, 2007

Resource control of object-oriented programs

[BibT_eX]

[DOI]

CoRR, 2007

Quasi-interpretation Synthesis by Decomposition.

[BibT_eX]

[DOI]

Guillaume Bonfante

Proceedings of the Theoretical Aspects of Computing, 2007

2006

Quasi-friendly sup-interpretations

[BibT_eX]

[DOI]

CoRR, 2006

A Characterization of Alternating Log Time by First Order Functional Programs.

[BibT_eX]

[DOI]

Guillaume Bonfante

Proceedings of the Logic for Programming, 2006

Resource Analysis by Sup-interpretation.

[BibT_eX]

[DOI]