Folgen
Denis Kuperberg
Denis Kuperberg
CNRS, ENS Lyon, Plume Team
Bestätigte E-Mail-Adresse bei ens-lyon.fr - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
722016
On determinisation of good-for-games automata
D Kuperberg, M Skrzypczak
Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015
502015
Nondeterminism in the Presence of a Diverse or Unknown Future
U Boker, D Kuperberg, O Kupferman, M Skrzypczak
Icalp, 2013
382013
Deciding the weak definability of Büchi definable tree languages
T Colcombet, D Kuperberg, C Löding, MV Boom
CSL, 2013
342013
Linear temporal logic for regular cost functions
D Kuperberg
Logical Methods in Computer Science 10, 2014
292014
Büchi good-for-games automata are efficiently recognizable
M Bagnol, D Kuperberg
38th IARCS Annual Conference on Foundations of Software Technology and …, 2018
262018
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
On the expressive power of cost logics over infinite words
D Kuperberg, M Vanden Boom
Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012
212012
Kleene algebra with hypotheses
A Doumane, D Kuperberg, D Pous, P Pradic
Foundations of Software Science and Computation Structures: 22nd …, 2019
192019
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
Automata, Languages and Programming: 37th International Colloquium, ICALP …, 2010
142010
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
13*2022
Computing the width of non-deterministic automata
D Kuperberg, A Majumdar
Logical Methods in Computer Science 15, 2019
13*2019
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
122021
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
On finite domains in first-order linear temporal logic
D Kuperberg, J Brunel, D Chemouil
Automated Technology for Verification and Analysis: 14th International …, 2016
92016
Varieties of cost functions
L Daviaud, D Kuperberg, JÉ Pin
33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 47, 1-30, 2016
92016
Trading bounds for memory in games with counters
N Fijalkow, F Horn, D Kuperberg, M Skrzypczak
Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015
92015
The sensing cost of monitoring and synthesis
S Almagor, D Kuperberg, O Kupferman
FSTTCS, 2015
92015
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20