-
The Best a Monitor can do CSL 2021 with L. Aceto, A. Achilleos, A. Francalanza, A. Ingólfsdóttir
-
On the Succinctness of Alternating Parity Good-for-Games Automata FSTTCS 2020 with U. Boker, D. Kuperberg and M. Skrzypczak
-
Good-for-games $\omega$-pushdown automata LICS 2020 with Martin Zimmermann
-
Register games. LMCS 2020 journal version of LICS'18 and FSTTCS'18 papers, with Udi Boker
-
Alternating weak automata from universal trees. CONCUR 2019 with M. Jurdzinski and L. Daviaud
-
Good for games automata: From nondeterminism to alternation CONCUR 2019 with Udi Boker
-
An Operational Guide to Monitorability SEFM 2019 with L. Aceto, A. Achilleos, A. Francalanza, A. Ingólfsdóttir
-
Adventures in monitorability: From branching time to linear time an back again. POPL 2019 with L. Aceto, A. Achilleos, A. Francalanza, A. Ingólfsdóttir
-
The cost of monitoring alone. From Reactive Systems to Cyber-Physical Systems (LNCS) 2019 with L. Aceto, A. Achilleos, A. Francalanza, A. Ingólfsdóttir
-
Testing Equivalence vs Runtime Monitoring Models, Languages, and Tools for Concurrent and Distributed Programming (LNCS) 2019 with L. Aceto, A. Achilleos, A. Francalanza, A. Ingólfsdóttir
-
On the way to alternating weak automata. FSTTCS 2018 with U. Boker
-
A modal $\mu$ perspective on solving parity games in quasi-polynomial time. LICS 2018
-
$\Sigma^{\mu}_2$ is decidable for $\Pi^{\mu}_2$. CiE 2017 with S. Quickert.
-
The descriptive complexity of modal $\mu$ model-checking parity games. GandALF 2017
-
Deciding the first levels of the modal $\mu$ calculus by formula construction. CSL 2015 with S.Quickert.
-
Disjunctive form and the modal $\mu$ alternation hierarchy. FICS 2015
Pre-prints
-
On succinctness and recognisability of alternating good-for-games automata with Udi Boker, Denis Kuperberg, and Michał Skrzypczak
-
Improving the complexity of Parys' recursive algorithm with Sven Schewe and Dominik Wojtczak
Theses
-
Syntactic complexity in the modal $\mu$ calculus. Doctoral thesis from the University of Edinburgh 2017.
-
Parity games and the automaticity of modal $\mu$. M.Phil thesis from the University of Cambridge 2012.