default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRomain Péchoux
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c25]Martin Avanzini
, Georg Moser, Romain Péchoux, Simon Perdrix:
On the Hardness of Analyzing Quantum Programs Quantitatively. ESOP (2) 2024: 31-58- [c24]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
Declassification Policy for Program Complexity Analysis. LICS 2024: 41:1-41:14 - [i14]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
Declassification Policy for Program Complexity Analysis. CoRR abs/2401.14957 (2024) - 2023
- [j10]Emmanuel Hainry, Romain Péchoux:
A General Noninterference Policy for Polynomial Time. Proc. ACM Program. Lang. 7(POPL): 806-832 (2023) - [c23]Emmanuel Hainry, Romain Péchoux, Mário Silva:
A Programming Language Characterizing Quantum Polynomial Time. FoSSaCS 2023: 156-175 - [i13]Alejandro Díaz-Caro, Emmanuel Hainry, Romain Péchoux, Mário Silva:
A feasible and unitary programming language with quantum control. CoRR abs/2311.01054 (2023) - [i12]Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix:
On the Hardness of Analyzing Quantum Programs Quantitatively. CoRR abs/2312.13657 (2023) - 2022
- [j9]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
A tier-based typed programming language characterizing Feasible Functionals. Log. Methods Comput. Sci. 18(1) (2022) - [c22]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
Complete and tractable machine-independent characterizations of second-order polytime. FoSSaCS 2022: 368-388 - [c21]Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev:
Quantum Expectation Transformers for Cost Analysis. LICS 2022: 10:1-10:13 - [i11]Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev:
Quantum Expectation Transformers for Cost Analysis. CoRR abs/2201.09361 (2022) - [i10]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
Complete and tractable machine-independent characterizations of second-order polytime. CoRR abs/2208.14739 (2022) - [i9]Emmanuel Hainry, Romain Péchoux, Mário Silva:
A programming language characterizing quantum polynomial time. CoRR abs/2212.06656 (2022) - 2021
- [c20]Emmanuel Hainry, Emmanuel Jeandel, Romain Péchoux, Olivier Zeyen:
ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs. ICTAC 2021: 357-365 - [i8]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
A tier-based typed programming language characterizing Feasible Functionals. CoRR abs/2102.11605 (2021) - 2020
- [b2]Romain Péchoux:
Complexité implicite : bilan et perspectives. (Implicit Computational Complexity: past and future). University of Lorraine, Nancy, France, 2020 - [j8]Emmanuel Hainry, Romain Péchoux:
Theory of higher order interpretations and application to Basic Feasible Functions. Log. Methods Comput. Sci. 16(4) (2020) - [j7]Miguel Couceiro, Erkko Lehtonen, Pierre Mercuriali, Romain Péchoux:
On the efficiency of normal form systems for representing Boolean functions. Theor. Comput. Sci. 813: 341-361 (2020) - [c19]Emmanuel Hainry, Damiano Mazza, Romain Péchoux:
Polynomial Time over the Reals with Parsimony. FLOPS 2020: 50-65 - [c18]Romain Péchoux, Simon Perdrix, Mathys Rennela, Vladimir Zamdzhiev:
Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory. FoSSaCS 2020: 562-581 - [c17]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
A tier-based typed programming language characterizing Feasible Functionals. LICS 2020: 535-549
2010 – 2019
- 2019
- [j6]Miguel Couceiro, Pierre Mercuriali, Romain Péchoux, Abdallah Saffidine:
On the Complexity of Minimizing Median Normal Forms of Monotone Boolean Functions and Lattice Polynomials. J. Multiple Valued Log. Soft Comput. 33(3): 197-218 (2019) - [i7]Romain Péchoux, Simon Perdrix, Mathys Rennela, Vladimir Zamdzhiev:
Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory. CoRR abs/1910.09633 (2019) - 2018
- [j5]Emmanuel Hainry, Romain Péchoux:
A type-based complexity analysis of Object Oriented programs. Inf. Comput. 261: 78-115 (2018) - [i6]Emmanuel Hainry, Romain Péchoux:
Theory of higher order interpretations and application to Basic Feasible Functions. CoRR abs/1801.08350 (2018) - [i5]Emmanuel Hainry, Romain Péchoux:
A Type-Based Complexity Analysis of Object Oriented Programs. CoRR abs/1802.06653 (2018) - 2017
- [c16]Miguel Couceiro, Pierre Mercuriali, Romain Péchoux, Abdallah Saffidine:
Median Based Calculus for Lattice Polynomials and Monotone Boolean Functions. ISMVL 2017: 37-42 - [c15]Emmanuel Hainry, Romain Péchoux:
Higher order interpretation for higher order complexity. LPAR 2017: 269-285 - 2015
- [j4]Marco Gaboardi, Romain Péchoux:
On bounding space usage of streams using interpretation analysis. Sci. Comput. Program. 111: 395-425 (2015) - [j3]Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux:
Characterizing polynomial time complexity of stream programs using interpretations. Theor. Comput. Sci. 585: 41-54 (2015) - [c14]Emmanuel Hainry, Romain Péchoux:
Objects in Polynomial Time. APLAS 2015: 387-404 - [c13]Marco Gaboardi, Romain Péchoux:
Algebras and coalgebras in the light affine Lambda calculus. ICFP 2015: 114-126 - 2014
- [c12]Jean-Yves Marion, Romain Péchoux:
Complexity Information Flow in a Multi-threaded Imperative Language. TAMC 2014: 124-140 - [c11]Romain Péchoux, Thanh Dinh Ta:
A Categorical Treatment of Malicious Behavioral Obfuscation. TAMC 2014: 280-299 - 2013
- [j2]Romain Péchoux:
Synthesis of sup-interpretations: A survey. Theor. Comput. Sci. 467: 30-52 (2013) - [c10]Emmanuel Hainry, Jean-Yves Marion, Romain Péchoux:
Type-Based Complexity Analysis for Fork Processes. FoSSaCS 2013: 305-320 - 2012
- [i4]Jean-Yves Marion, Romain Péchoux:
Complexity Information Flow in a Multi-threaded Imperative Language. CoRR abs/1203.6878 (2012) - [i3]Romain Péchoux:
Synthesis of sup-interpretations: a survey. CoRR abs/1210.7136 (2012) - 2010
- [c9]Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux:
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity. ISAAC (1) 2010: 291-303
2000 – 2009
- 2009
- [j1]Jean-Yves Marion, Romain Péchoux:
Sup-interpretations, a semantic method for static analysis of program resources. ACM Trans. Comput. Log. 10(4): 27:1-27:31 (2009) - [c8]Marco Gaboardi, Romain Péchoux:
Upper Bounds on Stream I/O Using Semantic Interpretations. CSL 2009: 271-286 - [c7]Marco Gaboardi, Romain Péchoux:
Global and Local Space Properties of Stream Programs. FOPARA 2009: 51-66 - 2008
- [c6]Jean-Yves Marion, Romain Péchoux:
Analyzing the Implicit Computational Complexity of object-oriented programs. FSTTCS 2008: 316-327 - [c5]Jean-Yves Marion, Romain Péchoux:
Characterizations of polynomial complexity classes with a better intensionality. PPDP 2008: 79-88 - [c4]Jean-Yves Marion, Romain Péchoux:
A Characterization of NCk. TAMC 2008: 136-147 - 2007
- [b1]Romain Péchoux:
Analyse de la complexité des programmes par interprétation sémantique. (Program complexity analysis by semantics interpretation). National Polytechnic Institute of Lorraine, Nancy, France, 2007 - [c3]Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux:
Quasi-interpretation Synthesis by Decomposition. ICTAC 2007: 410-424 - [i2]Jean-Yves Marion, Romain Péchoux:
Resource control of object-oriented programs. CoRR abs/0706.2293 (2007) - 2006
- [c2]Jean-Yves Marion, Romain Péchoux:
Resource Analysis by Sup-interpretation. FLOPS 2006: 163-176 - [c1]Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux:
A Characterization of Alternating Log Time by First Order Functional Programs. LPAR 2006: 90-104 - [i1]Jean-Yves Marion, Romain Péchoux:
Quasi-friendly sup-interpretations. CoRR abs/cs/0608020 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
