A Realizability Approach to Complexity Theory

Unary Resolution: Characterizing Ptime

Autori: Clément Aubert, Marc Bagnol, Thomas Seiller
Pubblicato in: Foundations of Software Science and Computation Structures. FoSSaCS 2016. Lecture Notes in Computer Science, vol 9634, 2016, Pagina/e 373-389
Editore: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-49630-5_22

Interaction Graphs - Full Linear Logic

Autori: Thomas Seiller
Pubblicato in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16, 2016, Pagina/e 427-436, ISBN 9781-450343916
Editore: ACM Press
DOI: 10.1145/2933575.2934568

Loop Quasi-Invariant Chunk Detection

Autori: Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller
Pubblicato in: Automated Technology for Verification and Analysis. ATVA 2017. Lecture Notes in Computer Science, vol 10482, 2017, Pagina/e 91-108
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-68167-2_7

Loop Quasi-Invariant Chunk Motion by peeling with statement composition

Autori: Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller
Pubblicato in: Electronic Proceedings in Theoretical Computer Science, Numero 248, 2017, Pagina/e 47-59, ISSN 2075-2180
Editore: Open Publishing Association
DOI: 10.4204/EPTCS.248.9

Interaction Graphs: Non-deterministic automata

Autori: Seiller, Thomas
Pubblicato in: ACM Transactions in Computational Logic, 2018
Editore: ACM

From Dynamic to Static Semantics, Quantitatively

Autori: Seiller, Thomas
Pubblicato in: 2016
Editore: ArXiv

Towards a Complexity-through-Realisability Theory

Autori: Seiller, Thomas
Pubblicato in: 2015
Editore: ArXiv

Pubblicazioni

Condividi questa pagina

Scarica