{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:52:24Z","timestamp":1771026744643,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031471148","type":"print"},{"value":"9783031471155","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-47115-5_10","type":"book-chapter","created":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T15:04:38Z","timestamp":1698678278000},"page":"165-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Attack Time Analysis in Dynamic Attack Trees via Integer Linear Programming"],"prefix":"10.1007","author":[{"given":"Milan","family":"Lopuha\u00e4-Zwakenberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mari\u00eblle","family":"Stoelinga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,31]]},"reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1080\/23742917.2019.1698178","volume":"4","author":"E Agyepong","year":"2020","unstructured":"Agyepong, E., Cherdantseva, Y., Reinecke, P., Burnap, P.: Challenges and performance metrics for security operations center analysts: a systematic review. J. Cyber Secur. Technol. 4(3), 125\u2013152 (2020)","journal-title":"J. Cyber Secur. Technol."},{"key":"10_CR2","unstructured":"Ali, A.T., Gruska, D.P.: Attack trees with time constraints. In: CS &P, pp. 93\u2013105 (2021)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-319-24249-1_25","volume-title":"Computer Safety, Reliability, and Security","author":"F Arnold","year":"2015","unstructured":"Arnold, F., Guck, D., Kumar, R., Stoelinga, M.: Sequential and parallel attack tree modelling. In: Koornneef, F., van Gulijk, C. (eds.) SAFECOMP 2015. LNCS, vol. 9338, pp. 291\u2013299. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24249-1_25"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-54792-8_16","volume-title":"Principles of Security and Trust","author":"F Arnold","year":"2014","unstructured":"Arnold, F., Hermanns, H., Pulungan, R., Stoelinga, M.: Time-dependent analysis of attacks. In: Abadi, M., Kremer, S. (eds.) POST 2014. LNCS, vol. 8414, pp. 285\u2013305. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54792-8_16"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Budde, C.E., Stoelinga, M.: Efficient algorithms for quantitative attack tree analysis. In: 2021 IEEE 34th Computer Security Foundations Symposium (CSF), pp. 1\u201315 (2021). https:\/\/doi.org\/10.1109\/CSF51468.2021.00041","DOI":"10.1109\/CSF51468.2021.00041"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/11962977_19","volume-title":"Critical Information Infrastructures Security","author":"A Buldas","year":"2006","unstructured":"Buldas, A., Laud, P., Priisalu, J., Saarepera, M., Willemson, J.: Rational choice of security measures via multi-parameter attack trees. In: Lopez, J. (ed.) CRITIS 2006. LNCS, vol. 4347, pp. 235\u2013248. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11962977_19"},{"key":"10_CR7","unstructured":"Byres, E.J., Franz, M., Miller, D.: The use of attack trees in assessing vulnerabilities in SCADA systems. In: Proceedings of the International Infrastructure Survivability Workshop, pp. 3\u201310. Citeseer (2004)"},{"key":"10_CR8","unstructured":"Chen, D.S., Batson, R.G., Dang, Y.: Applied Integer Programming: Modeling and Solution. Wiley, New York (2011)"},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1109\/24.537011","volume":"45","author":"Y Dutuit","year":"1996","unstructured":"Dutuit, Y., Rauzy, A.: A linear-time algorithm to find modules of fault trees. IEEE Trans. Reliab. 45(3), 422\u2013425 (1996)","journal-title":"IEEE Trans. Reliab."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Fila, B., Wide\u0142, W.: Exploiting attack-defense trees to find an optimal set of countermeasures. In: 2020 IEEE 33rd Computer Security Foundations Symposium (CSF), pp. 395\u2013410. IEEE (2020)","DOI":"10.1109\/CSF49147.2020.00035"},{"key":"10_CR11","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-319-48393-1_24","volume-title":"The Practice of Enterprise Modeling","author":"M Fraile","year":"2016","unstructured":"Fraile, M., Ford, M., Gadyatskaya, O., Kumar, R., Stoelinga, M., Trujillo-Rasua, R.: Using attack-defense trees to analyze threats and countermeasures in an ATM: a case study. In: Horkoff, J., Jeusfeld, M.A., Persson, A. (eds.) PoEM 2016. LNBIP, vol. 267, pp. 326\u2013334. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48393-1_24"},{"key":"10_CR12","unstructured":"Fran\u00e7ois-Xavier, A., Olivier, B., Gr\u00e9gory, B., Vania, C., Herv\u00e9, D.: Bayesian attack model for dynamic risk assessment. arXiv:1606.09042 (2016). Preprint"},{"key":"10_CR13","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2022). https:\/\/www.gurobi.com"},{"key":"10_CR14","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-319-18467-8_23","volume-title":"ICT Systems Security and Privacy Protection","author":"R Jhawar","year":"2015","unstructured":"Jhawar, R., Kordy, B., Mauw, S., Radomirovi\u0107, S., Trujillo-Rasua, R.: Attack trees with sequential conjunction. In: Federrath, H., Gollmann, D. (eds.) SEC 2015. IAICT, vol. 455, pp. 339\u2013353. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18467-8_23"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1007\/978-3-540-88873-4_8","volume-title":"On the Move to Meaningful Internet Systems: OTM 2008","author":"A J\u00fcrgenson","year":"2008","unstructured":"J\u00fcrgenson, A., Willemson, J.: Computing exact outcomes of multi-parameter attack trees. In: Meersman, R., Tari, Z. (eds.) OTM 2008. LNCS, vol. 5332, pp. 1036\u20131051. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88873-4_8"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cosrev.2014.07.001","volume":"13","author":"B Kordy","year":"2014","unstructured":"Kordy, B., Pi\u00e8tre-Cambac\u00e9d\u00e8s, L., Schweitzer, P.: DAG-based attack and defense modeling: don\u2019t miss the forest for the attack trees. Comput. Sci. Rev. 13, 1\u201338 (2014)","journal-title":"Comput. Sci. Rev."},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-319-89722-6_14","volume-title":"Principles of Security and Trust","author":"B Kordy","year":"2018","unstructured":"Kordy, B., Wide\u0142, W.: On quantitative analysis of attack\u2013defense trees with repeated labels. In: Bauer, L., K\u00fcsters, R. (eds.) POST 2018. LNCS, vol. 10804, pp. 325\u2013346. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89722-6_14"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-22975-1_11","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"R Kumar","year":"2015","unstructured":"Kumar, R., Ruijters, E., Stoelinga, M.: Quantitative attack tree analysis via priced timed automata. In: Sankaranarayanan, S., Vicario, E. (eds.) FORMATS 2015. LNCS, vol. 9268, pp. 156\u2013171. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22975-1_11"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-319-89363-1_4","volume-title":"Fundamental Approaches to Software Engineering","author":"R Kumar","year":"2018","unstructured":"Kumar, R., et al.: Effective analysis of attack trees: a model-driven approach. In: Russo, A., Sch\u00fcrr, A. (eds.) FASE 2018. LNCS, vol. 10802, pp. 56\u201373. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89363-1_4"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Lofberg, J.: YALMIP: a toolbox for modeling and optimization in MATLAB. In: 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No. 04CH37508), pp. 284\u2013289. IEEE (2004)","DOI":"10.1109\/CACSD.2004.1393890"},{"key":"10_CR21","unstructured":"Lopuha\u00e4-Zwakenberg, M., Stoelinga, M.: Attack time analysis in dynamic attack trees via integer linear programming. arXiv:2111.05114 (2021). Preprint"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Lopuha\u00e4-Zwakenberg, M.: Attack time analysis in dynamic attack trees via integer linear programming (2023). https:\/\/zenodo.org\/record\/8173951","DOI":"10.1007\/978-3-031-47115-5_10"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/11734727_17","volume-title":"Information Security and Cryptology - ICISC 2005","author":"S Mauw","year":"2006","unstructured":"Mauw, S., Oostdijk, M.: Foundations of attack trees. In: Won, D.H., Kim, S. (eds.) ICISC 2005. LNCS, vol. 3935, pp. 186\u2013198. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11734727_17"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"McQueen, M.A., Boyer, W.F., Flynn, M.A., Beitel, G.A.: Time-to-compromise model for cyber risk reduction estimation. In: Gollmann, D., Massacci, F., Yautsiukhin, A. (eds.) Quality of Protection. Advances in Information Security, vol. 23, pp. 49\u201364. Springer, Cham (2006). https:\/\/doi.org\/10.1007\/978-0-387-36584-8_5","DOI":"10.1007\/978-0-387-36584-8_5"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Meyur, R.: A Bayesian attack tree based approach to assess cyber-physical security of power system. In: 2020 IEEE Texas Power and Energy Conference (TPEC), pp. 1\u20136. IEEE (2020)","DOI":"10.1109\/TPEC48276.2020.9042529"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Paul, S.: Towards automating the construction & maintenance of attack trees: a feasibility study. arXiv:1404.1986 (2014). Preprint","DOI":"10.4204\/EPTCS.148.3"},{"issue":"1","key":"10_CR27","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0951-8320(02)00107-2","volume":"78","author":"KA Reay","year":"2002","unstructured":"Reay, K.A., Andrews, J.D.: A fault tree analysis strategy using binary decision diagrams. Reliab. Eng. Syst. Saf. 78(1), 45\u201356 (2002)","journal-title":"Reliab. Eng. Syst. Saf."},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Rencelj Ling, E., Ekstedt, M.: Estimating the time-to-compromise of exploiting industrial control system vulnerabilities. In: 8th International Conference on Information Systems Security and Privacy-ICISSP, vol. 1, pp. 96\u2013107 (2022)","DOI":"10.5220\/0010817400003120"},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.cosrev.2015.03.001","volume":"15","author":"E Ruijters","year":"2015","unstructured":"Ruijters, E., Stoelinga, M.: Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools. Comput. Sci. Rev. 15, 29\u201362 (2015)","journal-title":"Comput. Sci. Rev."},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Vigo, R., Nielson, F., Nielson, H.R.: Automated generation of attack trees. In: 2014 IEEE 27th Computer Security Foundations Symposium, pp. 337\u2013350. IEEE (2014)","DOI":"10.1109\/CSF.2014.31"},{"issue":"23","key":"10_CR31","doi-asserted-by":"publisher","first-page":"8423","DOI":"10.3390\/app10238423","volume":"10","author":"D Vitkus","year":"2020","unstructured":"Vitkus, D., Salter, J., Goranin, N., \u010ceponis, D.: Method for attack tree data transformation and import into it risk analysis expert systems. Appl. Sci. 10(23), 8423 (2020)","journal-title":"Appl. Sci."},{"issue":"4","key":"10_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3331524","volume":"52","author":"W Wide\u0142","year":"2019","unstructured":"Wide\u0142, W., Audinot, M., Fila, B., Pinchinat, S.: Beyond 2014: formal methods for attack tree-based security modeling. ACM Comput. Surv. (CSUR) 52(4), 1\u201336 (2019)","journal-title":"ACM Comput. Surv. (CSUR)"}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47115-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T01:38:53Z","timestamp":1730425133000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47115-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031471148","9783031471155"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47115-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"31 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Software Engineering and Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Eindhoven","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sefm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sefm-conference.github.io\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}