{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T08:52:34Z","timestamp":1770454354598,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030011406","type":"print"},{"value":"9783030011413","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-01141-3_6","type":"book-chapter","created":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T06:54:57Z","timestamp":1538376897000},"page":"85-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Semi-automatically Augmenting Attack Trees Using an Annotated Attack Tree Library"],"prefix":"10.1007","author":[{"given":"Ravi","family":"Jhawar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karim","family":"Lounis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sjouke","family":"Mauw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunior","family":"Ram\u00edrez-Cruz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,2]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-66402-6_7","volume-title":"Computer Security \u2013 ESORICS 2017","author":"M Audinot","year":"2017","unstructured":"Audinot, M., Pinchinat, S., Kordy, B.: Is my attack tree correct? In: Foley, S.N., Gollmann, D., Snekkenes, E. (eds.) ESORICS 2017 Part I. LNCS, vol. 10492, pp. 83\u2013102. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66402-6_7"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Chen, D., Mannin, C.: A fast and accurate dependency parser using neural networks. In: Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 740\u2013750 (2014)","DOI":"10.3115\/v1\/D14-1082"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"De Marneffe, M.C., Manning, C.D.: Stanford typed dependencies manual. Technical report, Stanford University (2008)","DOI":"10.3115\/1608858.1608859"},{"key":"6_CR4","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":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-319-29968-6_4","volume-title":"Graphical Models for Security","author":"O Gadyatskaya","year":"2016","unstructured":"Gadyatskaya, O.: How to generate security cameras: towards defence generation for socio-technical systems. In: Mauw, S., Kordy, B., Jajodia, S. (eds.) GraMSec 2015. LNCS, vol. 9390, pp. 50\u201365. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29968-6_4"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-68063-7_11","volume-title":"Security and Trust Management","author":"O Gadyatskaya","year":"2017","unstructured":"Gadyatskaya, O., Jhawar, R., Mauw, S., Trujillo-Rasua, R., Willemse, T.A.C.: Refinement-aware generation of attack trees. In: Livraga, G., Mitchell, C. (eds.) STM 2017. LNCS, vol. 10547, pp. 164\u2013179. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68063-7_11"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-319-74860-3_5","volume-title":"Graphical Models for Security","author":"RR Hansen","year":"2018","unstructured":"Hansen, R.R., Jensen, P.G., Larsen, K.G., Legay, A., Poulsen, D.B.: Quantitative evaluation of attack defense trees using stochastic timed automata. In: Liu, P., Mauw, S., St\u00f8len, K. (eds.) GraMSec 2017. LNCS, vol. 10744, pp. 75\u201390. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-74860-3_5"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Hong, J.B., Kim, D.S., Takaoka, T.: Scalable attack representation model using logic reduction techniques. In: Proceedings of TrustCom. IEEE (2013)","DOI":"10.1109\/TrustCom.2013.51"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-319-29968-6_6","volume-title":"Graphical Models for Security","author":"MG Ivanova","year":"2016","unstructured":"Ivanova, M.G., Probst, C.W., Hansen, R.R., Kamm\u00fcller, F.: Transforming graphical system models to graphical attack models. In: Mauw, S., Kordy, B., Jajodia, S. (eds.) GraMSec 2015. LNCS, vol. 9390, pp. 82\u201396. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29968-6_6"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-319-46598-2_10","volume-title":"Security and Trust Management","author":"R Jhawar","year":"2016","unstructured":"Jhawar, R., Lounis, K., Mauw, S.: A stochastic framework for quantitative analysis of attack-defense trees. In: Barthe, G., Markatos, E., Samarati, P. (eds.) STM 2016. LNCS, vol. 9871, pp. 138\u2013153. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46598-2_10"},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1093\/logcom\/exs029","volume":"24","author":"B Kordy","year":"2014","unstructured":"Kordy, B., Mauw, S., Radomirovi\u0107, S., Schweitzer, P.: Attack-defense trees. J. Log. Comput. 24(1), 55\u201387 (2014). Oxford University Press","journal-title":"J. Log. Comput."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.entcs.2018.03.038","volume":"337","author":"K Lounis","year":"2018","unstructured":"Lounis, K.: Stochastic-based semantics of attack-defense trees for security assessment. Electron. Notes Theor. Comput. Sci. 337, 135\u2013154 (2018)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Lu, W.P., Li, W.M.: Space based information system security risk evaluation based on improved attack trees. In: Proceedings of MINES 2011, pp. 480\u2013483 (2011)","DOI":"10.1109\/MINES.2011.94"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Manning, C.D., Surdeanu, M., Bauer, J., Finkel, J., Bethard, S.J., McClosky, D.: The stanford CoreNLP natural language processing toolkit. In: Association for Computational Linguistics (ACL) System Demonstrations, pp. 55\u201360 (2014)","DOI":"10.3115\/v1\/P14-5010"},{"key":"6_CR15","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":"6_CR16","doi-asserted-by":"crossref","unstructured":"Pi\u00e8tre-Cambac\u00e9d\u00e8s. L., Bouissou, M.: Beyond attack trees: dynamic security modeling with Boolean logic driven markov processes (BDMP). In: Proceedings of EDCC 2010, Los Alamitos, CA, USA, pp. 199\u2013208. IEEE Computer Society (2010)","DOI":"10.1109\/EDCC.2010.32"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-29968-6_7","volume-title":"Graphical Models for Security","author":"S Pinchinat","year":"2016","unstructured":"Pinchinat, S., Acher, M., Vojtisek, D.: ATSyRa: an integrated environment for synthesizing attack trees. In: Mauw, S., Kordy, B., Jajodia, S. (eds.) GraMSec 2015. LNCS, vol. 9390, pp. 97\u2013101. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29968-6_7"},{"issue":"8","key":"6_CR18","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1002\/sec.299","volume":"5","author":"A Roy","year":"2012","unstructured":"Roy, A., Kim, D.S., Trivedi, K.S.: Attack countermeasure trees (ACT): towards unifying the constructs of attack and defense trees. Secur. Commun. Netw. 5(8), 929\u2013943 (2012)","journal-title":"Secur. Commun. Netw."},{"issue":"12","key":"6_CR19","first-page":"21","volume":"24","author":"B Schneier","year":"1999","unstructured":"Schneier, B.: Attack trees: modeling security threats. Dr. Dobb\u2019s J. Softw. Tools 24(12), 21\u201329 (1999)","journal-title":"Dr. Dobb\u2019s J. Softw. Tools"},{"key":"6_CR20","volume-title":"Secrets and Lies: Digital Security in a Networked World","author":"B Schneier","year":"2011","unstructured":"Schneier, B.: Secrets and Lies: Digital Security in a Networked World. Wiley, Hoboken (2011)"},{"key":"6_CR21","unstructured":"Schuster, S., Manning, C.D.: Enhanced english universal dependencies: an improved representation for natural language understanding tasks. In: Proceedings of LREC 2016 (2016)"},{"key":"6_CR22","volume-title":"Threat modeling: Designing for security","author":"A Shostack","year":"2014","unstructured":"Shostack, A.: Threat modeling: Designing for security. Wiley, Hoboken (2014)"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Vigo, R., Nielsen, F., Nielson, H.R.: Automated generation of attack trees. In: Proceedings of CSF 2014, pp. 337\u2013350. IEEE (2014)","DOI":"10.1109\/CSF.2014.31"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-14423-3_9","volume-title":"Information, Security and Cryptology \u2013 ICISC 2009","author":"A J\u00fcrgenson","year":"2010","unstructured":"J\u00fcrgenson, A., Willemson, J.: Serial model for attack tree computations. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol. 5984, pp. 118\u2013128. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14423-3_9"}],"container-title":["Lecture Notes in Computer Science","Security and Trust Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01141-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T19:51:44Z","timestamp":1761076304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01141-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030011406","9783030011413"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01141-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"STM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Security and Trust Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"stm2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.nics.uma.es\/pub\/stm18\/","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"28","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"8","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"29% - 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"}},{"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"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}