EDBT 2026 Demo / reviewers in the wild / expert
Alexandros Evangelidis
dblp:201/4865
· DBLP profile ↗
7ranked-venue papers
4as first author
4since 2021 · last 2024
0000-0003-4032-3042ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4 · 2 first-author · 3 since 2021Systems, architecture and hardware · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | MULTIGAIN 2.0: MDP controller synthesis for multiple mean-payoff, LTL and steady-state constraints✱abstractWe present MultiGain 2.0, a major extension to the controller synthesis tool MultiGain, built on top of the probabilistic model checker PRISM. This new version extends MultiGain’s multi-objective capabilities, by allowing for the formal verification and synthesis of controllers for probabilistic systems with multi-dimensional long-run average reward structures, steady-state constraints, and linear temporal logic properties. Additionally, MultiGain 2.0 can modify the underlying linear program to prevent unbounded-memory and other unintuitive solutions and visualizes Pareto curves, in the two- and three-dimensional cases, to facilitate trade-off analysis in multi-objective scenarios. Severin Bals, Alexandros Evangelidis, Jan Kretínský, Jakob Waibel |
HSCC | 2 |
| 2024 | Poster Abstract: MULTIGAIN 2.0: MDP controller synthesis for multiple mean-payoff, LTL and steady-state constraints✱abstractWe present MultiGain 2.0, a major extension to the controller synthesis tool MultiGain, built on top of the probabilistic model checker PRISM. This new version extends MultiGain’s multi-objective capabilities, by allowing for the formal verification and synthesis of controllers for probabilistic systems with multi-dimensional long-run average reward structures, steady-state constraints, and linear temporal logic properties. Additionally, MultiGain 2.0 can modify the underlying linear program to prevent unbounded-memory and other unintuitive solutions and visualizes Pareto curves, in the two- and three-dimensional cases, to facilitate trade-off analysis in multi-objective scenarios. Severin Bals, Alexandros Evangelidis, Jan Kretínský, Jakob Waibel |
HSCC | 2 |
| 2022 | Optimistic and Topological Value Iteration for Simple Stochastic Games
Muqsit Azeem, Alexandros Evangelidis, Jan Kretínský, Alexander Slivinskiy, Maximilian Weininger |
ATVA | 2 |
| 2021 | Quantitative verification of Kalman filtersabstractAbstract Kalman filters are widely used for estimating the state of a system based on noisy or inaccurate sensor readings, for example in the control and navigation of vehicles or robots. However, numerical instability or modelling errors may lead to divergence of the filter, leading to erroneous estimations. Establishing robustness against such issues can be challenging. We propose novel formal verification techniques and software to perform a rigorous quantitative analysis of the effectiveness of Kalman filters. We present a general framework for modelling Kalman filter implementations operating on linear discrete-time stochastic systems, and techniques to systematically construct a Markov model of the filter's operation using truncation and discretisation of the stochastic noise model. Numerical stability and divergence properties are then verified using probabilistic model checking. We evaluate the scalability and accuracy of our approach on two distinct probabilistic kinematic models and four Kalman filter implementations. Alexandros Evangelidis, David Parker 0001 |
Formal Aspects Comput. | 1 |
| 2019 | Quantitative Verification of Numerical Stability for Kalman Filters
Alexandros Evangelidis, David Parker 0001 |
FM | 1 |
| 2018 | Performance modelling and verification of cloud-based auto-scaling policies
Alexandros Evangelidis, David Parker 0001, Rami Bahsoon |
Future Gener. Comput. Syst. | 1 |
| 2017 | Performance Modelling and Verification of Cloud-based Auto-Scaling PoliciesabstractAuto-scaling, a key property of cloud computing, allows application owners to acquire and release resources on demand. However, the shared environment, along with the exponentially large configuration space of available parameters, makes configuration of auto-scaling policies a challenging task. In particular, it is difficult to quantify, a priori, the impact of a policy on Quality of Service (QoS) provision. To address this problem, we propose a novel approach based on performance modelling and formal verification to produce performance guarantees on particular rule-based auto-scaling policies. We demonstrate the usefulness and efficiency of our model through a detailed validation process on the Amazon EC2 cloud, using two types of load patterns. Our experimental results show that it can be very effective in helping a cloud application owner configure an auto-scaling policy in order to minimise the QoS violations. Alexandros Evangelidis, David Parker 0001, Rami Bahsoon |
CCGrid | 1 |