{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:48:47Z","timestamp":1725515327232},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540686767"},{"type":"electronic","value":"9783540686798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-68679-8_38","type":"book-chapter","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T02:58:16Z","timestamp":1213066696000},"page":"618-624","source":"Crossref","is-referenced-by-count":0,"title":["Ugo Montanari and Software Verification"],"prefix":"10.1007","author":[{"given":"Gian-Luigi","family":"Ferrari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"38_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: The spi calculus. Information and Computation\u00a0148(1), 1\u201370 (1999)","journal-title":"Information and Computation"},{"key":"38_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11841197_3","volume-title":"Web Services and Formal Methods","author":"M. Boreale","year":"2006","unstructured":"Boreale, M., Bruni, R., Caires, L., Nicola, R.D., Lanese, I., Loreti, M., Martins, F., Montanari, U., Ravara, A., Sangiorgi, D., Vasconcelos, V.T., Zavattaro, G.: SCC: A service centered calculus. In: Bravetti, M., N\u00fa\u00f1ez, M., Zavattaro, G. (eds.) WS-FM 2006. LNCS, vol.\u00a04184, Springer, Heidelberg (2006)"},{"key":"38_CR3","first-page":"207","volume":"54","author":"A. Bouali","year":"1994","unstructured":"Bouali, A., Gnesi, S., Larosa, S.: The integration project for the jack environment. EATCS Bulletin, Centrum voor Wiskunde en Informatica (CWI)\u00a054, 207\u2013223 (1994)","journal-title":"EATCS Bulletin, Centrum voor Wiskunde en Informatica (CWI)"},{"key":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/3-540-61474-5_98","volume-title":"Computer Aided Verification","author":"A. Bouali","year":"1996","unstructured":"Bouali, A., Ressouche, A., Roy, V., de Simone, R.: The FC2TOOLS set. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, pp. 441\u2013445. Springer, Heidelberg (1996)"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Ciancia, V., Montanari, U.: A name abstraction functor for named sets. In: Coalgebraic Methods in Computer Science 2008 (to appear, 2008)","DOI":"10.1016\/j.entcs.2008.05.019"},{"issue":"4","key":"38_CR6","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1145\/242223.242257","volume":"28","author":"E.M. Clarke","year":"1996","unstructured":"Clarke, E.M., Wing, J.M.: Formal methods: State of the art and future directions. ACM Computing Surveys\u00a028(4), 626\u2013643 (1996)","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"38_CR7","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R. Cleaveland","year":"1993","unstructured":"Cleaveland, R., Parrow, J., Steffen, B.: The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems. ACM Transactions on Programming Languages and Systems\u00a015(1), 36\u201372 (1993)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BFb0035394","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G.L. Ferrari","year":"1997","unstructured":"Ferrari, G.L., Ferro, G., Gnesi, S., Montanari, U., Pistore, M., Ristori, G.: An Automata Based Verification Environment for Mobile Processes. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol.\u00a01217, pp. 275\u2013289. Springer, Heidelberg (1997)"},{"issue":"4","key":"38_CR9","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. ACM Trans. Softw. Eng. Methodol.\u00a012(4), 440\u2013473 (2003)","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"38_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/BFb0028772","volume-title":"Computer Aided Verification","author":"G.L. Ferrari","year":"1998","unstructured":"Ferrari, G.L., Gnesi, S., Montanari, U., Pistore, M., Ristori, G.: Verifying Mobile Processes in the HAL Environment. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 511\u2013515. Springer, Heidelberg (1998)"},{"key":"38_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-45931-6_10","volume-title":"Foundations of Software Science and Computation Structures","author":"G.L. Ferrari","year":"2002","unstructured":"Ferrari, G.L., Montanari, U., Pistore, M.: Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 129\u2013143. Springer, Heidelberg (2002)"},{"issue":"2-3","key":"38_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2004.09.021","volume":"331","author":"G.L. Ferrari","year":"2005","unstructured":"Ferrari, G.L., Montanari, U., Tuosto, E.: Coalgebraic minimization of HD-automata for the pi-calculus using polymorphic types. Theor. Comput. Sci.\u00a0331(2-3), 325\u2013365 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"38_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/11548133_10","volume-title":"Algebra and Coalgebra in Computer Science","author":"G.L. Ferrari","year":"2005","unstructured":"Ferrari, G.L., Montanari, U., Tuosto, E., Victor, B., Yemane, K.: Modelling fusion calculus using HD-automata. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol.\u00a03629, pp. 142\u2013156. Springer, Heidelberg (2005)"},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"Focardi, R., Gorrieri, R.: A classification of security properties. Journal of Computer Security\u00a03(1) (1995)","DOI":"10.3233\/JCS-1994\/1995-3103"},{"issue":"3-5","key":"38_CR15","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M. Gabbay","year":"2002","unstructured":"Gabbay, M., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Asp. Comput.\u00a013(3-5), 341\u2013363 (2002)","journal-title":"Formal Asp. Comput."},{"issue":"2-3","key":"38_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"},{"issue":"1","key":"38_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, I and II. Information and Computation\u00a0100(1), 1\u201340,41\u201377 (1992)","journal-title":"Information and Computation"},{"key":"38_CR18","series-title":"Lecture Notes in Computer Science","first-page":"449","volume-title":"CONCUR 2002 - Concurrency Theory","author":"U. Montanari","year":"2002","unstructured":"Montanari, U., Buscemi, M.: A First Order Coalgebraic Model of \u03c0-Calculus Early Observational Equivalence. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 449\u2013465. Springer, Heidelberg (2002)"},{"key":"38_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/3-540-60218-6_4","volume-title":"CONCUR \u201995 Concurrency Theory","author":"U. Montanari","year":"1995","unstructured":"Montanari, U., Pistore, M.: Checking Bisimilarity for Finitary \u03c0-Calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 42\u201356. Springer, Heidelberg (1995)"},{"key":"38_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-49059-0_18","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"U. Montanari","year":"1999","unstructured":"Montanari, U., Pistore, M.: Finite state verification for the asynchronous pi-calculus. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, pp. 255\u2013269. Springer, Heidelberg (1999)"},{"issue":"3","key":"38_CR21","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/j.tcs.2005.03.014","volume":"340","author":"U. Montanari","year":"2005","unstructured":"Montanari, U., Pistore, M.: Structured coalgebras and minimal HD-automata for the pi-calculus. Theor. Comput. Sci.\u00a0340(3), 539\u2013576 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"38_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/3-540-61055-3_42","volume-title":"Programming Languages and Systems - ESOP \u201996","author":"U. Montanari","year":"1996","unstructured":"Montanari, U., Pistore, M., Yankelevich, D.: Efficient minimization up to location equivalence. In: Riis Nielson, H. (ed.) ESOP 1996. LNCS, vol.\u00a01058, pp. 265\u2013279. Springer, Heidelberg (1996)"},{"key":"38_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and Automata on Infinite Sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"38_CR24","unstructured":"Pistore, M.: History Dependent Automata. PhD Thesis, Dipartimento di Informatica, Universit\u00e0 di Pisa (1999)"},{"issue":"2","key":"38_CR25","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0890-5401(03)00138-X","volume":"186","author":"A.M. Pitts","year":"2003","unstructured":"Pitts, A.M.: Nominal logic, a first order theory of names and binding. Inf. Comput.\u00a0186(2), 165\u2013193 (2003)","journal-title":"Inf. Comput."},{"key":"38_CR26","volume-title":"The \u03c0-Calculus: a Theory of Mobile Processes","author":"D. Sangiorgi","year":"2002","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-Calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2002)"}],"container-title":["Lecture Notes in Computer Science","Concurrency, Graphs and Models"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68679-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T03:18:27Z","timestamp":1551496707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68679-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540686767","9783540686798"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68679-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}