Automated generation of attack trees with optimal shape and labelling. (arXiv:2311.13331v1 [cs.CR])

The problem this article addresses is, given a formal specification of a
system, how to produce an attack tree that correctly and clearly describes the
ways the system can be attacked. Correctness means that the attacks displayed
by the attack tree are indeed attacks in the system; clarity means that the
tree is efficient in communicating the attack scenario. To pursue clarity, we
introduce an attack-tree generation algorithm that minimises the tree size and
the information length of its labels …

addresses article attack attacks automated correctness indeed problem system trees