{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T11:21:00Z","timestamp":1770290460213,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642198045","type":"print"},{"value":"9783642198052","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19805-2_25","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T09:05:14Z","timestamp":1300093514000},"page":"365-380","source":"Crossref","is-referenced-by-count":17,"title":["Freshness and Name-Restriction in Sets of Traces with Names"],"prefix":"10.1007","author":[{"given":"Murdoch J.","family":"Gabbay","sequence":"first","affiliation":[]},{"given":"Vincenzo","family":"Ciancia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1109\/LICS.2004.1319609","volume-title":"Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004)","author":"S. Abramsky","year":"2004","unstructured":"Abramsky, S., Ghica, D.R., Murawski, A.S., Ong, C.-H.L., Stark, I.D.B.: Nominal games and full abstraction for the nu-calculus. In: Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), pp. 150\u2013159. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/LICS.2007.36","volume-title":"Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","author":"M. Bonsangue","year":"2007","unstructured":"Bonsangue, M., Kurz, A.: Pi-calculus in logical form. In: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp. 303\u2013312. IEEE Computer Society Press, Los Alamitos (2007)"},{"issue":"12","key":"25_CR3","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1016\/j.ic.2009.10.007","volume":"208","author":"Vincenzo Ciancia","year":"2010","unstructured":"Ciancia, V., Montanari, U.: Symmetries, local names and dynamic (de)-allocation of names, Information and Computation (2010) (in press)","journal-title":"Information and Computation"},{"key":"25_CR4","unstructured":"Ciancia, V., Tuosto, E.: A novel class of automata for languages on infinite alphabets, Tech. Report CS-09-003, University of Leicester, UK (2009)"},{"key":"25_CR5","first-page":"47","volume-title":"Proceedings of the 7th ACM SIGPLAN International Symposium on Principles and Practice of Declarative Programming (PPDP 2005)","author":"M. Fern\u00e1ndez","year":"2005","unstructured":"Fern\u00e1ndez, M., Gabbay, Murdoch J.: Nominal rewriting with name generation: abstraction vs. locality. In: Proceedings of the 7th ACM SIGPLAN International Symposium on Principles and Practice of Declarative Programming (PPDP 2005), pp. 47\u201358. ACM Press, New York (July 2005)"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/LICS.1996.561302","volume-title":"Proceedings of the 11th IEEE Symposium on Logic in Computer Science (LICS 1996)","author":"M. Fiore","year":"1996","unstructured":"Fiore, M., Moggi, E., Sangiorgi, D.: A fully-abstract model for the \u03c0-calculus (extended abstract). In: Proceedings of the 11th IEEE Symposium on Logic in Computer Science (LICS 1996), pp. 43\u201354. IEEE Computer Society Press, Los Alamitos (1996)"},{"issue":"4","key":"25_CR7","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.ic.2005.08.004","volume":"204","author":"M. Fiore","year":"2006","unstructured":"Fiore, M., Staton, S.: Comparing operational models of name-passing process calculi. Information and Computation\u00a0204(4), 524\u2013560 (2006)","journal-title":"Information and Computation"},{"key":"25_CR8","first-page":"93","volume-title":"Proceedings of the 16th IEEE Symposium on Logic in Computer Science (LICS 2001)","author":"M. Fiore","year":"2001","unstructured":"Fiore, M., Turi, D.: Semantics of name and value passing. In: Proceedings of the 16th IEEE Symposium on Logic in Computer Science (LICS 2001), pp. 93\u2013104. IEEE Computer Society Press, Los Alamitos (2001)"},{"issue":"3","key":"25_CR9","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/0022-0000(79)90006-0","volume":"19","author":"N. Francez","year":"1979","unstructured":"Francez, N., Hoare, C.A.R., Lehmann, D.J., de Roever, W.P.: Semantics of nondeterminism, concurrency, and communication. Journal of Computer and System Sciences\u00a019(3), 290\u2013308 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR10","unstructured":"Gabbay, Murdoch J.: A Theory of Inductive Definitions with alpha-Equivalence, Ph.D. thesis, University of Cambridge, UK (March 2001)"},{"issue":"7","key":"25_CR11","doi-asserted-by":"publisher","first-page":"982","DOI":"10.1016\/j.ic.2006.10.010","volume":"205","author":"M.J. Gabbay","year":"2007","unstructured":"Gabbay, Murdoch J.: A General Mathematics of Names. Information and Computation\u00a0205(7), 982\u20131011 (2007)","journal-title":"Information and Computation"},{"issue":"12-13","key":"25_CR12","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1016\/j.tcs.2008.11.013","volume":"410","author":"M.J. Gabbay","year":"2009","unstructured":"Gabbay, Murdoch J.: A study of substitution, using nominal techniques and Fraenkel-Mostowski sets. Theoretical Computer Science\u00a0410(12-13), 1159\u20131189 (2009)","journal-title":"Theoretical Computer Science"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Gabbay, Murdoch J.: Foundations of nominal techniques: logic and semantics of variables in abstract syntax. Bulletin of Symbolic Logic (2010) (in press)","DOI":"10.2178\/bsl\/1305810911"},{"issue":"6","key":"25_CR14","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1093\/logcom\/exp033","volume":"19","author":"M.J. Gabbay","year":"2009","unstructured":"Gabbay, Murdoch J., Mathijssen, A.: Nominal universal algebra: equational logic with names and binding. Journal of Logic and Computation\u00a019(6), 1455\u20131508 (2009)","journal-title":"Journal of Logic and Computation"},{"issue":"3-5","key":"25_CR15","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M.J. Gabbay","year":"2001","unstructured":"Gabbay, Murdoch J., Pitts, A.M.: A New Approach to Abstract Syntax with Variable Binding. Formal Aspects of Computing\u00a013(3-5), 341\u2013363 (2001)","journal-title":"Formal Aspects of Computing"},{"issue":"2-3","key":"25_CR16","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10990-006-8749-3","volume":"19","author":"F. Gadducci","year":"2006","unstructured":"Gadducci, F., Miculan, M., Montanari, U.: About permutation algebras (pre)sheaves and named sets. Higher-Order and Symbolic Computation\u00a019(2-3), 283\u2013304 (2006)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"25_CR17","volume-title":"The spin model checker: Primer and reference manual","author":"G.J. Holzmann","year":"2003","unstructured":"Holzmann, G.J.: The spin model checker: Primer and reference manual. Addison-Wesley Professional, Reading (September 2003)"},{"issue":"2","key":"25_CR18","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. Theoretical Computer Science\u00a0134(2), 329\u2013363 (1994)","journal-title":"Theoretical Computer Science"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0025782","volume-title":"Logics of Programs","author":"D. Kozen","year":"1982","unstructured":"Kozen, D.: On induction vs. *-continuity. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol.\u00a0131, pp. 167\u2013176. Springer, Heidelberg (1982)"},{"issue":"2","key":"25_CR20","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation\u00a0110(2), 366\u2013390 (1994)","journal-title":"Information and Computation"},{"key":"25_CR21","first-page":"184","volume-title":"Principles and Practice of Declarative Programming, 5th International ACM SIGPLAN Symposium (PPDP 2003)","author":"M. Miculan","year":"2003","unstructured":"Miculan, M., Scagnetto, I.: A framework for typed HOAS and semantics. In: Principles and Practice of Declarative Programming, 5th International ACM SIGPLAN Symposium (PPDP 2003), pp. 184\u2013194. ACM, New York (2003)"},{"issue":"1","key":"25_CR22","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Information and Computation\u00a093(1), 55\u201392 (1991)","journal-title":"Information and Computation"},{"key":"25_CR23","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, p. 569. Springer, Heidelberg (2000)"},{"key":"25_CR24","first-page":"48","volume-title":"Proceedings of the 21st Annual ACM Symposium on Principles of Programming Languages (POPL 1994)","author":"M. Odersky","year":"1994","unstructured":"Odersky, M.: A functional theory of local names. In: Proceedings of the 21st Annual ACM Symposium on Principles of Programming Languages (POPL 1994), pp. 48\u201359. ACM Press, New York (1994)"},{"key":"25_CR25","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":"25_CR26","first-page":"159","volume-title":"Proceedings of the 37th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL 2010)","author":"A.M. Pitts","year":"2010","unstructured":"Pitts, A.M.: Nominal system T. In: Proceedings of the 37th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL 2010), pp. 159\u2013170. ACM Press, New York (January 2010)"},{"key":"25_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/10722010_15","volume-title":"Mathematics of Program Construction","author":"A.M. Pitts","year":"2000","unstructured":"Pitts, A.M., Gabbay, Murdoch J.: A Metalanguage for Programming with Bound Names Modulo Renaming. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol.\u00a01837, pp. 230\u2013255. Springer, Heidelberg (2000)"},{"issue":"1","key":"25_CR28","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2005.06.003","volume":"342","author":"M.R. Shinwell","year":"2005","unstructured":"Shinwell, M.R., Pitts, A.M.: On a monadic semantics for freshness. Theoretical Computer Science\u00a0342(1), 28\u201355 (2005)","journal-title":"Theoretical Computer Science"},{"key":"25_CR29","first-page":"263","volume-title":"Proceedings of the 8th ACM SIGPLAN International Conference on Functional Programming (ICFP 2003)","author":"M.R. Shinwell","year":"2003","unstructured":"Shinwell, M.R., Pitts, A.M., Gabbay, Murdoch J.: FreshML: Programming with Binders Made Simple. In: Proceedings of the 8th ACM SIGPLAN International Conference on Functional Programming (ICFP 2003), vol.\u00a038, pp. 263\u2013274. ACM Press, New York (August 2003)"},{"key":"25_CR30","unstructured":"Tzevelekos, N.: Nominal game semantics. Ph.D. thesis, Oxford (2008)"},{"key":"25_CR31","volume-title":"Proceedings of the 38th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL 2011)","author":"N. Tzevelekos","year":"2011","unstructured":"Tzevelekos, N.: Fresh-register automata. In: Proceedings of the 38th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL 2011). ACM Press, New York (January 2011)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19805-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T07:24:17Z","timestamp":1558423457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19805-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198045","9783642198052"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19805-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}