E-LIB Suche - Ergebnisse für: Kuperberg, Denis - Sprache DE

Personensuche X

Sortierung: Relevanz

Sortierung: Jahr

1

Bouncing Threads for Circular and Non-Wellfounded Proofs ..:

, In: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science,

Baelde, David ; Doumane, Amina ; Kuperberg, Denis. - p. 1-13 , 2022

Link: https://dl.acm.org/doi/1..

2

Cyclic proofs, system t, and the power of contraction:

Kuperberg, Denis ; Pinault, Laureline ; Pous, Damien
Proceedings of the ACM on Programming Languages. 5 (2021) POPL - p. 1-28 , 2021

Link: https://dl.acm.org/doi/1..

3

Positive first-order logic on words:

, In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science,

Kuperberg, Denis - p. 1-13 , 2021

Link: https://dl.acm.org/doi/1..

4

Cyclic proofs, system t, and the power of contraction:

Kuperberg, Denis ; Pinault, Laureline ; Pous, Damien
Proceedings of the ACM on Programming Languages. 5 (2021) POPL - p. 1-28 , 2021

Link: https://doi.org/10.1145/..

5

Kleene Algebra with Hypotheses:

, In: Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures,

Doumane, Amina ; Kuperberg, Denis ; Pous, Damien. - p. 207-223 , 2019

Link: https://doi.org/10.1007/..

6

Eventually Safe Languages:

, In: Developments in Language Theory; Lecture Notes in Computer Science,

Iosti, Simon ; Kuperberg, Denis - p. 192-205 , 2019

Link: https://doi.org/10.1007/..

7

Coinductive Algorithms for Büchi Automata:

, In: Developments in Language Theory; Lecture Notes in Computer Science,

Kuperberg, Denis ; Pinault, Laureline ; Pous, Damien - p. 206-220 , 2019

Link: https://doi.org/10.1007/..

8

Lightweight specification and analysis of dynamic systems w..:

, In: Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering,

Macedo, Nuno ; Brunel, Julien ; Chemouil, David.. - p. 373-383 , 2016

Link: https://dl.acm.org/doi/1..

9

Two-way cost automata and cost logics over infinite trees:

, In: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),

Blumensath, Achim ; Colcombet, Thomas ; Kuperberg, Denis.. - p. 1-9 , 2014

Link: https://dl.acm.org/doi/1..

10

Formal neighbourhoods, combinatory Böhm trees, and untyped ..:

Dybjer, Peter ; Kuperberg, Denis
Annals of Pure and Applied Logic. 163 (2012) 2 - p. 122-131 , 2012

Link: https://doi.org/10.1016/..

11

Explorable Automata ; Explorable automata:

Hazard, Emile ; Kuperberg, Denis
info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.CSL.2023.24. , 2023

Link: https://hal.science/hal-..

12

Positive First-Order Logic on Words and Graphs:

Kuperberg, Denis
hal-03865495. , 2023

Link: https://hal.science/hal-..

13

Positive First-Order Logic on Words and Graphs:

Kuperberg, Denis
info:eu-repo/semantics/altIdentifier/arxiv/2201.11619. , 2023

Link: https://hal.science/hal-..

14

Positive First-Order Logic on Words and Graphs:

Kuperberg, Denis
hal-03865495. , 2023

Link: https://hal.science/hal-..

15

Explorable Automata ; Explorable automata:

Hazard, Emile ; Kuperberg, Denis
info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.CSL.2023.24. , 2023

Link: https://hal.science/hal-..

1-15