E-LIB Suche - Ergebnisse für: Löding, Christof

1

Finite-valued Streaming String Transducers:

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

Filiot, Emmanuel ; Jecker, Ismaël ; Löding, Christof... - p. 1-14 , 2024

2

A First-order Logic with Frames:

Murali, Adithya ; Peña, Lucas ; Löding, Christof.
ACM Transactions on Programming Languages and Systems. 45 (2023) 2 - p. 1-44 , 2023

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

3

Model-guided synthesis of inductive lemmas for FOL with lea..:

Murali, Adithya ; Peña, Lucas ; Blanchard, Eion..
Proceedings of the ACM on Programming Languages. 6 (2022) OOPSLA2 - p. 1873-1902 , 2022

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

4

Ambiguity, Weakness, and Regularity in Probabilistic Büchi ..:

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

Löding, Christof ; Pirogov, Anton - p. 522-541 , 2020

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

5

A First-Order Logic with Frames:

, In: Programming Languages and Systems; Lecture Notes in Computer Science,

Murali, Adithya ; Peña, Lucas ; Löding, Christof. - p. 515-543 , 2020

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

6

New Optimizations and Heuristics for Determinization of Büc..:

, In: Automated Technology for Verification and Analysis; Lecture Notes in Computer Science,

Löding, Christof ; Pirogov, Anton - p. 317-333 , 2019

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

7

On Finitely Ambiguous Büchi Automata:

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

Löding, Christof ; Pirogov, Anton - p. 503-515 , 2018

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

8

Projection for Büchi Tree Automata with Constraints Between..:

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

Landwehr, Patrick ; Löding, Christof - p. 478-490 , 2018

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

9

Context-free games on strings and nested words:

Schuster, Martin , 2017

Link: http://nbn-resolving.de/..

10

Foundations for natural proofs and quantifier instantiation:

Löding, Christof ; Madhusudan, P. ; Peña, Lucas
Proceedings of the ACM on Programming Languages. 2 (2017) POPL - p. 1-30 , 2017

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

11

Synthesis of deterministic top-down tree transducers from a..:

Löding, Christof ; Winter, Sarah
Information and Computation. 253 (2017) - p. 336-354 , 2017

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

12

Foundations for natural proofs and quantifier instantiation:

Löding, Christof ; Madhusudan, P. ; Peña, Lucas
Proceedings of the ACM on Programming Languages. 2 (2017) POPL - p. 1-30 , 2017

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

13

Automata on Infinite Trees with Equality and Disequality Co..:

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

Carayol, Arnaud ; Löding, Christof ; Serre, Olivier - p. 227-236 , 2016

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

14

Quantified data automata for linear data structures: a regi..:

Garg, Pranav ; Löding, Christof ; Madhusudan, P..
Formal Methods in System Design. 47 (2015) 1 - p. 120-157 , 2015

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

15

Efficient inclusion testing for simple classes of unambiguo..:

Isaak, Dimitri ; Löding, Christof
Information Processing Letters. 112 (2012) 14-15 - p. 578-582 , 2012

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