{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:19:18Z","timestamp":1725740358107},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392733"},{"type":"electronic","value":"9783642392740"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39274-0_11","type":"book-chapter","created":{"date-parts":[[2013,7,10]],"date-time":"2013-07-10T21:07:42Z","timestamp":1373490462000},"page":"109-121","source":"Crossref","is-referenced-by-count":1,"title":["Towards Nominal Context-Free Model-Checking"],"prefix":"10.1007","author":[{"given":"Pierpaolo","family":"Degano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gian-Luigi","family":"Ferrari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluca","family":"Mezzetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"11_CR1","doi-asserted-by":"crossref","first-page":"799","DOI":"10.3233\/JCS-2009-0357","volume":"17","author":"M. Bartoletti","year":"2009","unstructured":"Bartoletti, M., Degano, P., Ferrari, G.L.: Planning and verifying service composition. JCS\u00a017(5), 799\u2013837 (2009)","journal-title":"JCS"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-00945-7_2","volume-title":"Trustworthy Global Computing","author":"M. Bartoletti","year":"2009","unstructured":"Bartoletti, M., Degano, P., Ferrari, G.L., Zunino, R.: Model checking usage policies. In: Kaklamanis, C., Nielson, F. (eds.) TGC 2008. LNCS, vol.\u00a05474, pp. 19\u201335. Springer, Heidelberg (2009)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-15205-4_12","volume-title":"Computer Science Logic","author":"M. Benedikt","year":"2010","unstructured":"Benedikt, M., Ley, C., Puppis, G.: Automata vs. logics on data words. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol.\u00a06247, pp. 110\u2013124. Springer, Heidelberg (2010)"},{"key":"11_CR4","unstructured":"Bojanczyk, M.: Data monoids. In: D\u00fcrr, C., Wilke, T. (eds.) STACS 2011, vol.\u00a09, pp. 105\u2013116. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2011)"},{"key":"11_CR5","unstructured":"Boja\u0144czyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets (2011), \n                    \n                      http:\/\/www.mimuw.edu.pl\/~sl\/PAPERS\/lics11full.pdf"},{"key":"11_CR6","series-title":"LICS","first-page":"355","volume-title":"Automata with group actions","author":"M. Bojanczyk","year":"2011","unstructured":"Bojanczyk, M., Klin, B., Lasota, S.: Automata with group actions. LICS, pp. 355\u2013364. IEEE Computer Society, Washington, DC (2011)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-23217-6_12","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"B. Bollig","year":"2011","unstructured":"Bollig, B.: An automaton over data words that captures EMSO logic. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol.\u00a06901, pp. 171\u2013186. Springer, Heidelberg (2011)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-642-28729-9_26","volume-title":"Foundations of Software Science and Computational Structures","author":"B. Bollig","year":"2012","unstructured":"Bollig, B., Cyriac, A., Gastin, P., Narayan Kumar, K.: Model checking languages of data words. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol.\u00a07213, pp. 391\u2013405. Springer, Heidelberg (2012)"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s002360050120","volume":"35","author":"E.Y.C. Cheng","year":"1998","unstructured":"Cheng, E.Y.C., Kaminski, M.: Context-free languages over infinite alphabets. Acta Inf.\u00a035(3), 245\u2013267 (1998)","journal-title":"Acta Inf."},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-31606-7_11","volume-title":"Implementation and Application of Automata","author":"P. Degano","year":"2012","unstructured":"Degano, P., Ferrari, G.-L., Mezzetti, G.: Nominal automata for resource usage control. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol.\u00a07381, pp. 125\u2013137. Springer, Heidelberg (2012)"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.ic.2006.08.003","volume":"205","author":"S. Demri","year":"2007","unstructured":"Demri, S., Lazi\u0107, R., Nowak, D.: On the freeze quantifier in constraint ltl: Decidability and complexity. Information and Computation\u00a0205(1), 2\u201324 (2007)","journal-title":"Information and Computation"},{"issue":"4","key":"11_CR12","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1145\/990010.990013","volume":"12","author":"G.L. Ferrari","year":"2003","unstructured":"Ferrari, G.L., Gnesi, S., Montanari, U., Pistore, M.: A model-checking verification environment for mobile processes. TOSEM\u00a012(4), 440\u2013473 (2003)","journal-title":"TOSEM"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-45608-2_5","volume-title":"Foundations of Security Analysis and Design","author":"A.D. Gordon","year":"2001","unstructured":"Gordon, A.D.: Notes on nominal calculi for security and mobility. In: Focardi, R., Gorrieri, R. (eds.) FOSAD 2000. LNCS, vol.\u00a02171, pp. 262\u2013330. Springer, Heidelberg (2001)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-642-13089-2_47","volume-title":"Language and Automata Theory and Applications","author":"O. Grumberg","year":"2010","unstructured":"Grumberg, O., Kupferman, O., Sheinvald, S.: Variable automata over infinite alphabets. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 561\u2013572. Springer, Heidelberg (2010)"},{"key":"11_CR15","unstructured":"Hazel, P.: Pcre: Perl compatible regular expressions (2005), \n                    \n                      http:\/\/www.pcre.org\/pcre.txt"},{"issue":"2","key":"11_CR16","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M. Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. TCS\u00a0134(2), 329\u2013363 (1994)","journal-title":"TCS"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-28729-9_17","volume-title":"Foundations of Software Science and Computational Structures","author":"A. Kurz","year":"2012","unstructured":"Kurz, A., Suzuki, T., Tuosto, E.: On nominal regular languages with binders. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol.\u00a07213, pp. 255\u2013269. Springer, Heidelberg (2012)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/3-540-44612-5_52","volume-title":"Mathematical Foundations of Computer Science 2000","author":"U. Montanari","year":"2000","unstructured":"Montanari, U., Pistore, M.: \u03c0-calculus, structured coalgebras, and minimal hd-automata. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 569\u2013578. Springer, Heidelberg (2000)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Parys, P.: Higher-order pushdown systems with data. In: Faella, M., Murano, A. (eds.) GandALF. EPTCS, vol.\u00a096, pp. 210\u2013223 (2012)","DOI":"10.4204\/EPTCS.96.16"},{"key":"11_CR20","unstructured":"Perrin, D., Pin, J.E.: Infinite words: automata, semigroups, logic and games. Pure and Applied Mathematics, vol.\u00a0141. Elsevier (2004)"},{"key":"11_CR21","unstructured":"Pitts, A.M.: Nominal sets names and symmetry in computer science: Names and symmetry in computer science. Cambridge Tracts in Theoretical Computer Science, vol.\u00a057. Cambridge University Press"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-57182-5_8","volume-title":"Mathematical Foundations of Computer Science 1993","author":"A.M. Pitts","year":"1993","unstructured":"Pitts, A.M., Stark, I.D.B.: Observable properties of higher order functions that dynamically create local names, or what\u2019s new? In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 122\u2013141. Springer, Heidelberg (1993)"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11874683_3","volume-title":"Computer Science Logic","author":"L. Segoufin","year":"2006","unstructured":"Segoufin, L.: Automata and logics for words and trees over an infinite alphabet. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 41\u201357. Springer, Heidelberg (2006)"},{"key":"11_CR24","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: LICS, pp. 332\u2013344. IEEE Computer Society Press (1986)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39274-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:29:15Z","timestamp":1557930555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39274-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392733","9783642392740"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39274-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}