2 citations · 2 across the 7 of their papers we have counts for
9 papers
Model Checking HyperRecHML is Decidable
Elli Anastasiadi, Kim Guldstrand Larsen, Martin Zimmermann
Temporal hyperlogics combine explicit quantification over traces with temporal requirements evaluated over the quantified traces. HyperRecHML is a temporal hyperlogic which allows…
The complexity of verifying the release-acquire semantics over register machines
Parosh Abdulla, Elli Anastasiadi, Mohamed Faouzi Atig +2
The Release-Acquire (RA) semantics and its variants are some of the most fundamental models of concurrent semantics for architectures, programming languages, and distributed system…
Centralized vs Decentralized Monitors for Hyperproperties
Luca Aceto, Antonis Achilleos, Elli Anastasiadi +3
This paper focuses on the runtime verification of hyperproperties expressed in Hyper-recHML, an expressive yet simple logic for describing properties of sets of traces. To this end…
Complexity results for modal logic with recursion via translations and tableaux
Luca Aceto, Antonis Achilleos, Elli Anastasiadi +2
This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular,…
Complexity through Translations for Modal Logic with Recursion
Luca Aceto, Antonis Achilleos, Elli Anastasiadi +2
This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular,…
Monitoring hyperproperties with circuits
Luca Aceto, Antonios Achilleos, Elli Anastasiadi +1
This paper presents an extension of the safety fragment of Hennessy-Milner Logic with recursion over sets of traces, in the spirit of Hyper-LTL. It then introduces a novel monitori…
In search of lost time: Axiomatising parallel composition in process algebras
Luca Aceto, Elli Anastasiadi, Valentina Castiglioni +2
This survey reviews some of the most recent achievements in the saga of the axiomatisation of parallel composition, along with some classic results. We focus on the recursion, rela…
Axiomatizing recursion-free, regular monitors
Luca Aceto, Antonis Achilleos, Elli Anastasiadi +1
Monitors are a key tool in the field of runtime verification, where they are used to verify system properties by analyzing execution traces generated by processes. Work on runtime…
Parameterized Fine-Grained Reductions
Elli Anastasiadi, Antonis Antonopoulos, Aris Pagourtzis +1
During recent years the field of fine-grained complexity has bloomed to produce a plethora of results, with both applied and theoretical impact on the computer science community. T…