{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T16:24:35Z","timestamp":1791217475738,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642159275","type":"print"},{"value":"9783642159282","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15928-2_8","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T10:32:34Z","timestamp":1284978754000},"page":"107-122","source":"Crossref","is-referenced-by-count":7,"title":["Verification of Graph Transformation Systems with Context-Free Specifications"],"prefix":"10.1007","author":[{"given":"Barbara","family":"K\u00f6nig","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Javier","family":"Esparza","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"8_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":"8_CR2","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":"8_CR3","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":"8_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":"8_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/604131.604137","volume-title":"Proc. of POPL 2003","author":"A. Bouajjani","year":"2003","unstructured":"Bouajjani, A., Esparza, J., Touili, T.: A generic approach to the static analysis of concurrent programs with procedures. In: Proc. of POPL 2003, pp. 62\u201373. ACM, New York (2003)"},{"issue":"4","key":"8_CR6","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"K.M. Chandy","year":"1984","unstructured":"Chandy, K.M., Misra, J.: The drinking philosophers problem. ACM Transactions on Programming Languages and Systems\u00a06(4), 632\u2013646 (1984)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"8_CR7","series-title":"Foundations","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation, ch. 5","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, ch. 5. Foundations, vol.\u00a01. World Scientific, Singapore (1997)"},{"key":"8_CR8","series-title":"SIGPLAN Notices","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1145\/178243.178263","volume-title":"Proc. of PLDI 1994","author":"A. Deutsch","year":"1994","unstructured":"Deutsch, A.: Interprocedural may-alias analysis for pointers: Beyond k-limiting. In: Proc. of PLDI 1994. SIGPLAN Notices, vol.\u00a029(6), pp. 230\u2013241. ACM, New York (1994)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/11691372_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D. Distefano","year":"2006","unstructured":"Distefano, D., O\u2019Hearn, P.W., Yang, H.: A local shape analysis based on separation logic. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.\u00a03920, pp. 287\u2013302. Springer, Heidelberg (2006)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/978-3-540-39958-2_18","volume-title":"Formal Methods for Open Object-Based Distributed Systems","author":"F.L. Dotti","year":"2003","unstructured":"Dotti, F.L., Foss, L., Ribeiro, L., Marchi Santos, O.: Verification of distributed object-based systems. In: Najm, E., Nestmann, U., Stevens, P. (eds.) FMOODS 2003. LNCS, vol.\u00a02884, pp. 261\u2013275. Springer, Heidelberg (2003)"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1008743212620","volume":"16","author":"J. Esparza","year":"2000","unstructured":"Esparza, J., Melzer, S.: Verification of safety properties using integer programming: Beyond the state equation. Formal Methods in System Design\u00a016, 159\u2013189 (2000)","journal-title":"Formal Methods in System Design"},{"issue":"2","key":"8_CR12","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics\u00a016(2), 285\u2013296 (1966)","journal-title":"Pacific Journal of Mathematics"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Hyperedge Replacement: Grammars and Languages","author":"A. Habel","year":"1992","unstructured":"Habel, A.: Hyperedge Replacement: Grammars and Languages. In: Habel, A. (ed.) Hyperedge Replacement: Grammars and Languages. LNCS, vol.\u00a0643. Springer, Heidelberg (1992)"},{"key":"8_CR14","unstructured":"K\u00f6nig, B.: Graph transformation systems, Petri nets and semilinear sets: Checking for the absence of forbidden paths in graphs. In: Proc. of PNGT 2006. Electronic Communications of the EASST, vol.\u00a02 (2007)"},{"key":"8_CR15","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":"8_CR16","series-title":"ENTCS","first-page":"201","volume-title":"Proc. of GT-VMT 2006","author":"B. K\u00f6nig","year":"2006","unstructured":"K\u00f6nig, B., Kozioura, V.: Augur\u00a02\u2014a new version of a tool for the analysis of graph transformation systems. In: Proc. of GT-VMT 2006. ENTCS, vol.\u00a0211, pp. 201\u2013210. Elsevier, Amsterdam (2006)"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/96709.96718","volume-title":"Proc. of POPL 1990","author":"Y. Lafont","year":"1990","unstructured":"Lafont, Y.: Interaction nets. In: Proc. of POPL 1990, pp. 95\u2013108. ACM Press, New York (1990)"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-642-02658-4_39","volume-title":"Computer Aided Verification","author":"P. Lammich","year":"2009","unstructured":"Lammich, P., M\u00fcller-Olm, M., Wenner, A.: Predecessor sets of dynamic pushdown networks with tree-regular constraints. In: Bouajjani, A., Maler, O. (eds.) Computer Aided Verification. LNCS, vol.\u00a05643, pp. 525\u2013539. Springer, Heidelberg (2009)"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E.W. Mayr","year":"1984","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. Comput.\u00a013(3), 441\u2013460 (1984)","journal-title":"SIAM J. Comput."},{"key":"8_CR20","series-title":"IFIP","first-page":"477","volume-title":"Proc. of IFIP TCS 2008","author":"R. Meyer","year":"2008","unstructured":"Meyer, R.: On boundedness in depth in the pi-calculus. In: Proc. of IFIP TCS 2008. IFIP, vol.\u00a0273, pp. 477\u2013489. Springer, Heidelberg (2008)"},{"key":"8_CR21","unstructured":"Rensink, A., Distefano, D.: Abstract graph transformation. In: Proc. of SVV 2005. ENTCS, vol.\u00a0157.1, pp. 39\u201359 (2005)"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-87405-8_6","volume-title":"Graph Transformations","author":"S. Rieger","year":"2008","unstructured":"Rieger, S., Noll, T.: Abstracting complex data structures by hyperedge replacement. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol.\u00a05214, pp. 69\u201383. Springer, Heidelberg (2008)"},{"issue":"3","key":"8_CR23","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1145\/514188.514190","volume":"24","author":"M. Sagiv","year":"2002","unstructured":"Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. TOPLAS (ACM Transactions on Programming Languages and Systems)\u00a024(3), 217\u2013298 (2002)","journal-title":"TOPLAS (ACM Transactions on Programming Languages and Systems)"},{"key":"8_CR24","series-title":"ENTCS","volume-title":"Proc. of GT-VMT 2002","author":"D. Varr\u00f3","year":"2002","unstructured":"Varr\u00f3, D.: Towards symbolic analysis of visual modeling languages. In: Proc. of GT-VMT 2002. ENTCS, vol.\u00a072. Elsevier, Amsterdam (2002)"}],"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_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:20:13Z","timestamp":1619770813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15928-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642159275","9783642159282"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15928-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}