![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
5th GraMSec@FLoC 2018: Oxford, UK
- George Cybenko, David J. Pym, Barbara Fila:
5th International Workshop on Graphical Models for Security, held in conjunction with the Federated Logic Conference (FLoC) 2018, GraMSec@FLoC 2018, Oxford, UK, July 8, 2018, Revised Selected Papers. Lecture Notes in Computer Science 11086, Springer 2019, ISBN 978-3-030-15464-6 - Mansoor Ahmed-Rengers, Ilia Shumailov, Ross Anderson:
Tendrils of Crime: Visualizing the Diffusion of Stolen Bitcoins. 1-12 - Maxime Audinot, Sophie Pinchinat, François Schwarzentruber, Florence Wacheux:
Deciding the Non-emptiness of Attack Trees. 13-30 - Sabarathinam Chockalingam
, Wolter Pieters, André Teixeira, Nima Khakzad
, Pieter H. A. J. M. van Gelder:
Combining Bayesian Networks and Fishbone Diagrams to Distinguish Between Intentional Attacks and Accidental Technical Failures. 31-50 - Marlon Dumas
, Luciano García-Bañuelos
, Peeter Laud:
Disclosure Analysis of SQL Workflows. 51-70 - Harley Eades III, Jiaming Jiang, Aubrey Bryant:
On Linear Logic, Functional Programming, and Attack Trees. 71-89 - Ross Horne
, Sjouke Mauw, Alwen Tiu:
The Attacker Does not Always Hold the Initiative: Attack Trees with External Refinement. 90-110 - Haozhe Zhang, Ioannis Agrafiotis, Arnau Erola, Sadie Creese, Michael Goldsmith:
A State Machine System for Insider Threat Detection. 111-129
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.