{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:27:12Z","timestamp":1725470832542},"publisher-location":"Berlin, Heidelberg","reference-count":20,"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_5","type":"book-chapter","created":{"date-parts":[[2012,9,18]],"date-time":"2012-09-18T03:47:41Z","timestamp":1347940061000},"page":"66-80","source":"Crossref","is-referenced-by-count":10,"title":["Pattern-Based Graph Abstraction"],"prefix":"10.1007","author":[{"given":"Arend","family":"Rensink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Zambon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_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":"5_CR2","unstructured":"Bauer, J.: Analysis of Communication Topologies by Partner Abstraction. PhD thesis, Universit\u00e4t des Saarlandes (2006)"},{"key":"5_CR3","unstructured":"Bauer, J., Boneva, I., Kurban, M., Rensink, A.: A modal-logic based graph abstraction. In: [7]"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-540-74061-2_16","volume-title":"Static Analysis","author":"J. Bauer","year":"2007","unstructured":"Bauer, J., Wilhelm, R.: Static Analysis of Dynamic Communication Systems by Partner Abstraction. In: Riis Nielson, H., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol.\u00a04634, pp. 249\u2013264. Springer, Heidelberg (2007)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Becker, B., Beyer, D., Giese, H., Klein, F., Schilling, D.: Symbolic invariant verification for systems with dynamic structural adaptation. In: ICSE. ACM (2006)","DOI":"10.1145\/1134285.1134297"},{"key":"5_CR6","unstructured":"de Lara, J., Varro, D. (eds.): GraBaTs. ECEASST, vol.\u00a032. EASST (2010)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Graph Transformations","year":"2008","unstructured":"Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.): ICGT 2008. LNCS, vol.\u00a05214. Springer, Heidelberg (2008)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Ghamarian, A.H., de Mol, M., Rensink, A., Zambon, E., Zimakova, M.: Modelling and analysis using groove. STTT 14(1) (2012)","DOI":"10.1007\/s10009-011-0186-x"},{"key":"5_CR9","unstructured":"Ghamarian, A.H., Rensink, A., Jalali, A.: Incremental pattern matching in graph-based state space exploration. In: [6]"},{"key":"5_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":"5_CR11","doi-asserted-by":"crossref","unstructured":"K\u00f6nig, B., Kozioura, V.: Augur 2 - a new version of a tool for the analysis of graph transformation systems. ENTCS 211 (2008)","DOI":"10.1016\/j.entcs.2008.04.042"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-25959-6_40","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"A. Rensink","year":"2004","unstructured":"Rensink, A.: The GROOVE Simulator: A\u00a0Tool for State Space Generation. In: Pfaltz, J.L., Nagl, M., B\u00f6hlen, B. (eds.) AGTIVE 2003. LNCS, vol.\u00a03062, pp. 479\u2013485. Springer, Heidelberg (2004)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-24725-8_28","volume-title":"Programming Languages and Systems","author":"A. Rensink","year":"2004","unstructured":"Rensink, A.: Canonical Graph Shapes. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol.\u00a02986, pp. 401\u2013415. Springer, Heidelberg (2004)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Rensink, A., Distefano, D.: Abstract graph transformation. In: Workshop on Software Verification and Validation (SVV). ENTCS, vol.\u00a0157 (2006)","DOI":"10.1016\/j.entcs.2006.01.022"},{"key":"5_CR15","unstructured":"Rensink, A., Zambon, E.: Neighbourhood abstraction in groove. In: [6]"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Rensink, A., Zambon, E.: Pattern-based graph abstraction (extended version). Technical report, University of Twente, Enschede, The Netherlands (2012)","DOI":"10.1007\/978-3-642-33654-6_5"},{"key":"5_CR17","unstructured":"Rieger, S., Noll, T.: Abstracting complex data structures by hyperedge replacement. In: [7]"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Sagiv, S., Reps, T.W., Wilhelm, R.: Parametric shape analysis via 3-valued logic. ToPLaS 24(3) (2002)","DOI":"10.1145\/514188.514190"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-78800-3_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Saksena","year":"2008","unstructured":"Saksena, M., Wibling, O., Jonsson, B.: Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 18\u201332. Springer, Heidelberg (2008)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Zambon, E., Rensink, A.: Graph subsumption in abstract state space exploration. In: GRAPHITE (Pre-proceedings) (2012)","DOI":"10.4204\/EPTCS.99.6"}],"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_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:17:55Z","timestamp":1620130675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33654-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642336539","9783642336546"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33654-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}