Denis Kuperberg

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 37

Top Topics

Deterministic Automata

Linear Temporal Logic

Top Venues

Log. Methods Comput. Sci.

Publications

Thomas Colcombet, Amina Doumane, Denis Kuperberg
Tree algebras and bisimulation-invariant MSO on finite graphs. CoRR (2024)
Denis Kuperberg, Quentin Moreau
Positive and monotone fragments of FO and LTL. CoRR (2024)
Antonio Casares, Olivier Idir, Denis Kuperberg, Corto Mascle, Aditya Prakash
On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata. CoRR (2024)
Denis Kuperberg
Positive First-order Logic on Words and Graphs. Log. Methods Comput. Sci. 19 (3) (2023)
Emile Hazard, Denis Kuperberg
Explorable Automata. CSL (2023)
Emile Hazard, Denis Kuperberg
Cyclic Proofs for Transfinite Expressions. CSL (2022)
Denis Kuperberg
Positive First-order Logic on Words and Graphs. CoRR (2022)
David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin
Bouncing Threads for Circular and Non-Wellfounded Proofs: Towards Compositionality with Circular Proofs. LICS (2022)
Denis Kuperberg, Laureline Pinault, Damien Pous
Coinductive Algorithms for Büchi Automata. Fundam. Informaticae 180 (4) (2021)
Denis Kuperberg
Positive first-order logic on words. CoRR (2021)
Denis Kuperberg
Positive First-order Logic on Words. LICS (2021)
Denis Kuperberg, Laureline Pinault, Damien Pous
Cyclic proofs, system t, and the power of contraction. Proc. ACM Program. Lang. 5 (POPL) (2021)
Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak
On the Succinctness of Alternating Parity Good-for-Games Automata. CoRR (2020)
Denis Kuperberg, Jan Martens
Regular Resynchronizability of Origin Transducers Is Undecidable. MFCS (2020)
Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak
On Succinctness and Recognisability of Alternating Good-for-Games Automata. CoRR (2020)
Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak
On the Succinctness of Alternating Parity Good-For-Games Automata. FSTTCS (2020)
David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin
Bouncing threads for infinitary and circular proofs. CoRR (2020)
Denis Kuperberg, Jan Martens
Regular resynchronizability of origin transducers is undecidable. CoRR (2020)
Denis Kuperberg, Laureline Pinault, Damien Pous
Coinductive Algorithms for Büchi Automata. DLT (2019)
Denis Kuperberg, Anirban Majumdar
Computing the Width of Non-deterministic Automata. Log. Methods Comput. Sci. 15 (4) (2019)
Denis Kuperberg, Laureline Pinault, Damien Pous
Cyclic Proofs and Jumping Automata. FSTTCS (2019)
Amina Doumane, Denis Kuperberg, Damien Pous, Pierre Pradic
Kleene Algebra with Hypotheses. FoSSaCS (2019)
Shaull Almagor, Denis Kuperberg, Orna Kupferman
Sensing as a Complexity Measure. Int. J. Found. Comput. Sci. 30 (6-7) (2019)
Simon Iosti, Denis Kuperberg
Eventually Safe Languages. DLT (2019)
Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz
Soundness in negotiations. Log. Methods Comput. Sci. 14 (1) (2018)
Denis Kuperberg, Anirban Majumdar
Width of Non-deterministic Automata. STACS (2018)
Denis Kuperberg, Anirban Majumdar
Computing the Width of Non-deterministic Automata. CoRR (2018)
Marc Bagnol, Denis Kuperberg
Büchi Good-for-Games Automata Are Efficiently Recognizable. FSTTCS (2018)
Shaull Almagor, Denis Kuperberg, Orna Kupferman
Sensing as a Complexity Measure. DCFS (2017)
Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak
Trading Bounds for Memory in Games with Counters. CoRR (2017)
Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Denis Kuperberg
Stamina: Stabilisation Monoids in Automata Theory. CIAA (2017)
Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz
Soundness in negotiations. CoRR (2017)
Thomas Colcombet, Denis Kuperberg, Amaldev Manuel, Szymon Torunczyk
Cost Functions Definable by Min/Max Automata. STACS (2016)
Denis Kuperberg, Julien Brunel, David Chemouil
On Finite Domains in First-Order Linear Temporal Logic. ATVA (2016)
Laure Daviaud, Denis Kuperberg, Jean-Éric Pin
Varieties of Cost Functions. STACS (2016)
Nuno Macedo, Julien Brunel, David Chemouil, Alcino Cunha, Denis Kuperberg
Lightweight specification and analysis of dynamic systems with rich configurations. SIGSOFT FSE (2016)
Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz
Soundness in Negotiations. CONCUR (2016)
Denis Kuperberg, Michal Skrzypczak
On Determinisation of Good-for-Games Automata. ICALP (2) (2015)
Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak
Trading Bounds for Memory in Games with Counters. ICALP (2) (2015)
Shaull Almagor, Denis Kuperberg, Orna Kupferman
The Sensing Cost of Monitoring and Synthesis. FSTTCS (2015)
Nathanaël Fijalkow, Denis Kuperberg
ACME: Automata with Counters, Monoids and Equivalence. ATVA (2014)
Denis Kuperberg
Linear Temporal Logic for Regular Cost Functions. Log. Methods Comput. Sci. 10 (1) (2014)
Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom
Two-way cost automata and cost logics over infinite trees. CSL-LICS (2014)
Shaull Almagor, Denis Kuperberg, Orna Kupferman
Regular Sensing. FSTTCS (2014)
Thomas Colcombet, Denis Kuperberg, Christof Löding, Michael Vanden Boom
Deciding the weak definability of Büchi definable tree languages. CSL (2013)
Udi Boker, Denis Kuperberg, Orna Kupferman, Michal Skrzypczak
Nondeterminism in the Presence of a Diverse or Unknown Future. ICALP (2) (2013)
Denis Kuperberg, Michael Vanden Boom
On the Expressive Power of Cost Logics over Infinite Words. ICALP (2) (2012)
Peter Dybjer, Denis Kuperberg
Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation. Ann. Pure Appl. Log. 163 (2) (2012)
Denis Kuperberg, Michael Vanden Boom
Quasi-Weak Cost Automata: A New Variant of Weakness. FSTTCS (2011)
Denis Kuperberg
Linear temporal logic for regular cost functions. STACS (2011)
Thomas Colcombet, Denis Kuperberg, Sylvain Lombardy
Regular Temporal Cost Functions. ICALP (2) (2010)