{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:46:16Z","timestamp":1742913976498,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030154646"},{"type":"electronic","value":"9783030154653"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-15465-3_2","type":"book-chapter","created":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T04:02:37Z","timestamp":1553918557000},"page":"13-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Deciding the Non-emptiness of Attack Trees"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Audinot","sequence":"first","affiliation":[]},{"given":"Sophie","family":"Pinchinat","sequence":"additional","affiliation":[]},{"given":"Fran\u00e7ois","family":"Schwarzentruber","sequence":"additional","affiliation":[]},{"given":"Florence","family":"Wacheux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,31]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-662-54455-6_10","volume-title":"Principles of Security and Trust","author":"Z Aslanyan","year":"2017","unstructured":"Aslanyan, Z., Nielson, F.: Model checking exact cost for attack scenarios. In: Maffei, M., Ryan, M. (eds.) POST 2017. LNCS, vol. 10204, pp. 210\u2013231. Springer, Heidelberg (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-662-54455-6_10"},{"key":"2_CR2","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. LNCS, vol. 10492, pp. 83\u2013102. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-66402-6_7"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Audinot, M., Pinchinat, S., Kordy, B.: Guided design of attack trees: a system-based approach - to be published. In: 31th IEEE Computer Security Foundations Symposium, CSF 2018. IEEE (2018)","DOI":"10.1109\/CSF.2018.00012"},{"key":"2_CR4","unstructured":"Barrett, C.W., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Handbook of Satisfiability, pp. 825\u2013885. IOS Press, Amsterdam (2009)"},{"issue":"8","key":"2_CR5","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"issue":"1\u20132","key":"2_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","volume":"69","author":"T Bylander","year":"1994","unstructured":"Bylander, T.: The computational complexity of propositional STRIPS planning. Artif. Intell. 69(1\u20132), 165\u2013204 (1994)","journal-title":"Artif. Intell."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151\u2013158. ACM (1971)","DOI":"10.1145\/800157.805047"},{"issue":"1\u20132","key":"2_CR8","doi-asserted-by":"publisher","first-page":"57","DOI":"10.3233\/FI-2017-1531","volume":"153","author":"R Horne","year":"2017","unstructured":"Horne, R., Mauw, S., Tiu, A.: Semantics for specialising attack trees based on linear logic. Fundam. Inform. 153(1\u20132), 57\u201386 (2017)","journal-title":"Fundam. Inform."},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-319-24018-3_16","volume-title":"Information Security Theory and Practice","author":"MG Ivanova","year":"2015","unstructured":"Ivanova, M.G., Probst, C.W., Hansen, R.R., Kamm\u00fcller, F.: Attack tree generation by policy invalidation. In: Akram, R.N., Jajodia, S. (eds.) WISTP 2015. LNCS, vol. 9311, pp. 249\u2013259. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-24018-3_16"},{"key":"2_CR10","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). \n                    https:\/\/doi.org\/10.1007\/978-3-319-29968-6_6"},{"key":"2_CR11","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). \n                    https:\/\/doi.org\/10.1007\/978-3-319-18467-8_23"},{"key":"2_CR12","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). \n                    https:\/\/doi.org\/10.1007\/978-3-319-22975-1_11"},{"key":"2_CR13","unstructured":"Lindell, S.: A logspace algorithm for tree canonization (extended abstract). In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, 4\u20136 May 1992, pp. 400\u2013404 (1992)"},{"key":"2_CR14","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). \n                    https:\/\/doi.org\/10.1007\/11734727_17"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Nielson, H.R., Nielson, F., Vigo, R.: Discovering, quantifying, and displaying attacks. Log. Meth. Comput. Sci. 12 (2016)","DOI":"10.2168\/LMCS-12(4:5)2016"},{"key":"2_CR16","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"2007","unstructured":"Papadimitriou, C.H.: Computational Complexity. Academic Internet Publ., Ventura (2007)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-319-15201-1_24","volume-title":"Software Engineering and Formal Methods","author":"S Pinchinat","year":"2015","unstructured":"Pinchinat, S., Acher, M., Vojtisek, D.: Towards synthesis of attack trees for supporting computer-aided risk analysis. In: Canal, C., Idani, A. (eds.) SEFM 2014. LNCS, vol. 8938, pp. 363\u2013375. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-15201-1_24"},{"key":"2_CR18","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). \n                    https:\/\/doi.org\/10.1007\/978-3-319-29968-6_7"},{"issue":"2","key":"2_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"WJ Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4(2), 177\u2013192 (1970)","journal-title":"J. Comput. Syst. Sci."},{"issue":"12","key":"2_CR20","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":"2_CR21","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"1997","unstructured":"Sipser, M.: Introduction to the Theory of Computation. PWS Publishing Company, Boston (1997)"}],"container-title":["Lecture Notes in Computer Science","Graphical Models for Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-15465-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T08:35:42Z","timestamp":1558341342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-15465-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030154646","9783030154653"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-15465-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"31 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GraMSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graphical Models for Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"8 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gramsec2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.gramsec.uni.lu\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}