{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T08:40:01Z","timestamp":1748508001830,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319211442"},{"type":"electronic","value":"9783319211459"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21145-9_17","type":"book-chapter","created":{"date-parts":[[2015,7,16]],"date-time":"2015-07-16T10:55:04Z","timestamp":1437044104000},"page":"266-274","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Uncover: Using Coverability Analysis for Verifying Graph Transformation Systems"],"prefix":"10.1007","author":[{"given":"Jan","family":"St\u00fcckrath","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,17]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-540-70545-1_33","volume-title":"Computer Aided Verification","author":"PA Abdulla","year":"2008","unstructured":"Abdulla, P.A., Bouajjani, A., Cederberg, J., Haziza, F., Rezine, A.: Monotonic abstraction for programs with dynamic memory heaps. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 341\u2013354. Springer, Heidelberg (2008)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., C\u0306er\u0101ns, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: Proceedings of LICS 1996, pp. 313\u2013321. IEEE (1996)","DOI":"10.1109\/LICS.1996.561359"},{"key":"17_CR3","unstructured":"AUGUR2. http:\/\/www.ti.inf.uni-due.de\/research\/tools\/augur2\/"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-36742-7_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K Bansal","year":"2013","unstructured":"Bansal, K., Koskinen, E., Wies, T., Zufferey, D.: Structural counter abstraction. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013 (ETAPS 2013). LNCS, vol. 7795, pp. 62\u201377. Springer, Heidelberg (2013)"},{"key":"17_CR5","unstructured":"Bertrand, N., Delzanno, G., K\u00f6nig, B., Sangnier, A., St\u00fcckrath, J.: On the decidability status of reachability and coverability in graph transformation systems. In: Proceedings of RTA 2012, vol. 15 of LIPIcs, pp. 101\u2013116 (2012)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-319-11439-2_6","volume-title":"Reachability Problems","author":"G Delzanno","year":"2014","unstructured":"Delzanno, G., St\u00fcckrath, J.: Parameterized verification of graph transformation systems with whole neighbourhood operations. In: Ouaknine, J., Potapov, I., Worrell, J. (eds.) RP 2014. LNCS, vol. 8762, pp. 72\u201384. Springer, Heidelberg (2014)"},{"issue":"1\u20132","key":"17_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere!. Theor. Comput. Sci. 256(1\u20132), 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR8","unstructured":"Graph Backwards Tool (GB). http:\/\/www.it.uu.se\/research\/group\/mobility\/adhoc\/gbt"},{"key":"17_CR9","unstructured":"Graphviz website. http:\/\/www.graphviz.org\/"},{"key":"17_CR10","unstructured":"GROOVE. http:\/\/groove.cs.utwente.nl\/"},{"key":"17_CR11","unstructured":"Holt, R.C., Sch\u00fcrr, A., Sim, S.E., Winter, A.: GXL. http:\/\/www.gupro.de\/GXL\/"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-70545-1_21","volume-title":"Computer Aided Verification","author":"S Joshi","year":"2008","unstructured":"Joshi, S., K\u00f6nig, B.: Applying the graph minor theorem to the verification of graph transformation systems. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 214\u2013226. Springer, Heidelberg (2008)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-33654-6_6","volume-title":"Graph Transformations","author":"B K\u00f6nig","year":"2012","unstructured":"K\u00f6nig, B., St\u00fcckrath, J.: Well-structured graph transformation systems with negative application conditions. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2012. LNCS, vol. 7562, pp. 81\u201395. Springer, Heidelberg (2012)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/978-3-662-44584-6_32","volume-title":"CONCUR 2014 \u2013 Concurrency Theory","author":"B K\u00f6nig","year":"2014","unstructured":"K\u00f6nig, B., St\u00fcckrath, J.: A general framework for well-structured graph transformation systems. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 467\u2013481. Springer, Heidelberg (2014)"},{"key":"17_CR15","unstructured":"Meyer, R.: Structural stationarity in the $$\\pi $$-calculus. Ph.D. thesis, Carl-von-Ossietzky-Universit\u00e4t Oldenburg (2009)"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.jctb.2009.07.003","volume":"100","author":"N Robertson","year":"2010","unstructured":"Robertson, N., Seymour, P.: Graph minors XXIII. Nash-Williams\u2019 immersion conjecture. J. Comb. Theory, Ser. B 100, 181\u2013205 (2010)","journal-title":"J. Comb. Theory, Ser. B"},{"volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation: Volume 1: Foundations","year":"1997","key":"17_CR17","unstructured":"Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation: Volume 1: Foundations. World Scientific Publishing, River Edge (1997)"},{"key":"17_CR18","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. 4963, pp. 18\u201332. Springer, Heidelberg (2008)"},{"key":"17_CR19","unstructured":"St\u00fcckrath, J.: UNCOVER. http:\/\/www.ti.inf.uni-due.de\/research\/tools\/uncover\/"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21145-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T08:27:37Z","timestamp":1748507257000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21145-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319211442","9783319211459"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21145-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"17 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}