Denis Kuperberg

According to our database, Denis Kuperberg authored at least 37 papers between 2010 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Positive First-order Logic on Words and Graphs.

Denis Kuperberg

Log. Methods Comput. Sci., 2023

Explorable Automata.

Emile Hazard, Denis Kuperberg

Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2022

Bouncing Threads for Circular and Non-Wellfounded Proofs: Towards Compositionality with Circular Proofs.

David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin

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

Cyclic Proofs for Transfinite Expressions.

Emile Hazard, Denis Kuperberg

Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

2021

Cyclic proofs, system t, and the power of contraction.

Denis Kuperberg, Laureline Pinault, Damien Pous

Proc. ACM Program. Lang., 2021

Coinductive Algorithms for Büchi Automata.

Denis Kuperberg, Laureline Pinault, Damien Pous

Fundam. Informaticae, 2021

Positive First-order Logic on Words.

Denis Kuperberg

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2020

Bouncing threads for infinitary and circular proofs.

David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin

CoRR, 2020

On Succinctness and Recognisability of Alternating Good-for-Games Automata.

Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak

CoRR, 2020

Regular Resynchronizability of Origin Transducers Is Undecidable.

Denis Kuperberg, Jan Martens

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

On the Succinctness of Alternating Parity Good-For-Games Automata.

Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019

Computing the Width of Non-deterministic Automata.

Denis Kuperberg, Anirban Majumdar

Log. Methods Comput. Sci., 2019

Sensing as a Complexity Measure.

Shaull Almagor, Denis Kuperberg, Orna Kupferman

Int. J. Found. Comput. Sci., 2019

Cyclic Proofs and Jumping Automata.

Denis Kuperberg, Laureline Pinault, Damien Pous

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Kleene Algebra with Hypotheses.

Amina Doumane, Denis Kuperberg, Damien Pous, Cécilia Pradic

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

Eventually Safe Languages.

Simon Iosti, Denis Kuperberg

Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

2018

Soundness in negotiations.

Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz

Log. Methods Comput. Sci., 2018

Width of Non-deterministic Automata.

Denis Kuperberg, Anirban Majumdar

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Büchi Good-for-Games Automata Are Efficiently Recognizable.

Marc Bagnol, Denis Kuperberg

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

Stamina: Stabilisation Monoids in Automata Theory.

Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Denis Kuperberg

Proceedings of the Implementation and Application of Automata, 2017

2016

Varieties of Cost Functions.

Laure Daviaud, Denis Kuperberg, Jean-Éric Pin

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Cost Functions Definable by Min/Max Automata.

Thomas Colcombet, Denis Kuperberg, Amaldev Manuel, Szymon Torunczyk

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Lightweight specification and analysis of dynamic systems with rich configurations.

Nuno Macedo, Julien Brunel, David Chemouil, Alcino Cunha, Denis Kuperberg

Proceedings of the 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2016

On Finite Domains in First-Order Linear Temporal Logic.

Denis Kuperberg, Julien Brunel, David Chemouil

Proceedings of the Automated Technology for Verification and Analysis, 2016

2015

On Determinisation of Good-for-Games Automata.

Denis Kuperberg, Michal Skrzypczak

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Trading Bounds for Memory in Games with Counters.

Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

The Sensing Cost of Monitoring and Synthesis.

Shaull Almagor, Denis Kuperberg, Orna Kupferman

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014

Linear Temporal Logic for Regular Cost Functions.

Denis Kuperberg

Log. Methods Comput. Sci., 2014

Regular Sensing.

Shaull Almagor, Denis Kuperberg, Orna Kupferman

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Two-way cost automata and cost logics over infinite trees.

Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

ACME: Automata with Counters, Monoids and Equivalence.

Nathanaël Fijalkow, Denis Kuperberg

Proceedings of the Automated Technology for Verification and Analysis, 2014

2013

Nondeterminism in the Presence of a Diverse or Unknown Future.

Udi Boker, Denis Kuperberg, Orna Kupferman, Michal Skrzypczak

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Deciding the weak definability of Büchi definable tree languages.

Thomas Colcombet, Denis Kuperberg, Christof Löding, Michael Vanden Boom

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012

Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation.

Peter Dybjer, Denis Kuperberg

Ann. Pure Appl. Log., 2012

On the Expressive Power of Cost Logics over Infinite Words.

Denis Kuperberg, Michael Vanden Boom

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Quasi-Weak Cost Automata: A New Variant of Weakness.

Denis Kuperberg, Michael Vanden Boom

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

2010

Regular Temporal Cost Functions.

Thomas Colcombet, Denis Kuperberg, Sylvain Lombardy

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010