Antonis Achilleos

According to our database1, Antonis Achilleos authored at least 21 papers between 2012 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
The Best a Monitor Can Do.
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020
Modal logics with hard diamond-free fragments.
J. Log. Comput., 2020

Determinizing monitors for HML with recursion.
J. Log. Algebraic Methods Program., 2020

The complexity of identifying characteristic formulae.
J. Log. Algebraic Methods Program., 2020

An axiomatization of verdict equivalence over regular monitors.
CoRR, 2020

2019
Adventures in monitorability: from branching to linear time and back again.
Proc. ACM Program. Lang., 2019

An Operational Guide to Monitorability.
Proceedings of the Software Engineering and Formal Methods - 17th International Conference, 2019

The Cost of Monitoring Alone.
Proceedings of the From Reactive Systems to Cyber-Physical Systems, 2019

Testing Equivalence vs. Runtime Monitoring.
Proceedings of the Models, Languages, and Tools for Concurrent and Distributed Programming, 2019

2018
The Completeness Problem for Modal Logic.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2018

A Framework for Parameterized Monitorability.
Proceedings of the Foundations of Software Science and Computation Structures, 2018

2017
On the Complexity of Determinizing Monitors.
Proceedings of the Implementation and Application of Automata, 2017

A Foundation for Runtime Monitoring.
Proceedings of the Runtime Verification - 17th International Conference, 2017

Monitoring for Silent Actions.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2015
NEXP-Completeness and Universal Hardness Results for Justification Logic.
Proceedings of the Computer Science - Theory and Applications, 2015

2014
A complexity question in justification logic.
J. Comput. Syst. Sci., 2014

Complexity Jumps In Multiagent Justification Logic Under Interacting Justifications.
CoRR, 2014

Tableaux and Complexity Bounds for a Multiagent Justification Logic with Interacting Justifications.
Proceedings of the Multi-Agent Systems - 12th European Conference, 2014

On the Complexity of Two-Agent Justification Logic.
Proceedings of the Computational Logic in Multi-Agent Systems, 2014

2013
Closing a Gap in the Complexity of Refinement Modal Logic.
CoRR, 2013

2012
Parameterized Modal Satisfiability.
Algorithmica, 2012


  Loading...