Attack Trees in Isabelle - CTL semantics, correctness and completeness

Abstract

In this paper, we present a proof theory for attack trees. Attack trees are a well established and useful model for the construction of attacks on systems since they allow a stepwise exploration of high level attacks in application scenarios. Using the expressiveness of Higher Order Logic in Isabelle, we succeed in developing a generic theory of attack… (More)

4 Figures and Tables

Topics

  • Presentations referencing similar topics