Denis Kuperberg
Denis Kuperberg
CNRS, ENS Lyon, Plume Team
Verified email at kuperberg.fr - Homepage
TitleCited byYear
Deciding the weak definability of Büchi definable tree languages
T Colcombet, D Kuperberg, C Löding, M Vanden Boom
Computer Science Logic 2013 (CSL 2013), 2013
282013
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
262016
Linear temporal logic for regular cost functions
D Kuperberg
arXiv preprint arXiv:1401.1448, 2014
202014
Quasi-weak cost automata: A new variant of weakness
D Kuperberg, M Vanden Boom
IARCS Annual Conference on Foundations of Software Technology and …, 2011
202011
Nondeterminism in the Presence of a Diverse or Unknown Future
U Boker, D Kuperberg, O Kupferman, M Skrzypczak
Icalp, 2013
162013
On the expressive power of cost logics over infinite words
D Kuperberg, MV Boom
International Colloquium on Automata, Languages, and Programming, 287-298, 2012
142012
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
132014
On determinisation of good-for-games automata
D Kuperberg, M Skrzypczak
International Colloquium on Automata, Languages, and Programming, 299-310, 2015
122015
Regular temporal cost functions
T Colcombet, D Kuperberg, S Lombardy
International Colloquium on Automata, Languages, and Programming, 563-574, 2010
122010
The sensing cost of monitoring and synthesis
S Almagor, D Kuperberg, O Kupferman
FSTTCS, 2015
92015
Regular sensing
S Almagor, D Kuperberg, O Kupferman
34th International Conference on Foundation of Software Technology and …, 2014
72014
Etude de classes de fonctions de coût régulières
D Kuperberg
Ph. D. dissertation, Université Paris Diderot, 2012
72012
Varieties of cost functions
L Daviaud, D Kuperberg, JÉ Pin
33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), 2016
62016
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
62015
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
52016
Width of non-deterministic automata
D Kuperberg, A Majumdar
42018
On finite domains in first-order linear temporal logic
D Kuperberg, J Brunel, D Chemouil
International Symposium on Automated Technology for Verification and …, 2016
42016
Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation
P Dybjer, D Kuperberg
Annals of Pure and Applied Logic 163 (2), 122-131, 2012
42012
ACME: automata with counters, monoids and equivalence
N Fijalkow, D Kuperberg
International Symposium on Automated Technology for Verification and …, 2014
32014
Büchi good-for-games automata are efficiently recognizable
M Bagnol, D Kuperberg
22018
The system can't perform the operation now. Try again later.
Articles 1–20