A Realizability Approach to Complexity Theory

Publications

Conference proceedings (3)

Unary Resolution: Characterizing Ptime

Author(s): Clément Aubert, Marc Bagnol, Thomas Seiller
Published in: Foundations of Software Science and Computation Structures. FoSSaCS 2016. Lecture Notes in Computer Science, vol 9634, 2016, Page(s) 373-389
DOI: 10.1007/978-3-662-49630-5_22

Interaction Graphs - Full Linear Logic

Author(s): Thomas Seiller
Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16, 2016, Page(s) 427-436
DOI: 10.1145/2933575.2934568

Loop Quasi-Invariant Chunk Detection

Author(s): Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller
Published in: Automated Technology for Verification and Analysis. ATVA 2017. Lecture Notes in Computer Science, vol 10482, 2017, Page(s) 91-108
DOI: 10.1007/978-3-319-68167-2_7

Peer reviewed articles (1)

Loop Quasi-Invariant Chunk Motion by peeling with statement composition

Author(s): Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller
Published in: Electronic Proceedings in Theoretical Computer Science, Issue 248, 2017, Page(s) 47-59, ISSN 2075-2180
DOI: 10.4204/EPTCS.248.9

Other (3)

Interaction Graphs: Non-deterministic automata

Author(s): Seiller, Thomas
Published in: ACM Transactions in Computational Logic, 2018

From Dynamic to Static Semantics, Quantitatively

Author(s): Seiller, Thomas
Published in: 2016

Towards a Complexity-through-Realisability Theory

Author(s): Seiller, Thomas
Published in: 2015