References

  1. Maxime Audinot, Sophie Pinchinat & Barbara Kordy (2017): Is my attack tree correct?. In: European Symposium on Research in Computer Security. Springer, pp. 83–102, doi:10.1007/978-3-319-66402-6_7.
  2. Ashok K Chandra & Larry J Stockmeyer (1976): Alternation. In: 17th Annual Symposium on Foundations of Computer Science (sfcs 1976). IEEE, pp. 98–108, doi:10.1109/SFCS.1976.4.
  3. Hubert Comon, Max Dauchet, Rémi Gilleron, Florent Jacquemard, Denis Lugiez, Christof Löding, Sophie Tison & Marc Tommasi (2008): Tree automata techniques and applications.
  4. Luca De Alfaro, Thomas A Henzinger & Orna Kupferman (2007): Concurrent reachability games. Theoretical computer science 386(3), pp. 188–217, doi:10.1016/j.tcs.2007.07.008.
  5. Ross Horne, Sjouke Mauw & Alwen Tiu (2017): Semantics for specialising attack trees based on linear logic. Fundamenta Informaticae 153(1-2), pp. 57–86, doi:10.3233/FI-2017-1531.
  6. Ravi Jhawar, Barbara Kordy, Sjouke Mauw, Saša Radomirovi\'c & Rolando Trujillo-Rasua (2015): Attack trees with sequential conjunction. In: IFIP International Information Security and Privacy Conference. Springer, pp. 339–353, doi:10.1007/978-3-319-18467-8_23.
  7. Aivo Jürgenson & Jan Willemson (2008): Computing exact outcomes of multi-parameter attack trees. In: OTM Confederated International Conferences" On the Move to Meaningful Internet Systems". Springer, pp. 1036–1051, doi:10.1007/978-3-540-88873-4_8.
  8. Barbara Kordy, Sjouke Mauw, Saša Radomirovi\'c & Patrick Schweitzer (2010): Foundations of attack–defense trees. In: International Workshop on Formal Aspects in Security and Trust. Springer, pp. 80–95, doi:10.1007/978-3-642-19751-2_6.
  9. Barbara Kordy, Sjouke Mauw, Saša Radomirovi\'c & Patrick Schweitzer (2014): Attack–defense trees. Journal of Logic and Computation 24(1), pp. 55–87, doi:10.1093/logcom/exs029.
  10. Sjouke Mauw & Martijn Oostdijk (2005): Foundations of attack trees. In: International Conference on Information Security and Cryptology. Springer, pp. 186–198, doi:10.1007/11734727_17.
  11. Soumya Paul, Ramaswamy Ramanujam & Sunil Simon (2015): Automata and compositional strategies in extensive form games. In: Models of Strategic Reasoning. Springer, pp. 174–201, doi:10.1007/978-3-662-48540-8_6.
  12. Sophie Pinchinat, Barbara Fila, Florence Wacheux & Yann Thierry-Mieg (2019): Attack trees: a notion of missing attacks. In: International Workshop on Graphical Models for Security. Springer, pp. 23–49, doi:10.1007/978-3-030-36537-0_3.
  13. Sophie Pinchinat, François Schwarzentruber & Sébastien Lê Cong (2020): Library-Based Attack Tree Synthesis. In: International Workshop on Graphical Models for Security. Springer, pp. 24–44, doi:10.1007/978-3-030-62230-5_2.
  14. Abdallah Saffidine, Sébastien Lê Cong, Sophie Pinchinat & François Schwarzentruber (2019): The Packed Interval Covering Problem is NP-complete. arXiv preprint arXiv:1906.03676.
  15. Bruce Schneier (1999): Attack trees. Dr. Dobb’s journal 24(12), pp. 21–29, doi:10.1002/9781119183631.ch21.
  16. Wojciech Wideł, Maxime Audinot, Barbara Fila & Sophie Pinchinat (2019): Beyond 2014: Formal Methods for Attack Tree–based Security Modeling. ACM Computing Surveys (CSUR) 52(4), pp. 1–36, doi:10.1145/3331524.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org