Beyond 2014: Formal Methods for Attack Tree--based Security Modeling
W Wideł, M Audinot, B Fila, S Pinchinat - ACM Computing Surveys …, 2019 - dl.acm.org
Attack trees are a well established and commonly used framework for security modeling.
They provide a readable and structured representation of possible attacks against a system …
They provide a readable and structured representation of possible attacks against a system …
Probabilistic model checking and autonomy
M Kwiatkowska, G Norman… - Annual review of control …, 2022 - annualreviews.org
The design and control of autonomous systems that operate in uncertain or adversarial
environments can be facilitated by formal modeling and analysis. Probabilistic model …
environments can be facilitated by formal modeling and analysis. Probabilistic model …
Graph games and reactive synthesis
Graph-based games are an important tool in computer science. They have applications in
synthesis, verification, refinement, and far beyond. We review graph-based games with …
synthesis, verification, refinement, and far beyond. We review graph-based games with …
Synthesis of human-in-the-loop control protocols for autonomous systems
L Feng, C Wiltsche, L Humphrey… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
We propose an approach to synthesize control protocols for autonomous systems that
account for uncertainties and imperfections in interactions with human operators. As an …
account for uncertainties and imperfections in interactions with human operators. As an …
Quantitative verification and synthesis of attack-defence scenarios
Attack-defence trees are a powerful technique for formally evaluating attack-defence
scenarios. They represent in an intuitive, graphical way the interaction between an attacker …
scenarios. They represent in an intuitive, graphical way the interaction between an attacker …
Compositional value iteration with pareto caching
The de-facto standard approach in MDP verification is based on value iteration (VI). We
propose compositional VI, a framework for model checking compositional MDPs, that …
propose compositional VI, a framework for model checking compositional MDPs, that …
PRISM-games: verification and strategy synthesis for stochastic multi-player games with multiple objectives
M Kwiatkowska, D Parker, C Wiltsche - International Journal on Software …, 2018 - Springer
PRISM-games is a tool for modelling, verification and strategy synthesis for stochastic multi-
player games. These allow models to incorporate both probability, to represent uncertainty …
player games. These allow models to incorporate both probability, to represent uncertainty …
Automatic verification of concurrent stochastic systems
Automated verification techniques for stochastic games allow formal reasoning about
systems that feature competitive or collaborative behaviour among rational agents in …
systems that feature competitive or collaborative behaviour among rational agents in …
Controller synthesis for autonomous systems interacting with human operators
We propose an approach to synthesize control protocols for autonomous systems that
account for uncertainties and imperfections in interactions with human operators. As an …
account for uncertainties and imperfections in interactions with human operators. As an …
[HTML][HTML] Quantitative verification and strategy synthesis for stochastic games
M Svoreňová, M Kwiatkowska - European Journal of Control, 2016 - Elsevier
Abstract Design and control of computer systems that operate in uncertain, competitive or
adversarial, environments can be facilitated by formal modelling and analysis. In this paper …
adversarial, environments can be facilitated by formal modelling and analysis. In this paper …