{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:55:40Z","timestamp":1725566140426},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642159275"},{"type":"electronic","value":"9783642159282"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15928-2_19","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T14:32:34Z","timestamp":1284993154000},"page":"282-297","source":"Crossref","is-referenced-by-count":3,"title":["Counterpart Semantics for a Second-Order \u03bc-Calculus"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Gadducci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Lluch Lafuente","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Vandin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-71998-4_1","volume-title":"Recent Trends in Algebraic Development Techniques","author":"P. Baldan","year":"2007","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B., Lluch Lafuente, A.: A temporal graph logic for verification of graph transformation systems. In: Fiadeiro, J.L., Schobbens, P.-Y. (eds.) WADT 2006. LNCS, vol.\u00a04409, pp. 1\u201320. Springer, Heidelberg (2007)"},{"key":"19_CR2","unstructured":"Belardinelli, F.: Quantified Modal Logic and the Ontology of Physical Objects. Ph.D. thesis, Scuola Normale Superiore of Pisa (2006)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-24727-2_7","volume-title":"Foundations of Software Science and Computation Structures","author":"L. Caires","year":"2004","unstructured":"Caires, L.: Behavioral and spatial observations in a logic for the \u03c0-calculus. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 72\u201389. Springer, Heidelberg (2004)"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/S0890-5401(03)00137-8","volume":"186","author":"L. Caires","year":"2003","unstructured":"Caires, L., Cardelli, L.: A spatial logic for concurrency (part I). Information and Computation\u00a0186(2), 194\u2013235 (2003)","journal-title":"Information and Computation"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45465-9_51","volume-title":"Automata, Languages and Programming","author":"L. Cardelli","year":"2002","unstructured":"Cardelli, L., Gardner, P., Ghelli, G.: A spatial logic for querying graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 597\u2013610. Springer, Heidelberg (2002)"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-36576-1_14","volume-title":"Foundations of Software Science and Computational Structures","author":"L. Cardelli","year":"2003","unstructured":"Cardelli, L., Gardner, P., Ghelli, G.: Manipulating trees with hidden labels. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 216\u2013232. Springer, Heidelberg (2003)"},{"issue":"3","key":"19_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1017\/S0960129504004141","volume":"14","author":"L. Cardelli","year":"2004","unstructured":"Cardelli, L., Ghelli, G.: TQL: a query language for semistructured data based on the ambient logic. Mathematical Structures in Computer Science\u00a014(3), 285\u2013327 (2004)","journal-title":"Mathematical Structures in Computer Science"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1142\/9789812384720_0005","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"B. Courcelle","year":"1997","unstructured":"Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, pp. 313\u2013400. World Scientific, Singapore (1997)"},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.ic.2006.10.006","volume":"205","author":"A. Dawar","year":"2007","unstructured":"Dawar, A., Gardner, P., Ghelli, G.: Expressiveness and complexity of graph logic. Information and Compututation\u00a0205(3), 263\u2013310 (2007)","journal-title":"Information and Compututation"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-540-30538-5_21","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"D. Distefano","year":"2004","unstructured":"Distefano, D., Katoen, J.P., Rensink, A.: Who is pointing when to whom? In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.\u00a03328, pp. 250\u2013262. Springer, Heidelberg (2004)"},{"key":"19_CR11","series-title":"IFIP Conference Proceedings","first-page":"435","volume-title":"IFIP International Conference on Theoretical Computer Science (TCS 2002)","author":"D. Distefano","year":"2002","unstructured":"Distefano, D., Rensink, A., Katoen, J.P.: Model checking birth and death. In: Baeza-Yates, R.A., Montanari, U., Santoro, N. (eds.) IFIP International Conference on Theoretical Computer Science (TCS 2002). IFIP Conference Proceedings, vol.\u00a0223, pp. 435\u2013447. Kluwer, Dordrecht (2002)"},{"key":"19_CR12","unstructured":"Franconi, E., Toman, D.: Fixpoint extensions of temporal description logics. In: Calvanese, D., Giacomo, G.D., Franconi, E. (eds.) 16th International Workshop on Description Logics (DL 2003). CEUR Workshop Proceedings, vol.\u00a081 (2003), \n                    \n                      CEUR-WS.org"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/978-3-540-46464-8_22","volume-title":"Theory and Application of Graph Transformations","author":"F. Gadducci","year":"2000","unstructured":"Gadducci, F., Heckel, R., Koch, M.: A fully abstract model for graph-interpreted temporal logic. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol.\u00a01764, pp. 310\u2013322. Springer, Heidelberg (2000)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-73859-6_15","volume-title":"Algebra and Coalgebra in Computer Science","author":"F. Gadducci","year":"2007","unstructured":"Gadducci, F., Lluch Lafuente, A.: Graphical encoding of a spatial logic for the \u03c0-calculus. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol.\u00a04624, pp. 209\u2013225. Springer, Heidelberg (2007)"},{"issue":"6","key":"19_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.2307\/2025472","volume":"76","author":"A. Hazen","year":"2004","unstructured":"Hazen, A.: Counterpart-theoretic semantics for modal logic. The Journal of Philosophy\u00a076(6), 319\u2013338 (2004)","journal-title":"The Journal of Philosophy"},{"key":"19_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45653-8_1","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"I. Hodkinson","year":"2001","unstructured":"Hodkinson, I., Wolter, F., Zakharyaschev, M.: Monodic fragments of first-order temporal logics: 2000-2001 a.d. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 1\u201323. Springer, Heidelberg (2001)"},{"key":"19_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810275","volume-title":"Logic in Computer Science: Modelling and Reasoning about Systems","author":"M. Huth","year":"2004","unstructured":"Huth, M., Ryan, M.: Logic in Computer Science: Modelling and Reasoning about Systems. Cambridge University Press, Cambridge (2004)"},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0022-0000(85)90003-0","volume":"30","author":"J. Reif","year":"1985","unstructured":"Reif, J., Sistla, A.P.: A multiprocess network logic with temporal and spatial modalities. International Journal of Computer and System Sciences\u00a030(1), 41\u201353 (1985)","journal-title":"International Journal of Computer and System Sciences"},{"key":"19_CR19","unstructured":"Rensink, A.: Towards model checking graph grammars. In: Leuschel, M., Gruner, S., Lo Presti, S. (eds.) 3rd Workshop on Automated Verification of Critical Systems (AvoCS 2003). University of Southampton Technical Reports, vol. DSSE\u2013TR\u20132003\u20132, pp. 150\u2013160. University of Southampton (2003)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/11817949_8","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"A. Rensink","year":"2006","unstructured":"Rensink, A.: Model checking quantified computation tree logic. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 110\u2013125. Springer, Heidelberg (2006)"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/LICS.2002.1029817","volume-title":"17th IEEE Symposium on Logic in Computer Science (LICS 2002)","author":"J. Reynolds","year":"2002","unstructured":"Reynolds, J.: Separation logic: A logic for shared mutable data structures. In: 17th IEEE Symposium on Logic in Computer Science (LICS 2002), pp. 55\u201374. IEEE Computer Society, Los Alamitos (2002)"},{"key":"19_CR22","unstructured":"Vandin, A.: Algebraic models for a second-order modal logic. Master\u2019s thesis, University of Pisa (2009), \n                    \n                      http:\/\/www.di.unipi.it\/~vandin\/thesis.pdf"},{"issue":"5","key":"19_CR23","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1093\/jigpal\/jzl009","volume":"14","author":"E. Yahav","year":"2006","unstructured":"Yahav, E., Reps, T.W., Sagiv, S., Wilhelm, R.: Verifying temporal heap properties specified via evolution logic. Logic Journal of the IGPL\u00a014(5), 755\u2013783 (2006)","journal-title":"Logic Journal of the IGPL"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15928-2_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:20:10Z","timestamp":1619785210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15928-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642159275","9783642159282"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15928-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}