Publications

My Google Scholar profile can be found here.

My DBLP page can be found here.

Journal Publications:

• L. Aceto, A. Achilleos, E. Anastasiadi and A. Ingolfsdottir. Axiomatizing recursion-free, regular monitors. Journal of Logical and Algebraic Methods in Programming, special issue devoted to selected papers from NWPT 2019, 2022. To appear. [Publisher's version] [Author's preprint]

• with Luca Aceto, Adrian Francalanza, Anna Ingólfsdóttir, and Karoliina Lehtinen: An operational guide to monitorability with applications to regular properties. In Software and Systems Modeling (2021). link to paper

• with Luca Aceto, Adrian Francalanza, and Anna Ingólfsdóttir: The Complexity of Identifying Characteristic Formulae. In Journal of Logical and Algebraic Methods in Programming (2020). link to preprint

• Modal Logics with Hard Diamond-free Fragments. In Journal of Logic and Computation (special issue on Logical Foundations of Computer Science, March 2020). link to paper

• with Luca Aceto, Adrian Francalanza, Anna Ingólfsdóttir, and Sævar Örn Kjartansson: Determinizing Monitors for HML with Recursion. In Journal of Logical and Algebraic Methods in Programming (February 2020). link to paper  link to arXiv 

• with Luca Aceto, Adrian Francalanza, Anna Ingólfsdóttir, and Karoliina Lehtinen: Adventures in Monitorablity: From Branching to Linear Time and Back Again. POPL 2019. link slides

• A Complexity Question in Justification Logic. In Journal of Computer and System Sciences 2014 

• with Michael Lampis, Valia Mitsou: Parameterized Modal Satisfiability. In Algorithmica 2012

Conference Publications:

• Antonis Achilleos and Aggeliki Chalki. Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes. MFCS 2023 [preprint]

• Luca Aceto, Antonis Achilleos, Elli Anastasiadi, Adrian Francalanza, Anna Ingólfsdóttir. Complexity through Translations for Modal Logic with Recursion. GandALF 2022. [preprint]

• Antonis Achilleos, Léo Exibard, Adrian Francalanza, Karoliina Lehtinen and Jasmine Xuereb. A Synthesis Tool for Optimal Monitors in a Branching-Time Setting. Tool paper,  COORDINATION 2022.  [author preprint version] 

• Luca Aceto, Antonis Achilleos, Duncan Paul Attard, Léo Exibard, Adrian Francalanza and Anna Ingolfsdottir A Monitoring Tool for the Linear-Time μHML. Tool paper, COORDINATION 2022. [author preprint version] 

• Elli Anastasiadi, Antonis Achilleos and Adrian Francalanza. Monitoring Hyperproperties with Circuits. Short paper, FORTE 2022. [author preprint version] 

• with Duncan Paul Attard, Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen: Better Late Than Never or: Verifying Asynchronous Components at Runtime. DisCoTec 2021.  link to arXiv

• with Mathias Ruggaard Pedersen: Axiomatizations and Computability of Weighted Monadic Second-Order Logic. LICS 2021. link to arXiv   link to short talk

• with Luca Aceto, Adrian Francalanza, Anna Ingólfsdóttir, and Karoliina Lehtinen: The Best a Monitor Can Do. CSL 2021. link to paper

• with Luca Aceto, Adrian Francalanza, Anna Ingólfsdóttir, and Karoliina Lehtinen: An Operational Guide to Monitorablity. SEFM 2019. link to arXiv preprint

• with Luca Aceto, Adrian Francalanza, and Anna Ingólfsdóttir: A Framework for Parameterized Monitorablity. In FoSSaCS 2018. preprint   full paper   slides 

• The Completeness Problem for Modal Logic. In LFCS 2018. link to arXiv  slides

• with Luca Aceto, Adrian Francalanza, Anna Ingólfsdóttir: Monitoring for Silent Actions. In FSTTCS 2017. link slides

• with Adrian Francalanza, Luca Aceto, Duncan Paul Attard, Ian Cassar, Dario Della Monica, Anna Ingólfsdóttir: A Foundation for Runtime Monitoring. In RV 2017

• with Luca Aceto, Adrian Francalanza, Anna Ingólfsdóttir, and Sævar Örn Kjartansson: On the Complexity of Determinizing Monitors. In CIAA 2017. slides

• Modal Logics with Hard Diamond-free Fragments. In LFCS 2016. link to arXiv

• NEXP-completeness and Universal Hardness Results for Justification Logic. In CSR 2015. Extended version available on arXiv.

• Tableaux and Complexity Bounds for a Multiagent Justification Logic with Interacting Justifications. In EUMAS 2014

• On the Complexity of Two-agent Justification Logic. In CLIMA XV (2014)

• Complexity bounds for Multiagent Justification Logic. In the Logic Colloquium 2014

• A Complexity Question in Justification Logic. In WoLLIC 2011

• with Michael Lampis, Valia Mitsou: Parameterized Modal Satisfiability. In ICALP 2010

Book chapters:

• Antonis Achilleos, Elli Anastasiadi, Adrian Francalanza, Karoliina Lehtinen and Mathias Ruggaard Pedersen. On Probabilistic Monitorability. Principles of Systems Design: Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday (2022). preprint

• with Luca Aceto, Adrian Francalanza, Anna Ingólfsdóttir and Karoliina Lehtinen. The Cost of Monitoring Alone. From Reactive Systems to Cyber-Physical Systems - Essays Dedicated to Scott A. Smolka on the Occasion of His 65th Birthday (2019). link to arXiv 

• with Luca Aceto, Adrian Francalanza, Anna Ingólfsdóttir and Karoliina Lehtinen. Testing Equivalence vs. Runtime Monitoring. In Models, Languages, and Tools for Concurrent and Distributed Programming - Essays Dedicated to Rocco De Nicola on the Occasion of His 65th Birthday (2019). link to preprint

PhD thesis:

• Interactions and Complexity in Multi-Agent Justification Logic. The Graduate Center, CUNY, 2015.  PDF

Under Submission:

• with Michael Lampis: Closing a Gap in the Complexity of Refinement Modal Logic. link to arXiv