{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T15:17:28Z","timestamp":1773155848697,"version":"3.50.1"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030853143","type":"print"},{"value":"9783030853150","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85315-0_13","type":"book-chapter","created":{"date-parts":[[2021,8,19]],"date-time":"2021-08-19T12:05:42Z","timestamp":1629374742000},"page":"214-234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Assessing Security of Cryptocurrencies with Attack-Defense Trees: Proof of Concept and Future Directions"],"prefix":"10.1007","author":[{"given":"Julia","family":"Eisentraut","sequence":"first","affiliation":[]},{"given":"Stephan","family":"Holzer","sequence":"additional","affiliation":[]},{"given":"Katharina","family":"Klioba","sequence":"additional","affiliation":[]},{"given":"Jan","family":"K\u0159et\u00ednsk\u00fd","sequence":"additional","affiliation":[]},{"given":"Lukas","family":"Pin","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,20]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Andr\u00e9, \u00c9., Lime, D., Ramparison, M., Stoelinga, M.: Parametric analyses of attack-fault trees. In: 2019 19th International Conference on Application of Concurrency to System Design (ACSD), pp. 33\u201342. IEEE (2019)","DOI":"10.1109\/ACSD.2019.00008"},{"key":"13_CR2","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":"13_CR3","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). https:\/\/doi.org\/10.1007\/978-3-662-54455-6_10"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Aslanyan, Z., Nielson, F., Parker, D.: Quantitative verification and synthesis of attack-defence scenarios. In: CSF, pp. 105\u2013119 (2016). https:\/\/doi.org\/10.1109\/CSF.2016.15","DOI":"10.1109\/CSF.2016.15"},{"issue":"3","key":"13_CR5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0951-8320(00)00077-6","volume":"71","author":"A Bobbio","year":"2001","unstructured":"Bobbio, A., Portinale, L., Minichino, M., Ciancamerla, E.: Improving the analysis of dependable systems by mapping fault trees into Bayesian networks. Reliab. Eng. Syst. Saf. 71(3), 249\u2013260 (2001)","journal-title":"Reliab. Eng. Syst. Saf."},{"key":"13_CR6","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"},{"key":"13_CR7","unstructured":"Buoni, A., Fedrizzi, M., Mezei, J.: A Delphi-based approach to fraud detection using attack trees and fuzzy numbers. In: Proceeding of the IASK International Conferences, pp. 21\u201328 (2010)"},{"key":"13_CR8","unstructured":"Chatterjee, K., Goharshady, A.K., Ibsen-Jensen, R., Velner, Y.: Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. arXiv preprint arXiv:1806.03108 (2018)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/978-3-319-89884-1_26","volume-title":"Programming Languages and Systems","author":"K Chatterjee","year":"2018","unstructured":"Chatterjee, K., Goharshady, A.K., Velner, Y.: Quantitative analysis of smart contracts. In: Ahmed, A. (ed.) ESOP 2018. LNCS, vol. 10801, pp. 739\u2013767. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_26"},{"issue":"4","key":"13_CR10","doi-asserted-by":"publisher","first-page":"3416","DOI":"10.1109\/COMST.2018.2842460","volume":"20","author":"M Conti","year":"2018","unstructured":"Conti, M., Kumar, E.S., Lal, C., Ruj, S.: A survey on security and privacy issues of bitcoin. Commun. Surv. Tutor. 20(4), 3416\u20133452 (2018)","journal-title":"Commun. Surv. Tutor."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Danielsson, J.: Cryptocurrencies: policy, economics and fairness. Systemic Risk Centre Discussion Paper 86 (2018)","DOI":"10.2139\/ssrn.3276606"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Edge, K.S., Raines, R.A., Grimaila, M.R., Baldwin, R.O., Bennington, R.W., Reuter, C.E.: The use of attack and protection trees to analyze security for an online banking system. In: Systems Science (HICSS), p. 144 (2007). https:\/\/doi.org\/10.1109\/HICSS.2007.558","DOI":"10.1109\/HICSS.2007.558"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-030-30281-8_12","volume-title":"Quantitative Evaluation of Systems","author":"J Eisentraut","year":"2019","unstructured":"Eisentraut, J., K\u0159et\u00ednsk\u00fd, J.: Expected cost analysis of attack-defense trees. In: Parker, D., Wolf, V. (eds.) QEST 2019. LNCS, vol. 11785, pp. 203\u2013221. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30281-8_12"},{"key":"13_CR14","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":"13_CR15","doi-asserted-by":"publisher","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. http:\/\/dx.doi.org\/10.1007\/978-3-319-43425-4_10","DOI":"10.1007\/978-3-319-43425-4_10"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-74860-3_9","volume-title":"Graphical Models for Security","author":"O Gadyatskaya","year":"2018","unstructured":"Gadyatskaya, O., Trujillo-Rasua, R.: New directions in attack tree research: catching up with industrial needs. In: Liu, P., Mauw, S., St\u00f8len, K. (eds.) GraMSec 2017. LNCS, vol. 10744, pp. 115\u2013126. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-74860-3_9"},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1186\/s41044-016-0006-0","volume":"1","author":"IA Gheyas","year":"2016","unstructured":"Gheyas, I.A., Abdallah, A.E.: Detection and prediction of insider threats to cyber security: a systematic literature review and meta-analysis. Big Data Anal. 1(1), 6 (2016). https:\/\/doi.org\/10.1186\/s41044-016-0006-0","journal-title":"Big Data Anal."},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-319-96145-3_4","volume-title":"Computer Aided Verification","author":"I Grishchenko","year":"2018","unstructured":"Grishchenko, I., Maffei, M., Schneidewind, C.: Foundations and tools for the static analysis of ethereum smart contracts. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 51\u201378. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_4"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Gulhane, A., et al.: Security, privacy and safety risk assessment for virtual reality learning environment applications. In: Consumer Communications Networking Conference (CCNC), pp. 1\u20139, January 2019. https:\/\/doi.org\/10.1109\/CCNC.2019.8651847","DOI":"10.1109\/CCNC.2019.8651847"},{"key":"13_CR20","doi-asserted-by":"publisher","DOI":"10.1515\/9780691218632","volume-title":"Time Series Analysis","author":"JD Hamilton","year":"1994","unstructured":"Hamilton, J.D.: Time Series Analysis, vol. 2. Princeton University Press, Princeton (1994)"},{"key":"13_CR21","unstructured":"Heilman, E., Kendler, A., Zohar, A., Goldberg, S.: Eclipse attacks on bitcoin\u2019s peer-to-peer network. In: 24th USENIX Security Symposium (USENIX Security 15), pp. 129\u2013144 (2015)"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Hermanns, H., Kr\u00e4mer, J., Kr\u010d\u00e1l, J., Stoelinga, M.: The value of attack-defence diagrams. In: Piessens, F., Vigan\u00f2, L. (eds.) POST 2016. LNCS, vol. 9635, pp. 163\u2013185. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49635-0_9. http:\/\/dx.doi.org\/10.1007\/978-3-662-49635-0_9","DOI":"10.1007\/978-3-662-49635-0_9"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cosrev.2017.09.001","volume":"26","author":"JB Hong","year":"2017","unstructured":"Hong, J.B., Kim, D.S., Chung, C.J., Huang, D.: A survey on the usability and practical applications of graphical security models. Comput. Sci. Rev. 26, 1\u201316 (2017)","journal-title":"Comput. Sci. Rev."},{"key":"13_CR24","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"},{"issue":"2","key":"13_CR25","doi-asserted-by":"publisher","first-page":"121","DOI":"10.3934\/mfc.2018007","volume":"1","author":"AP Joshi","year":"2018","unstructured":"Joshi, A.P., Han, M., Wang, Y.: A survey on security and privacy issues of blockchain technology. Math. Found. Comput. 1(2), 121\u2013147 (2018)","journal-title":"Math. Found. Comput."},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-319-98935-8_9","volume-title":"Cyber-Physical Systems Security","author":"K Karray","year":"2018","unstructured":"Karray, K., Danger, J.-L., Guilley, S., Abdelaziz Elaabid, M.: Attack tree construction and its application to the connected vehicle. In: Ko\u00e7, \u00c7.K. (ed.) Cyber-Physical Systems Security, pp. 175\u2013190. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98935-8_9"},{"key":"13_CR27","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. 6561, pp. 80\u201395. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19751-2_6http:\/\/dl.acm.org\/citation.cfm?id=1964555.1964561"},{"key":"13_CR28","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. CoRR abs\/1303.7397 (2013). http:\/\/arxiv.org\/abs\/1303.7397"},{"key":"13_CR29","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":"13_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-662-54970-4_33","volume-title":"Financial Cryptography and Data Security","author":"K Krombholz","year":"2017","unstructured":"Krombholz, K., Judmayer, A., Gusenbauer, M., Weippl, E.: The other side of the coin: user experiences with bitcoin security and privacy. In: Grossklags, J., Preneel, B. (eds.) FC 2016. LNCS, vol. 9603, pp. 555\u2013580. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54970-4_33"},{"key":"13_CR31","doi-asserted-by":"publisher","unstructured":"Kumar, R., Stoelinga, M.: Quantitative security and safety analysis with attack-fault trees. In: HASE, pp. 25\u201332 (2017). https:\/\/doi.org\/10.1109\/HASE.2017.12","DOI":"10.1109\/HASE.2017.12"},{"issue":"5","key":"13_CR32","first-page":"653","volume":"19","author":"IC Lin","year":"2017","unstructured":"Lin, I.C., Liao, T.C.: A survey of blockchain security issues and challenges. IJ Netw. Secur. 19(5), 653\u2013659 (2017)","journal-title":"IJ Netw. Secur."},{"key":"13_CR33","doi-asserted-by":"publisher","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. http:\/\/dx.doi.org\/10.1007\/11734727_17","DOI":"10.1007\/11734727_17"},{"key":"13_CR34","doi-asserted-by":"publisher","unstructured":"McQueen, M.A., Boyer, W.F., Flynn, M.A., Beitel, G.A.: Quantitative cyber risk reduction estimation methodology for a small SCADA control system. In: Conference on System Sciences (HICSS), HICSS 2006, Washington, DC, USA, p. 226. IEEE Computer Society (2006). https:\/\/doi.org\/10.1109\/HICSS.2006.405. http:\/\/dx.doi.org\/10.1109\/HICSS.2006.405","DOI":"10.1109\/HICSS.2006.405"},{"key":"13_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-030-03421-4_25","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Verification","author":"BL Mediouni","year":"2018","unstructured":"Mediouni, B.L., Nouri, A., Bozga, M., Legay, A., Bensalem, S.: Mitigating security risks through attack strategies exploration. In: Margaria, T., Steffen, B. (eds.) ISoLA 2018. LNCS, vol. 11245, pp. 392\u2013413. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03421-4_25"},{"issue":"3","key":"13_CR36","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1504\/IJEB.2011.042541","volume":"9","author":"AB Mezei","year":"2011","unstructured":"Mezei, A.B., Mario Fedrizzi, J.: Combining attack trees and fuzzy numbers in a multi-agent approach to fraud detection. Int. J. Electron. Bus. 9(3), 186\u2013202 (2011)","journal-title":"Int. J. Electron. Bus."},{"key":"13_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-319-46263-9_8","volume-title":"Graphical Models for Security","author":"N Pekergin","year":"2016","unstructured":"Pekergin, N., Tan, S., Fourneau, J.-M.: Quantitative attack tree analysis: stochastic bounds and numerical analysis. In: Kordy, B., Ekstedt, M., Kim, D.S. (eds.) GraMSec 2016. LNCS, vol. 9987, pp. 119\u2013133. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46263-9_8"},{"key":"13_CR38","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":"13_CR39","doi-asserted-by":"publisher","unstructured":"Salter, C., Saydjari, O.S., Schneier, B., Wallner, J.: Toward a secure system engineering methodology. In: New Security Paradigms (NSPW), New York, NY, USA, pp. 2\u201310. ACM (1998). https:\/\/doi.org\/10.1145\/310889.310900. http:\/\/doi.acm.org\/10.1145\/310889.310900","DOI":"10.1145\/310889.310900"},{"key":"13_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-662-54970-4_30","volume-title":"Financial Cryptography and Data Security","author":"A Sapirshtein","year":"2017","unstructured":"Sapirshtein, A., Sompolinsky, Y., Zohar, A.: Optimal selfish mining strategies in bitcoin. In: Grossklags, J., Preneel, B. (eds.) FC 2016. LNCS, vol. 9603, pp. 515\u2013532. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54970-4_30"},{"issue":"2","key":"13_CR41","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303\u2013332 (1999)","journal-title":"SIAM Rev."},{"key":"13_CR42","unstructured":"Sompolinsky, Y., Zohar, A.: Bitcoin\u2019s security model revisited. arXiv preprint arXiv:1605.09193 (2016)"},{"key":"13_CR43","doi-asserted-by":"publisher","unstructured":"Wide\u0142, W., Audinot, M., Fila, B., Pinchinat, S.: Beyond 2014: formal methods for attack tree-based security modeling. ACM Comput. Surv. 2(4), 75:1\u201375:36 (2019). https:\/\/doi.org\/10.1145\/3331524. http:\/\/doi.acm.org\/10.1145\/3331524","DOI":"10.1145\/3331524"},{"key":"13_CR44","doi-asserted-by":"publisher","unstructured":"Zalka, C.: Grover\u2019s quantum searching algorithm is optimal. Phys. Rev. A 60, 2746\u20132751 (1999). https:\/\/doi.org\/10.1103\/PhysRevA.60.2746. https:\/\/link.aps.org\/doi\/10.1103\/PhysRevA.60.2746","DOI":"10.1103\/PhysRevA.60.2746"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85315-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T00:02:48Z","timestamp":1630022568000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85315-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030853143","9783030853150"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85315-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2021.github.io\/","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":"55","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":"20","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":"36% - 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":"3","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)"}}]}}