{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T22:14:32Z","timestamp":1761948872789,"version":"3.40.3"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031471148"},{"type":"electronic","value":"9783031471155"}],"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_12","type":"book-chapter","created":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T15:04:38Z","timestamp":1698678278000},"page":"205-225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["$$\\textsf{ATM}$$: A Logic for\u00a0Quantitative Security Properties on\u00a0Attack Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5522-4798","authenticated-orcid":false,"given":"Stefano M.","family":"Nicoletti","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5687-854X","authenticated-orcid":false,"given":"Milan","family":"Lopuha\u00e4-Zwakenberg","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9348-7684","authenticated-orcid":false,"given":"Ernst Moritz","family":"Hahn","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6793-8165","authenticated-orcid":false,"given":"Mari\u00eblle","family":"Stoelinga","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,31]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.1993.1024","volume":"104","author":"R Alur","year":"1993","unstructured":"Alur, R., Courcoubetis, C., Dill, D.: Model-checking in dense real-time. Inf. Comput. 104(1), 2\u201334 (1993)","journal-title":"Inf. Comput."},{"unstructured":"Andersen, H.R.: An intro. to binary decision diagrams. Lecture notes, available online, IT University of Copenhagen, p. 5 (1997)","key":"12_CR2"},{"unstructured":"Apvrille, L., Roudier, Y.: SysML-sec: a sysML environment for the design and development of secure embedded systems. In: APCOSEC (2013)","key":"12_CR3"},{"key":"12_CR4","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":"12_CR5","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"},{"unstructured":"Barlow, R.E., Proschan, F.: Statistical theory of reliability and life testing: probability models. In: International Series in Decision Processes, Holt, Rinehart and Winston (1975)","key":"12_CR6"},{"doi-asserted-by":"crossref","unstructured":"Basg\u00f6ze, D., Volk, M., Katoen, J., Khan, S., Stoelinga, M.: BDDs strike back - efficient analysis of static and dynamic fault trees. In: NFM, vol. 13260, pp. 713\u2013732 (2022)","key":"12_CR7","DOI":"10.1007\/978-3-031-06773-0_38"},{"key":"12_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-4129-7","volume-title":"Mathematical Logic for Computer Science","author":"M Ben-Ari","year":"2012","unstructured":"Ben-Ari, M.: Mathematical Logic for Computer Science. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-1-4471-4129-7"},{"doi-asserted-by":"crossref","unstructured":"Bieber, P., Castel, C., Seguin, C.: Combination of fault tree analysis and model checking for safety assessment of complex system. In: EDCC, vol. 2485, pp. 19\u201331 (2002)","key":"12_CR9","DOI":"10.1007\/3-540-36080-8_3"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-319-74860-3_2","volume-title":"Graphical Models for Security","author":"A Bossuat","year":"2018","unstructured":"Bossuat, A., Kordy, B.: Evil twins: handling repetitions in attack\u2013defense trees. In: Liu, P., Mauw, S., St\u00f8len, K. (eds.) GraMSec 2017. LNCS, vol. 10744, pp. 17\u201337. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-74860-3_2"},{"doi-asserted-by":"crossref","unstructured":"Boudali, H., Crouzen, P., Stoelinga, M.: Dynamic fault tree analysis using input\/output interactive markov chains. In: DSN, pp. 708\u2013717 (2007)","key":"12_CR11","DOI":"10.1109\/DSN.2007.37"},{"issue":"5","key":"12_CR12","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1093\/comjnl\/bxq024","volume":"54","author":"M Bozzano","year":"2011","unstructured":"Bozzano, M., Cimatti, A., Katoen, J., Nguyen, V.Y., Noll, T., Roveri, M.: Safety, dependability and performance analysis of extended AADL models. Comput. J. 54(5), 754\u2013775 (2011)","journal-title":"Comput. J."},{"doi-asserted-by":"crossref","unstructured":"Brace, K.S., Rudell, R.L., Bryant, R.E.: Efficient implementation of a BDD package. In: 27th ACM\/IEEE Design Automation Conference, pp. 40\u201345 (1990)","key":"12_CR13","DOI":"10.1145\/123186.123222"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-662-54580-5_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"CE Budde","year":"2017","unstructured":"Budde, C.E., Dehnert, C., Hahn, E.M., Hartmanns, A., Junges, S., Turrini, A.: JANI: quantitative model and tool interaction. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10206, pp. 151\u2013168. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54580-5_9"},{"doi-asserted-by":"crossref","unstructured":"Budde, C.E., Stoelinga, M.: Efficient algorithms for quantitative attack tree analysis. In: CSF, pp. 1\u201315 (2021)","key":"12_CR15","DOI":"10.1109\/CSF51468.2021.00041"},{"key":"12_CR16","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"},{"unstructured":"Celestrack: Orbiting CubeSATs (2023). https:\/\/celestrak.org\/NORAD\/elements\/gp.php?GROUP=cubesat &FORMAT=tle. Accessed Mar 2023","key":"12_CR17"},{"doi-asserted-by":"publisher","unstructured":"Clarke, E.M., Emerson, E.: Design and synthesis of synchronisation skeletons using branching time temporal logic. In: Logic of Programs, Proceedings of Workshop, LNCS, vol. 31, pp. 52\u201371 (1981). Springer, Heidelberg. https:\/\/doi.org\/10.1007\/bfb0025774","key":"12_CR18","DOI":"10.1007\/bfb0025774"},{"unstructured":"CORDIS, European Commission: MISSION (2023). https:\/\/cordis.europa.eu\/project\/id\/101008233","key":"12_CR19"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/3-540-49519-3_33","volume-title":"Formal Methods in Computer-Aided Design","author":"D D\u00e9harbe","year":"1998","unstructured":"D\u00e9harbe, D., Shankar, S., Clarke, E.M.: Model checking VHDL with CV. In: Gopalakrishnan, G., Windley, P. (eds.) FMCAD 1998. LNCS, vol. 1522, pp. 508\u2013514. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49519-3_33"},{"issue":"3","key":"12_CR21","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."},{"doi-asserted-by":"crossref","unstructured":"Falco, G., Viswanathan, A., Santangelo, A.: Cubesat security attack tree analysis. In: SMC-IT, pp. 68\u201376 (2021)","key":"12_CR22","DOI":"10.1109\/SMC-IT51442.2021.00016"},{"unstructured":"Fraire, J.: All active CubeSATs as of 2023 (according to Celestrak). https:\/\/www.youtube.com\/watch?v=PIkwxOvPLTw. Accessed Aug 2023","key":"12_CR23"},{"doi-asserted-by":"publisher","unstructured":"Fumagalli, M., et al.: On the semantics of risk propagation. In: International Conference on Research Challenges in Information Science, pp. 69\u201386. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-33080-3_5","key":"12_CR24","DOI":"10.1007\/978-3-031-33080-3_5"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-319-43425-4_10","volume-title":"Quantitative Evaluation of Systems","author":"O Gadyatskaya","year":"2016","unstructured":"Gadyatskaya, O., Jhawar, R., Kordy, P., Lounis, K., Mauw, S., Trujillo-Rasua, R.: Attack trees for practical security assessment: ranking of attack scenarios with ADTool 2.0. In: Agha, G., Van Houdt, B. (eds.) QEST 2016. LNCS, vol. 9826, pp. 159\u2013162. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-43425-4_10"},{"key":"12_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9333-5","volume-title":"Semirings and their Applications","author":"JS Golan","year":"2013","unstructured":"Golan, J.S.: Semirings and their Applications. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-94-015-9333-5"},{"issue":"7","key":"12_CR27","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1109\/32.708570","volume":"24","author":"KM Hansen","year":"1998","unstructured":"Hansen, K.M., Ravn, A.P., Stavridou, V.: From safety analysis to software requirements. IEEE Trans. Softw. Eng. 24(7), 573\u2013584 (1998)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"5","key":"12_CR28","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BF01211866","volume":"6","author":"H Hansson","year":"1994","unstructured":"Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects Comput. 6(5), 512\u2013535 (1994)","journal-title":"Formal Aspects Comput."},{"unstructured":"Hejduk, M.D., Casali, S.J., Cappellucci, D.A., Ericson, N.L., Snow, D.: A catalogue-wide implementation of general perturbations orbit determination extrapolated from higher order orbital theory solutions. In: Proceedings of the 23rd AAS\/AIAA Space Flight Mechanics Meeting, pp. 619\u2013632 (2013)","key":"12_CR29"},{"issue":"1\u20132","key":"12_CR30","first-page":"57","volume":"153","author":"R Horne","year":"2017","unstructured":"Horne, R., Mauw, S., Tiu, A.: Semantics for specialising attack trees based on linear logic. Fund. Inf. 153(1\u20132), 57\u201386 (2017)","journal-title":"Fund. Inf."},{"unstructured":"Isograph: AttackTree. https:\/\/www.isograph.com\/software\/attacktree\/. Accessed Mar 2023","key":"12_CR31"},{"unstructured":"Jet Propulsion Laboratory NASA: CubeSATs and SmallSATs. https:\/\/www.jpl.nasa.gov\/topics\/cubesats. Accessed Mar 2023","key":"12_CR32"},{"doi-asserted-by":"publisher","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":"12_CR33","DOI":"10.1007\/978-3-319-18467-8_23"},{"key":"12_CR34","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"},{"doi-asserted-by":"crossref","unstructured":"J\u00fcrjens, J.: UMLsec: extending UML for secure systems development. In: UML 2002 \u2013 The Unified Modeling Language, vol. 2460, pp. 412\u2013425 (2002)","key":"12_CR35","DOI":"10.1007\/3-540-45800-X_32"},{"key":"12_CR36","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.ins.2016.01.010","volume":"342","author":"B Kordy","year":"2016","unstructured":"Kordy, B., Pouly, M., Schweitzer, P.: Probabilistic reasoning with graphical security models. Inf. Sci. 342, 111\u2013131 (2016)","journal-title":"Inf. Sci."},{"key":"12_CR37","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":"12_CR38","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":"12_CR39","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"},{"doi-asserted-by":"crossref","unstructured":"Kumar, R., Stoelinga, M.: Quantitative security and safety analysis with attack-fault trees. In: HASE, pp. 25\u201332 (2017)","key":"12_CR40","DOI":"10.1109\/HASE.2017.12"},{"key":"12_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-22110-1_47","volume-title":"Computer Aided Verification","author":"M Kwiatkowska","year":"2011","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585\u2013591. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_47"},{"key":"12_CR42","first-page":"4169","volume":"20","author":"M Lopuha\u00e4-Zwakenberg","year":"2022","unstructured":"Lopuha\u00e4-Zwakenberg, M., Budde, C.E., Stoelinga, M.: Efficient and generic algorithms for quantitative attack tree analysis. IEEE TDSC 20, 4169\u20134187 (2022)","journal-title":"IEEE TDSC"},{"unstructured":"Lopuha\u00e4-Zwakenberg, M., Stoelinga, M.: Attack time analysis in dynamic attack trees via integer linear programming. arXiv e-prints arXiv:2111.05114 (2021)","key":"12_CR43"},{"key":"12_CR44","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"},{"doi-asserted-by":"crossref","unstructured":"Moszkowski, B.: A temporal logic for multi-level reasoning about hardware. STANFORD UNIV CA, Technical report (1982)","key":"12_CR45","DOI":"10.21236\/ADA324174"},{"unstructured":"NASA: CubeSATs Overview. https:\/\/www.nasa.gov\/mission_pages\/cubesats\/overview. Accessed Mar 2023","key":"12_CR46"},{"doi-asserted-by":"crossref","unstructured":"Nicoletti, S., Hahn, E., Stoelinga, M.: BFL: a logic to reason about fault trees. In: DSN, pp. 441\u2013452 (2022)","key":"12_CR47","DOI":"10.1109\/DSN53405.2022.00051"},{"doi-asserted-by":"crossref","unstructured":"Nicoletti, S.M., Lopuha\u00e4-Zwakenberg, M., Hahn, E.M., Stoelinga, M.: Pfl: a probabilistic logic for fault trees. In: FM 2023, pp. 199\u2013221 (2023)","key":"12_CR48","DOI":"10.1007\/978-3-031-27481-7_13"},{"issue":"2","key":"12_CR49","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1093\/logcom\/exi077","volume":"16","author":"Z Ognjanovic","year":"2006","unstructured":"Ognjanovic, Z.: Discrete linear-time probabilistic logics: completeness, decidability and complexity. J. Log. Comput. 16(2), 257\u2013285 (2006)","journal-title":"J. Log. Comput."},{"doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: FOCS, pp. 46\u201357 (1977)","key":"12_CR50","DOI":"10.1109\/SFCS.1977.32"},{"unstructured":"Raskin, J.F.: Logics, automata and classical theories for deciding real time. Ph.D. thesis (1999)","key":"12_CR51"},{"issue":"3","key":"12_CR52","first-page":"203","volume":"40","author":"A Rauzy","year":"1993","unstructured":"Rauzy, A.: New algorithms for fault trees analysis. RESS 40(3), 203\u2013211 (1993)","journal-title":"RESS"},{"doi-asserted-by":"crossref","unstructured":"Roudier, Y., Apvrille, L.: SysML-Sec: a model driven approach for designing safe and secure systems. In: MODELSWARD, pp. 655\u2013664. IEEE (2015)","key":"12_CR53","DOI":"10.1109\/ACVI.2016.6"},{"issue":"12","key":"12_CR54","first-page":"21","volume":"24","author":"B Schneier","year":"1999","unstructured":"Schneier, B.: Attack trees. Dr. Dobb\u2019s J. 24(12), 21\u201329 (1999)","journal-title":"Dr. Dobb\u2019s J."},{"doi-asserted-by":"crossref","unstructured":"Thums, A., Schellhorn, G.: Model checking FTA. In: FME, vol. 2805, pp. 739\u2013757 (2003)","key":"12_CR55","DOI":"10.1007\/978-3-540-45236-2_40"},{"issue":"1","key":"12_CR56","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1109\/TII.2017.2710316","volume":"14","author":"M Volk","year":"2018","unstructured":"Volk, M., Junges, S., Katoen, J.: Fast dynamic fault tree analysis by model checking techniques. Trans. Ind. Inf. 14(1), 370\u2013379 (2018)","journal-title":"Trans. Ind. Inf."},{"unstructured":"Walker, M.D.: Pandora: a logic for the qualitative analysis of temporal fault trees. Ph.D. thesis, The University of Hull (2009)","key":"12_CR57"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T00:03:30Z","timestamp":1699056210000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47115-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031471148","9783031471155"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47115-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}