{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:27:09Z","timestamp":1725470829050},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642336539"},{"type":"electronic","value":"9783642336546"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33654-6_4","type":"book-chapter","created":{"date-parts":[[2012,9,17]],"date-time":"2012-09-17T23:47:41Z","timestamp":1347925661000},"page":"51-65","source":"Crossref","is-referenced-by-count":1,"title":["Exploiting Over- and Under-Approximations for Infinite-State Counterpart Models"],"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":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/3-540-44685-0_26","volume-title":"CONCUR 2001 - Concurrency Theory","author":"P. Baldan","year":"2001","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B.: A Static Analysis Technique for Graph Transformation Systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 381\u2013395. Springer, Heidelberg (2001)"},{"key":"4_CR2","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":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-45832-8_4","volume-title":"Graph Transformation","author":"P. Baldan","year":"2002","unstructured":"Baldan, P., K\u00f6nig, B.: Approximating the Behaviour of Graph Transformation Systems. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol.\u00a02505, pp. 14\u201329. Springer, Heidelberg (2002)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-44898-5_14","volume-title":"Static Analysis","author":"P. Baldan","year":"2003","unstructured":"Baldan, P., K\u00f6nig, B., K\u00f6nig, B.: A Logic for Analyzing Abstractions of Graph Transformation Systems. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 255\u2013272. Springer, Heidelberg (2003)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-540-87405-8_22","volume-title":"Graph Transformations","author":"J. Bauer","year":"2008","unstructured":"Bauer, J., Boneva, I., Kurb\u00e1n, M.E., Rensink, A.: A Modal-Logic Based Graph Abstraction. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol.\u00a05214, pp. 321\u2013335. Springer, Heidelberg (2008)"},{"key":"4_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977619","volume-title":"Graph Structure and Monadic Second-Order Logic, A Language Theoretic Approach","author":"B. Courcelle","year":"2012","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic, A Language Theoretic Approach. Cambridge University Press, Cambridge (2012)"},{"issue":"3","key":"4_CR7","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 Computation\u00a0205(3), 263\u2013310 (2007)","journal-title":"Information and Computation"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Gadducci, F., Lluch Lafuente, A., Vandin, A.: Counterpart semantics for a second-order mu-calculus. Fundamenta Informaticae 118(1-2) (2012)","DOI":"10.3233\/FI-2012-709"},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10009-011-0186-x","volume":"14","author":"A.H. Ghamarian","year":"2012","unstructured":"Ghamarian, A.H., de Mol, M., Rensink, A., Zambon, E., Zimakova, M.: Modelling and Analysis Using GROOVE. Software Tools for Technology Transfer\u00a014(1), 15\u201340 (2012)","journal-title":"Software Tools for Technology Transfer"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/11691372_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B. K\u00f6nig","year":"2006","unstructured":"K\u00f6nig, B., Kozioura, V.: Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.\u00a03920, pp. 197\u2013211. Springer, Heidelberg (2006)"},{"key":"4_CR11","unstructured":"Lluch Lafuente, A., Vandin, A.: Towards a Maude Tool for Model Checking Temporal Graph Properties. In: Gadducci, F., Mariani, L. (eds.) GT-VMT. ECEASST, vol.\u00a042, EAAST (2011)"},{"key":"4_CR12","unstructured":"Rensink, A.: Towards model checking graph grammars. In: Leuschel, M., Gruner, S., Lo\u00a0Presti, S. (eds.) AVOCS. DSSE-TR, vol. 2003-2. University of Southampton (2003)"},{"key":"4_CR13","unstructured":"Rensink, A.: Isomorphism checking in GROOVE. In: Z\u00fcndorf, A., Varr\u00f3, D. (eds.) GraBaTs. ECEASST, vol.\u00a01. EAAST (2006)"},{"key":"4_CR14","series-title":"ENTCS","first-page":"39","volume-title":"SVV","author":"A. Rensink","year":"2006","unstructured":"Rensink, A., Distefano, D.: Abstract graph transformation. In: Mukhopadhyay, S., Roychoudhury, A., Yang, Z. (eds.) SVV. ENTCS, vol.\u00a0157(1), pp. 39\u201359. Elsevier, Amsterdam (2006)"},{"key":"4_CR15","unstructured":"Rensink, A., Zambon, E.: Neighbourhood abstraction in GROOVE. In: de Lara, J., Varr\u00f3, D. (eds.) GraBaTs. ECEASST, vol.\u00a032. EAAST (2010)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Zambon, E., Rensink, A.: Using Graph Transformations and Graph Abstractions for Software Verification. In: Corradini, A. (ed.) ICGT - Doctoral Symposium. ECEASST, vol.\u00a038. EASST (2011)","DOI":"10.1007\/978-3-642-15928-2_37"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33654-6_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:17:55Z","timestamp":1620116275000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33654-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642336539","9783642336546"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33654-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}