Follow
Denis Kuperberg
Denis Kuperberg
CNRS, ENS Lyon, Plume Team
Verified email at ens-lyon.fr - Homepage
Title
Cited by
Cited by
Year
Lightweight specification and analysis of dynamic systems with rich configurations
N Macedo, J Brunel, D Chemouil, A Cunha, D Kuperberg
Proceedings of the 2016 24th ACM SIGSOFT International Symposium on …, 2016
912016
On determinisation of good-for-games automata
D Kuperberg, M Skrzypczak
International Colloquium on Automata, Languages, and Programming, 299-310, 2015
622015
Nondeterminism in the Presence of a Diverse or Unknown Future
U Boker, D Kuperberg, O Kupferman, M Skrzypczak
Icalp, 2013
402013
Deciding the weak definability of Büchi definable tree languages
T Colcombet, D Kuperberg, C Löding, MV Boom
CSL, 2013
352013
Büchi good-for-games automata are efficiently recognizable
M Bagnol, D Kuperberg
38th IARCS Annual Conference on Foundations of Software Technology and …, 2018
312018
Linear temporal logic for regular cost functions
D Kuperberg
Logical Methods in Computer Science 10, 2014
312014
Bouncing threads for circular and non-wellfounded proofs--Towards compositionality with circular proofs (Extended version)
D Baelde, A Doumane, D Kuperberg, A Saurin
CNRS, 2022
28*2022
Quasi-weak cost automata: A new variant of weakness
D Kuperberg, M Vanden Boom
IARCS Annual Conference on Foundations of Software Technology and …, 2011
252011
Cyclic proofs, system T, and the power of contraction
D Kuperberg, L Pinault, D Pous
Proceedings of the ACM on Programming Languages 5 (POPL), 1-28, 2021
242021
On the expressive power of cost logics over infinite words
D Kuperberg, M Vanden Boom
International Colloquium on Automata, Languages, and Programming, 287-298, 2012
232012
Kleene algebra with hypotheses
A Doumane, D Kuperberg, D Pous, P Pradic
International Conference on Foundations of Software Science and Computation …, 2019
222019
Computing the width of non-deterministic automata
D Kuperberg, A Majumdar
Logical Methods in Computer Science 15, 2019
20*2019
Two-way cost automata and cost logics over infinite trees
A Blumensath, T Colcombet, D Kuperberg, P Parys, MV Boom
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014
182014
Regular temporal cost functions
T Colcombet, D Kuperberg, S Lombardy
International Colloquium on Automata, Languages, and Programming, 563-574, 2010
152010
Cyclic proofs for transfinite expressions
E Hazard, D Kuperberg
30th EACSL Annual Conference on Computer Science Logic (CSL 2022), 23, 2022
112022
Coinductive algorithms for Büchi automata
D Kuperberg, L Pinault, D Pous
Fundamenta Informaticae 180 (4), 351-373, 2021
112021
On finite domains in first-order linear temporal logic
D Kuperberg, J Brunel, D Chemouil
International Symposium on Automated Technology for Verification and …, 2016
112016
On the succinctness of alternating parity good-for-games automata
U Boker, D Kuperberg, K Lehtinen, M Skrzypczak
arXiv preprint arXiv:2009.14437, 2020
102020
Cost functions definable by min/max automata
T Colcombet, D Kuperberg, A Manuel, S Toruńczyk
33rd International Symposium on Theoretical Aspects of Computer Science …, 2016
102016
Cyclic Proofs and jumping automata
D Kuperberg, L Pinault, D Pous
FSTTCS, 2019
92019
The system can't perform the operation now. Try again later.
Articles 1–20