{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:49:25Z","timestamp":1743036565353,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642252600"},{"type":"electronic","value":"9783642252617"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-25261-7_8","type":"book-chapter","created":{"date-parts":[[2012,2,7]],"date-time":"2012-02-07T22:38:49Z","timestamp":1328654329000},"page":"103-116","source":"Crossref","is-referenced-by-count":14,"title":["Computational Aspects of Attack\u2013Defense Trees"],"prefix":"10.1007","author":[{"given":"Barbara","family":"Kordy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Pouly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Schweitzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"12","key":"8_CR1","first-page":"21","volume":"24","author":"B. Schneier","year":"1999","unstructured":"Schneier, B.: Attack Trees. Dr. Dobb\u2019s Journal of Software Tools\u00a024(12), 21\u201329 (1999)","journal-title":"Dr. Dobb\u2019s Journal of Software Tools"},{"key":"8_CR2","unstructured":"Weiss, J.D.: A system security engineering process. In: 14th Nat. Comp. Sec. Conf., pp. 572\u2013581 (1991)"},{"key":"8_CR3","volume-title":"Fundamentals of Computer Security Technology","author":"E.G. Amoroso","year":"1994","unstructured":"Amoroso, E.G.: Fundamentals of Computer Security Technology. Prentice-Hall, Inc., Upper Saddle River (1994)"},{"key":"8_CR4","unstructured":"Vesely, W.E., Goldberg, F.F., Roberts, N., Haasl, D.: Fault Tree Handbook. Technical Report NUREG-0492, U.S. Regulatory Commission (1981)"},{"key":"8_CR5","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.\u00a03935, pp. 186\u2013198. Springer, Heidelberg (2006)"},{"key":"8_CR6","first-page":"216","volume":"4","author":"I. Cervesato","year":"2007","unstructured":"Cervesato, I., Meadows, C.: One Picture Is Worth a Dozen Connectives: A Fault-Tree Representation of NPATRL Security Requirements. IEEE TDSC\u00a04, 216\u2013227 (2007)","journal-title":"IEEE TDSC"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Edge, K.S., Dalton II, G.C., Raines, R.A., Mills, R.F.: Using Attack and Protection Trees to Analyze Threats and Defenses to Homeland Security. In: MILCOM, IEEE, pp. 1\u20137 (2006)","DOI":"10.1109\/MILCOM.2006.302512"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Morais, A.N.P., Martins, E., Cavalli, A.R., Jimenez, W.: Security Protocol Testing Using Attack Trees. In: CSE (2), pp. 690\u2013697. IEEE Computer Society (2009)","DOI":"10.1109\/CSE.2009.206"},{"key":"8_CR9","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.\u00a05984, pp. 118\u2013128. Springer, Heidelberg (2010)"},{"issue":"2","key":"8_CR10","first-page":"121","volume":"197","author":"S. Bistarelli","year":"2008","unstructured":"Bistarelli, S., Peretti, P., Trubitsyna, I.: Analyzing Security Scenarios Using Defence Trees and Answer Set Programming. ENTCS\u00a0197(2), 121\u2013129 (2008)","journal-title":"ENTCS"},{"issue":"20","key":"8_CR11","doi-asserted-by":"publisher","first-page":"2933","DOI":"10.1016\/j.ins.2005.08.004","volume":"176","author":"R.R. Yager","year":"2006","unstructured":"Yager, R.R.: OWA trees and their role in security modeling using attack trees. Inf. Sci.\u00a0176(20), 2933\u20132959 (2006)","journal-title":"Inf. Sci."},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-19751-2_6","volume-title":"Formal Aspects of Security and Trust","author":"B. Kordy","year":"2011","unstructured":"Kordy, B., Mauw, S., Radomirovi\u0107, S., Schweitzer, P.: Foundations of Attack\u2013Defense Trees. In: Degano, P., Etalle, S., Guttman, J. (eds.) FAST 2010. LNCS, vol.\u00a06561, pp. 80\u201395. Springer, Heidelberg (2011)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-642-17197-0_17","volume-title":"Decision and Game Theory for Security","author":"B. Kordy","year":"2010","unstructured":"Kordy, B., Mauw, S., Melissen, M., Schweitzer, P.: Attack\u2013Defense Trees and Two-Player Binary Zero-Sum Extensive Form Games Are Equivalent. In: Alpcan, T., Butty\u00e1n, L., Baras, J.S. (eds.) GameSec 2010. LNCS, vol.\u00a06442, pp. 245\u2013256. Springer, Heidelberg (2010)"},{"key":"8_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0009-6","volume-title":"Information Algebras: Generic Structures for Inference","author":"J. Kohlas","year":"2003","unstructured":"Kohlas, J.: Information Algebras: Generic Structures for Inference. Springer, Heidelberg (2003)"},{"key":"8_CR15","unstructured":"Davey, B., Priestley, H.: Introduction to Lattices and Order. Cambridge University Press (1990)"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Pouly, M., Kohlas, J.: Generic Inference: A Unifying Theory for Automated Reasoning. John Wiley & Sons, Inc. (2011)","DOI":"10.1002\/9781118010877"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Crama, Y., Hammer, P.: Boolean Functions: Theory, Algorithms and Applications. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511852008"},{"key":"8_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-540-72665-4_40","volume-title":"Advances in Artificial Intelligence","author":"M. Wachter","year":"2007","unstructured":"Wachter, M., Haenni, R.: Multi-state Directed Acyclic Graphs. In: Kobti, Z., Wu, D. (eds.) Canadian AI 2007. LNCS (LNAI), vol.\u00a04509, pp. 464\u2013475. Springer, Heidelberg (2007)"},{"key":"8_CR19","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"A. Darwiche","year":"2002","unstructured":"Darwiche, A., Marquis, P.: A Knowledge Compilation Map. J. Artif. Intell. Res.\u00a017, 229\u2013264 (2002)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Lecture Notes in Computer Science","Security and Intelligent Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25261-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T11:32:17Z","timestamp":1686742337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25261-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642252600","9783642252617"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25261-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}