Follow
Denis Kuperberg
Denis Kuperberg
CNRS, ENS Lyon, Plume Team
Verified email at kuperberg.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
642016
On determinisation of good-for-games automata
D Kuperberg, M Skrzypczak
International Colloquium on Automata, Languages, and Programming, 299-310, 2015
382015
Deciding the weak definability of Büchi definable tree languages
T Colcombet, D Kuperberg, C Löding, M Boom
CSL, 2013
342013
Nondeterminism in the Presence of a Diverse or Unknown Future
U Boker, D Kuperberg, O Kupferman, M Skrzypczak
Icalp, 2013
312013
Linear temporal logic for regular cost functions
D Kuperberg
Logical Methods in Computer Science 10, 2014
272014
Quasi-weak cost automata: A new variant of weakness
D Kuperberg, M Vanden Boom
IARCS Annual Conference on Foundations of Software Technology and …, 2011
242011
Büchi good-for-games automata are efficiently recognizable
M Bagnol, D Kuperberg
38th IARCS Annual Conference on Foundations of Software Technology and …, 2018
212018
On the expressive power of cost logics over infinite words
D Kuperberg, MV Boom
International Colloquium on Automata, Languages, and Programming, 287-298, 2012
202012
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
162014
Regular temporal cost functions
T Colcombet, D Kuperberg, S Lombardy
International Colloquium on Automata, Languages, and Programming, 563-574, 2010
142010
Computing the width of non-deterministic automata
A Majumdar, D Kuperberg
Logical Methods in Computer Science 15, 2019
12*2019
Kleene algebra with hypotheses
A Doumane, D Kuperberg, D Pous, P Pradic
International Conference on Foundations of Software Science and Computation …, 2019
102019
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
92021
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
92016
Trading bounds for memory in games with counters
N Fijalkow, F Horn, D Kuperberg, M Skrzypczak
International Colloquium on Automata, Languages, and Programming, 197-208, 2015
92015
The sensing cost of monitoring and synthesis
S Almagor, D Kuperberg, O Kupferman
FSTTCS, 2015
92015
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
8*2022
On finite domains in first-order linear temporal logic
D Kuperberg, J Brunel, D Chemouil
International Symposium on Automated Technology for Verification and …, 2016
82016
Varieties of cost functions
L Daviaud, D Kuperberg, JÉ Pin
33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 47, 1-30, 2016
82016
Regular sensing
S Almagor, D Kuperberg, O Kupferman
34th International Conference on Foundation of Software Technology and …, 2014
82014
The system can't perform the operation now. Try again later.
Articles 1–20