E-LIB Suche - Ergebnisse für: Hainry, Emmanuel

1

Declassification Policy for Program Complexity Analysis:

, In: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science,

Hainry, Emmanuel ; Kapron, Bruce ; Marion, Jean-Yves. - p. 1-14 , 2024

Link: https://dl.acm.org/doi/1..

2

A General Noninterference Policy for Polynomial Time:

Hainry, Emmanuel ; Péchoux, Romain
Proceedings of the ACM on Programming Languages. 7 (2023) POPL - p. 806-832 , 2023

Link: https://doi.org/10.1145/..

3

A Programming Language Characterizing Quantum Polynomial Ti..:

, In: Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures,

Hainry, Emmanuel ; Péchoux, Romain ; Silva, Mário - p. 156-175 , 2023

Link: https://doi.org/10.1007/..

4

Complete and tractable machine-independent characterization..:

, In: Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures,

Hainry, Emmanuel ; Kapron, Bruce M. ; Marion, Jean-Yves. - p. 368-388 , 2022

Link: https://doi.org/10.1007/..

5

A tier-based typed programming language characterizing Feas..:

Hainry, Emmanuel ; Kapron, Bruce M. ; Marion, Jean-Yves.
Logical Methods in Computer Science. 18, Issue 1 (2022) - p. , 2022

Link: https://doi.org/10.46298..

6

ComplexityParser: An Automatic Tool for Certifying Poly-Tim..:

, In: Theoretical Aspects of Computing – ICTAC 2021; Lecture Notes in Computer Science,

Hainry, Emmanuel ; Jeandel, Emmanuel ; Péchoux, Romain. - p. 357-365 , 2021

Link: https://doi.org/10.1007/..

7

Polynomial Time over the Reals with Parsimony:

, In: Functional and Logic Programming; Lecture Notes in Computer Science,

Hainry, Emmanuel ; Mazza, Damiano ; Péchoux, Romain - p. 50-65 , 2020

Link: https://doi.org/10.1007/..

8

A tier-based typed programming language characterizing Feas..:

, In: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science,

Hainry, Emmanuel ; Kapron, Bruce M. ; Marion, Jean-Yves. - p. 535-549 , 2020

Link: https://dl.acm.org/doi/1..

9

A type-based complexity analysis of Object Oriented program:

Hainry, Emmanuel ; Péchoux, Romain
Information and Computation. 261 (2018) - p. 78-115 , 2018

Link: https://doi.org/10.1016/..

10

Characterizing polynomial time complexity of stream program..:

Férée, Hugo ; Hainry, Emmanuel ; Hoyrup, Mathieu.
Theoretical Computer Science. 585 (2015) - p. 41-54 , 2015

Link: https://doi.org/10.1016/..

11

Computation with perturbed dynamical systems:

Bournez, Olivier ; Graça, Daniel S. ; Hainry, Emmanuel
Journal of Computer and System Sciences. 79 (2013) 5 - p. 714-724 , 2013

Link: https://doi.org/10.1016/..

12

Polynomial differential equations compute all real computab..:

Bournez, Olivier ; Campagnolo, Manuel L. ; Graça, Daniel S..
Journal of Complexity. 23 (2007) 3 - p. 317-335 , 2007

Link: https://doi.org/10.1016/..

13

Elementarily computable functions over the real numbers and..:

Bournez, Olivier ; Hainry, Emmanuel
Theoretical Computer Science. 348 (2005) 2-3 - p. 130-147 , 2005

Link: https://doi.org/10.1016/..

14

Declassification Policy for Program Complexity Analysis:

Hainry, Emmanuel ; Kapron, Bruce M ; Marion, Jean-Yves.
http://arxiv.org/abs/2401.14957. , 2024

Link: http://arxiv.org/abs/240..

15

A General Noninterference Policy for Polynomial Time:

Hainry, Emmanuel ; Péchoux, Romain
info:eu-repo/semantics/altIdentifier/doi/10.1145/3571221. , 2023

Link: https://inria.hal.scienc..