Karoliina Lehtinen
Karoliina Lehtinen
CNRS, Aix-Marseille Université, LIS
Verified email at lis-lab.fr - Homepage
Title
Cited by
Cited by
Year
A modal μ perspective on solving parity games in quasi-polynomial time
K Lehtinen
LICS 2018 Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in …, 2018
472018
Adventures in monitorability: from branching to linear time and back again
L Aceto, A Achilleos, A Francalanza, A Ingólfsdóttir, K Lehtinen
POPL 2019 Proceedings of the ACM on Programming Languages 3 (POPL), 1-29, 2019
402019
An operational guide to monitorability
L Aceto, A Achilleos, A Francalanza, A Ingólfsdóttir, K Lehtinen
SEFM 2019 International Conference on Software Engineering and Formal …, 2019
202019
Good for games automata: From nondeterminism to alternation
U Boker, K Lehtinen
CONCUR 2019 30th International Conference on Concurrency Theory 140, 19:1--19:16, 2019
122019
Alternating weak automata from universal trees
L Daviaud, M Jurdzinski, K Lehtinen
CONCUR 2019 30th International Conference on Concurrency Theory 140, 18:1--18:14, 2019
92019
Deciding the first levels of the modal mu alternation hierarchy by formula construction
K Lehtinen, S Quickert
CSL 2015 24th EACSL Annual Conference on Computer Science Logic, 2015
92015
On the way to alternating weak automata
U Boker, K Lehtinen
FSTTCS 2018 38th IARCS Annual Conference on Foundations of Software …, 2018
82018
Good-for-games -Pushdown Automata
K Lehtinen, M Zimmermann
LICS 2020 Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in …, 2020
72020
Disjunctive form and the modal alternation hierarchy
K Lehtinen
FICS 2015 Tenth International Workshop on Fixed Points in Computer Science, 2015
72015
An operational guide to monitorability with applications to regular properties
L Aceto, A Achilleos, A Francalanza, A Ingólfsdóttir, K Lehtinen
Software and Systems Modeling 20 (2), 335-361, 2021
62021
Register Games
K Lehtinen, U Boker
Logical Methods in Computer Science 16 (2), 2020
6*2020
The best a monitor can do
L Aceto, A Achilleos, A Francalanza, A Ingólfsdóttir, K Lehtinen
29th EACSL Annual Conference on Computer Science Logic (CSL 2021), 2021
52021
Improving the complexity of Parys' recursive algorithm
K Lehtinen, S Schewe, D Wojtczak
arXiv preprint arXiv:1904.11810, 2019
52019
Σµ 2 is decidable for Πµ 2
K Lehtinen, S Quickert
CiE 2017 Conference on Computability in Europe, 292-303, 2017
52017
The Cost of Monitoring Alone
A Ingólfsdóttir, K Lehtinen
From Reactive Systems to Cyber-Physical Systems: Essays Dedicated to Scott A …, 2019
3*2019
Testing Equivalence vs. Runtime Monitoring
L Aceto, A Achilleos, A Francalanza, A Ingólfsdóttir, K Lehtinen
Models, Languages, and Tools for Concurrent and Distributed Programming, 28-44, 2019
32019
Better Late Than Never or: Verifying Asynchronous Components at Runtime
DP Attard, L Aceto, A Achilleos, A Francalanza, A Ingólfsdóttir, K Lehtinen
International Conference on Formal Techniques for Distributed Objects …, 2021
12021
A Recursive Approach to Solving Parity Games in Quasipolynomial Time
K Lehtinen, P Parys, S Schewe, D Wojtczak
arXiv preprint arXiv:2104.09717, 2021
12021
On the Succinctness of Alternating Parity Good-for-Games Automata (Full Version)
U Boker, D Kuperberg, K Lehtinen, M Skrzypczak
arXiv preprint arXiv:2009.14437, 2020
12020
On Succinctness and Recognisability of Alternating Good-for-Games Automata
U Boker, D Kuperberg, K Lehtinen, M Skrzypczak
arXiv preprint arXiv:2002.07278, 2020
12020
The system can't perform the operation now. Try again later.
Articles 1–20