Jasmine Xuereb
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jasmine Xuereb has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Adrian Francalanza
University of Malta, Msida, Malta
2 shared publications - Antonis Achilleos
Dept. of Computer Science Reykjavik University Reykjavik Iceland
1 shared publication - Karoliina Lehtinen
LIS CNRS Aix-Marseille University
1 shared publication - Léo Exibard
Reykjavik University, Reykjavik, Iceland
1 shared publication
Latest Publications
- 14 June 2022
- Published by Springer Nature
- p. 181-199
A Synthesis Tool for Optimal Monitors in a Branching-Time Setting
- 14 June 2022
- Published by Springer Nature
- p. 181-199
A Synthesis Tool for Optimal Monitors in a Branching-Time Setting
- 10 June 2020
- Published by Springer Nature
- Vol. 12134, 350-369
On Implementing Symbolic Controllability
Runtime Monitors observe the execution of a system with the aim of reaching a verdict about it. One property that is expected of monitors is consistent verdict detections; this property was characterised in prior work via a symbolic analysis called symbolic controllability. This paper explores whether the proposed symbolic analysis lends itself well to the construction of a tool that checks monitors for this deterministic behaviour. We implement a prototype that automates this symbolic analysis, and establish complexity upper bounds for the algorithm used. We also consider a number of optimisations for the implemented prototype, and assess the potential gains against benchmark monitors.
- 10 June 2020
- Published by Springer Nature
- Vol. 12134, 350-369
On Implementing Symbolic Controllability
Runtime Monitors observe the execution of a system with the aim of reaching a verdict about it. One property that is expected of monitors is consistent verdict detections; this property was characterised in prior work via a symbolic analysis called symbolic controllability. This paper explores whether the proposed symbolic analysis lends itself well to the construction of a tool that checks monitors for this deterministic behaviour. We implement a prototype that automates this symbolic analysis, and establish complexity upper bounds for the algorithm used. We also consider a number of optimisations for the implemented prototype, and assess the potential gains against benchmark monitors.