{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T23:07:29Z","timestamp":1765667249947},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030190514"},{"type":"electronic","value":"9783030190521"}],"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-19052-1_4","type":"book-chapter","created":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T21:11:42Z","timestamp":1558559502000},"page":"15-38","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Canonical Narrowing with Irreducibility Constraints as a Symbolic Protocol Analysis Method"],"prefix":"10.1007","author":[{"given":"Santiago","family":"Escobar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Meseguer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"key":"4_CR1","unstructured":"30th IEEE Computer Security Foundations Symposium, CSF 2017, Santa Barbara, CA, USA, 21\u201325 August 2017. IEEE Computer Society (2017)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11513988_27","volume-title":"Computer Aided Verification","author":"A Armando","year":"2005","unstructured":"Armando, A., et al.: The AVISPA tool for the automated validation of internet security protocols and applications. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 281\u2013285. Springer, Heidelberg (2005). \n                    https:\/\/doi.org\/10.1007\/11513988_27"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Steiner, M., Tsudik, G.: Authenticated group key agreement and friends. In: ACM Conference on Computer and Communications Security, pp. 17\u201326 (1998)","DOI":"10.1145\/288090.288097"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/978-3-319-10575-8_22","volume-title":"Handbook of Model Checking","author":"D Basin","year":"2018","unstructured":"Basin, D., Cremers, C., Meadows, C.: Model checking security protocols. Handbook of Model Checking, pp. 727\u2013762. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-10575-8_22"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Basin, D.A., Dreier, J., Hirschi, L., Radomirovic, S., Sasse, R., Stettler, V.: A formal analysis of 5G authentication. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, 15\u201319 October 2018, pp. 1383\u20131396. ACM (2018)","DOI":"10.1145\/3243734.3243846"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-319-10082-1_3","volume-title":"Foundations of Security Analysis and Design VII","author":"B Blanchet","year":"2014","unstructured":"Blanchet, B.: Automatic verification of security protocols in the symbolic model: the verifier ProVerif. In: Aldini, A., Lopez, J., Martinelli, F. (eds.) FOSAD 2012\u20132013. LNCS, vol. 8604, pp. 54\u201387. Springer, Cham (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-10082-1_3"},{"key":"4_CR7","unstructured":"Bull, J.: The authentication protocol. APM Report (1997)"},{"key":"4_CR8","series-title":"LNCS","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71999-1","volume-title":"All About Maude - A High-Performance Logical Framework","author":"M Clavel","year":"2007","unstructured":"Clavel, M., et al.: All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007). \n                    https:\/\/doi.org\/10.1007\/978-3-540-71999-1"},{"key":"4_CR9","unstructured":"Clavel, M., et al.: Maude Manual (Version 2.7.1). SRI International - University of Illinois at Urbana-Champaign, July 2016"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-32033-3_22","volume-title":"Term Rewriting and Applications","author":"H Comon-Lundh","year":"2005","unstructured":"Comon-Lundh, H., Delaune, S.: The finite variant property: how to get rid of some algebraic properties. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 294\u2013307. Springer, Heidelberg (2005). \n                    https:\/\/doi.org\/10.1007\/978-3-540-32033-3_22"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-540-70545-1_38","volume-title":"Computer Aided Verification","author":"CJF Cremers","year":"2008","unstructured":"Cremers, C.J.F.: The scyther tool: verification, falsification, and analysis of security protocols. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 414\u2013418. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-70545-1_38"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.jlamp.2016.10.005","volume":"87","author":"S Delaune","year":"2017","unstructured":"Delaune, S., Hirschi, L.: A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols. J. Log. Algebr. Meth. Program. 87, 127\u2013144 (2017)","journal-title":"J. Log. Algebr. Meth. Program."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Dreier, J., Hirschi, L., Radomirovic, S., Sasse, R.: Automated unbounded verification of stateful cryptographic protocols with exclusive OR. In: 31st IEEE Computer Security Foundations Symposium, CSF 2018, Oxford, United Kingdom, 9\u201312 July 2018, pp. 359\u2013373. IEEE Computer Society (2018)","DOI":"10.1109\/CSF.2018.00033"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-319-40229-1_13","volume-title":"Automated Reasoning","author":"F Dur\u00e1n","year":"2016","unstructured":"Dur\u00e1n, F., Eker, S., Escobar, S., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.: Built-in variant generation and unification, and their applications in Maude 2.7. In: Olivetti, N., Tiwari, A. (eds.) IJCAR 2016. LNCS (LNAI), vol. 9706, pp. 183\u2013192. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-40229-1_13"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Dur\u00e1n, F., Eker, S., Escobar, S., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.L.: Associative unification and symbolic reasoning modulo associativity in Maude. In: Rusu [39], pp. 98\u2013114 (2018)","DOI":"10.1007\/978-3-319-99840-4_6"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-33167-1_5","volume-title":"Computer Security \u2013 ESORICS 2012","author":"S Erbatur","year":"2012","unstructured":"Erbatur, S., et al.: Effective symbolic protocol analysis via equational irreducibility conditions. In: Foresti, S., Yung, M., Martinelli, F. (eds.) ESORICS 2012. LNCS, vol. 7459, pp. 73\u201390. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-33167-1_5"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-38574-2_16","volume-title":"Automated Deduction \u2013 CADE-24","author":"S Erbatur","year":"2013","unstructured":"Erbatur, S., et al.: Asymmetric unification: a new unification paradigm for cryptographic protocol analysis. In: Bonacina, M.P. (ed.) CADE 2013. LNCS (LNAI), vol. 7898, pp. 231\u2013248. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-38574-2_16"},{"key":"4_CR18","unstructured":"Escobar, S., Meadows, C., Meseguer, J.: Maude-NPA (Version 3.1.1), April 2018. \n                    http:\/\/maude.cs.uiuc.edu\/tools\/Maude-NPA"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-642-15497-3_19","volume-title":"Computer Security \u2013 ESORICS 2010","author":"S Escobar","year":"2010","unstructured":"Escobar, S., Meadows, C., Meseguer, J., Santiago, S.: Sequential protocol composition in Maude-NPA. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol. 6345, pp. 303\u2013318. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-15497-3_19"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Escobar, S., Meadows, C., Meseguer, J., Santiago, S.: A rewriting-based forwards semantics for Maude-NPA. In: Proceedings of the 2014 Symposium and Bootcamp on the Science of Security, HotSoS 2014. ACM (2014)","DOI":"10.1145\/2600176.2600186"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.ic.2014.07.007","volume":"238","author":"S Escobar","year":"2014","unstructured":"Escobar, S., Meadows, C., Meseguer, J., Santiago, S.: State space reduction in the Maude-NRL protocol analyzer. Inf. Comput. 238, 157\u2013186 (2014)","journal-title":"Inf. Comput."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Escobar, S., Meadows, C., Meseguer, J., Santiago, S.: Symbolic protocol analysis with disequality constraints modulo equational theories. In: Programming Languages with Applications to Biology and Security, pp. 238\u2013261 (2015)","DOI":"10.1007\/978-3-319-25527-9_16"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1016\/j.jlap.2012.01.002","volume":"81","author":"S Escobar","year":"2012","unstructured":"Escobar, S., Sasse, R., Meseguer, J.: Folding variant narrowing and optimal variant termination. J. Algebraic Log. Program. 81, 898\u2013928 (2012)","journal-title":"J. Algebraic Log. Program."},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"191","DOI":"10.3233\/JCS-1999-72-304","volume":"7","author":"FJT Fabrega","year":"1999","unstructured":"Fabrega, F.J.T., Herzog, J., Guttman, J.: Strand spaces: what makes a security protocol correct? J. Comput. Secur. 7, 191\u2013230 (1999)","journal-title":"J. Comput. Secur."},{"key":"4_CR25","unstructured":"Gonz\u00e1lez-Burgue\u00f1o, A., Aparicio-S\u00e1nchez, D., Escobar, S., Meadows, C.A., Meseguer, J., Formal verification of the YubiKey and YubiHSM APIs in Maude-NPA. In: Barthe, G., Sutcliffe, G., Veanes, M. (eds.) LPAR-22, 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 16\u201321 November 2018, EPiC Series in Computing, vol. 57, pp. 400\u2013417. EasyChair (2018)"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-14054-4_8","volume-title":"Security Standardisation Research","author":"A Gonz\u00e1lez-Burgue\u00f1o","year":"2014","unstructured":"Gonz\u00e1lez-Burgue\u00f1o, A., Santiago, S., Escobar, S., Meadows, C., Meseguer, J.: Analysis of the IBM CCA security API protocols in Maude-NPA. In: Chen, L., Mitchell, C. (eds.) SSR 2014. LNCS, vol. 8893, pp. 111\u2013130. Springer, Cham (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-14054-4_8"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-319-27152-1_5","volume-title":"Security Standardisation Research","author":"A Gonz\u00e1lez-Burgue\u00f1o","year":"2015","unstructured":"Gonz\u00e1lez-Burgue\u00f1o, A., Santiago, S., Escobar, S., Meadows, C., Meseguer, J.: Analysis of the PKCS#11 API using the Maude-NPA tool. In: Chen, L., Matsuo, S. (eds.) SSR 2015. LNCS, vol. 9497, pp. 86\u2013106. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-27152-1_5"},{"issue":"4","key":"4_CR28","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/0215084","volume":"15","author":"J-P Jouannaud","year":"1986","unstructured":"Jouannaud, J.-P., Kirchner, H.: Completion of a set of rules modulo a set of equations. SIAM J. Comput. 15(4), 1155\u20131194 (1986)","journal-title":"SIAM J. Comput."},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-61042-1_43","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Lowe","year":"1996","unstructured":"Lowe, G.: Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 147\u2013166. Springer, Heidelberg (1996). \n                    https:\/\/doi.org\/10.1007\/3-540-61042-1_43"},{"issue":"2","key":"4_CR30","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0743-1066(95)00095-X","volume":"26","author":"C Meadows","year":"1996","unstructured":"Meadows, C.: The NRL protocol analyzer: an overview. J. Log. Program. 26(2), 113\u2013131 (1996)","journal-title":"J. Log. Program."},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/978-3-642-39799-8_48","volume-title":"Computer Aided Verification","author":"S Meier","year":"2013","unstructured":"Meier, S., Schmidt, B., Cremers, C., Basin, D.: The TAMARIN prover for the symbolic analysis of security protocols. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 696\u2013701. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-39799-8_48"},{"issue":"1","key":"4_CR32","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a united model of concurrency. Theor. Comput. Sci. 96(1), 73\u2013155 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-64299-4_26","volume-title":"Recent Trends in Algebraic Development Techniques","author":"J Meseguer","year":"1998","unstructured":"Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Presicce, F.P. (ed.) WADT 1997. LNCS, vol. 1376, pp. 18\u201361. Springer, Heidelberg (1998). \n                    https:\/\/doi.org\/10.1007\/3-540-64299-4_26"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Meseguer, J.: Generalized rewrite theories and coherence completion. In: Rusu [39], pp. 164\u2013183 (2018)","DOI":"10.1007\/978-3-319-99840-4_10"},{"key":"4_CR35","unstructured":"Meseguer, J.: Generalized rewrite theories, coherence completion and symbolic methods. Technical report, Computer Science Department, University of Illinois, December 2018"},{"key":"4_CR36","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.scico.2017.09.001","volume":"154","author":"J Meseguer","year":"2018","unstructured":"Meseguer, J.: Variant-based satisfiability in initial algebras. Sci. Comput. Program. 154, 3\u201341 (2018)","journal-title":"Sci. Comput. Program."},{"issue":"1\u20132","key":"4_CR37","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10990-007-9000-6","volume":"20","author":"J Meseguer","year":"2007","unstructured":"Meseguer, J., Thati, P.: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. High.-Order Symb. Comput. 20(1\u20132), 123\u2013160 (2007)","journal-title":"High.-Order Symb. Comput."},{"issue":"2","key":"4_CR38","doi-asserted-by":"publisher","first-page":"197","DOI":"10.3233\/JCS-2006-14204","volume":"14","author":"O Pereira","year":"2006","unstructured":"Pereira, O., Quisquater, J.-J.: On the impossibility of building secure cliques-type authenticated group key agreement protocols. J. Comput. Secur. 14(2), 197\u2013246 (2006)","journal-title":"J. Comput. Secur."},{"key":"4_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99840-4","volume-title":"Rewriting Logic and Its Applications","year":"2018","unstructured":"Rusu, V. (ed.): WRLA 2018. LNCS, vol. 11152. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-99840-4"},{"issue":"1","key":"4_CR40","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(97)00180-4","volume":"65","author":"PYA Ryan","year":"1998","unstructured":"Ryan, P.Y.A., Schneider, S.A.: An attack on a recursive authentication protocol. A cautionary tale. Inf. Process. Lett. 65(1), 7\u201310 (1998)","journal-title":"Inf. Process. Lett."},{"key":"4_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-319-11851-2_11","volume-title":"Security and Trust Management","author":"S Santiago","year":"2014","unstructured":"Santiago, S., Escobar, S., Meadows, C., Meseguer, J.: A formal definition of protocol indistinguishability and its verification using Maude-NPA. In: Mauw, S., Jensen, C.D. (eds.) STM 2014. LNCS, vol. 8743, pp. 162\u2013177. Springer, Cham (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-11851-2_11"},{"key":"4_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-22444-7_11","volume-title":"Security and Trust Management","author":"R Sasse","year":"2011","unstructured":"Sasse, R., Escobar, S., Meadows, C., Meseguer, J.: Protocol analysis modulo combination of theories: a case study in Maude-NPA. In: Cuellar, J., Lopez, J., Barthe, G., Pretschner, A. (eds.) STM 2010. LNCS, vol. 6710, pp. 163\u2013178. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-22444-7_11"},{"key":"4_CR43","unstructured":"TeReSe (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"},{"issue":"2","key":"4_CR44","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/S0304-3975(01)00366-8","volume":"285","author":"P Viry","year":"2002","unstructured":"Viry, P.: Equational rules for rewriting logic. Theor. Comput. Sci. 285(2), 487\u2013517 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR45","doi-asserted-by":"crossref","unstructured":"Yang, F., Escobar, S., Meadows, C., Meseguer, J., Narendran, P.: Theories of homomorphic encryption, unification, and the finite variant property. In: Proceedings of PPDP 2014, pp. 123\u2013134. ACM (2014)","DOI":"10.1145\/2643135.2643154"},{"key":"4_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-030-01141-3_2","volume-title":"Security and Trust Management","author":"F Yang","year":"2018","unstructured":"Yang, F., Escobar, S., Meadows, C., Meseguer, J.: Modular verification of sequential composition for private channels in Maude-NPA. In: Katsikas, S.K., Alcaraz, C. (eds.) STM 2018. LNCS, vol. 11091, pp. 20\u201336. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-030-01141-3_2"},{"key":"4_CR47","doi-asserted-by":"crossref","unstructured":"Yang, F., Escobar, S., Meadows, C.A., Meseguer, J., Santiago, S.: Strand spaces with choice via a process algebra semantics. In: Cheney, J., Vidal, G. (eds.) Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, Edinburgh, United Kingdom, 5\u20137 September 2016, pp. 76\u201389. ACM (2016)","DOI":"10.1145\/2967973.2968609"}],"container-title":["Lecture Notes in Computer Science","Foundations of Security, Protocols, and Equational Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19052-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T21:13:00Z","timestamp":1558559580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19052-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030190514","9783030190521"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19052-1_4","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":"28 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}