{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T18:40:04Z","timestamp":1749580804672,"version":"3.41.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319459936"},{"type":"electronic","value":"9783319459943"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45994-3_5","type":"book-chapter","created":{"date-parts":[[2016,9,12]],"date-time":"2016-09-12T09:41:04Z","timestamp":1473673264000},"page":"63-76","source":"Crossref","is-referenced-by-count":0,"title":["Reachability Predicates for Graph Assertions"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Delzanno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,13]]},"reference":[{"issue":"5","key":"5_CR1","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s10009-008-0064-3","volume":"10","author":"S Bardin","year":"2008","unstructured":"Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: acceleration from theory to practice. STTT 10(5), 401\u2013424 (2008)","journal-title":"STTT"},{"key":"5_CR2","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: 23rd International Conference on Rewriting Techniques and Applications (RTA 2012), Nagoya, Japan, 28 May \u2013 2 June 2012, pp. 101\u2013116 (2012)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Dragoi, C., Enea, C., Jurski, Y., Sighireanu, M.: A generic framework for reasoning about dynamic networks of in nite-state processes. Logical Methods Comput. Sci. 5(2), 1\u201329 (2009). http:\/\/arxiv.org\/pdf\/0903.3126.pdf","DOI":"10.2168\/LMCS-5(2:3)2009"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Das, S., Perkins, C., Belding-Royer, E.: Ad hoc on-demand distance vector (AODV) routing (2003)","DOI":"10.17487\/rfc3561"},{"key":"5_CR5","unstructured":"Delzanno, G.: A logic-based approach to verify distributed protocols. To appear in the Proceedings of CILC (2016)"},{"key":"5_CR6","unstructured":"Delzanno, G., Sangnier, A., Traverso, R., Zavattaro, G.: On the complexity of parameterized reachability in recongurable broadcast networks. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, Hyderabad, India, 15\u201317 December 2012, pp. 289\u2013300 (2012)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Namjoshi, K.S.: On model checking for non-deterministic in nite-state systems. In: Thirteenth Annual IEEE Symposium on Logic in Computer Science, Indianapolis, Indiana, USA, 21\u201324 June 1998, pp. 70\u201380 (1998)","DOI":"10.1109\/LICS.1998.705644"},{"issue":"3\u20134","key":"5_CR8","doi-asserted-by":"crossref","first-page":"281","DOI":"10.3233\/FI-2012-738","volume":"119","author":"F Fioravanti","year":"2012","unstructured":"Fioravanti, F., Pettorossi, A., Proietti, M., Senni, V.: Improving reachability analysis of in nite state systems by specialization. Fundam. Inform. 119(3\u20134), 281\u2013300 (2012)","journal-title":"Fundam. Inform."},{"issue":"3","key":"5_CR9","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1145\/146637.146681","volume":"39","author":"SM German","year":"1992","unstructured":"German, S.M., Sistla, A.P.: Reasoning about systems with many processes. J. ACM 39(3), 675\u2013735 (1992)","journal-title":"J. ACM"},{"issue":"1","key":"5_CR10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s10009-011-0186-x","volume":"14","author":"AH Ghamarian","year":"2012","unstructured":"Ghamarian, A.H., de Mol, M., Rensink, A., Zambon, E., Zimakova, M.: Modelling and analysis using groove. STTT 14(1), 15\u201340 (2012)","journal-title":"STTT"},{"key":"5_CR11","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.entcs.2008.04.042","volume":"211","author":"B K\u00f6nig","year":"2008","unstructured":"K\u00f6nig, B., Kozioura, V.: Augur 2 - a new version of a tool for the analysis of graph transformation systems. Electron. Notes Theor. Comput. Sci. 211, 201\u2013210 (2008)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-3-642-14295-6_19","volume-title":"Computer Aided Verification","author":"R Meyer","year":"2010","unstructured":"Meyer, R., Strazny, T.: Petruchio: from dynamic networks to nets. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 175\u2013179. Springer, Heidelberg (2010)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1007\/978-3-642-35873-9_29","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"KS Namjoshi","year":"2013","unstructured":"Namjoshi, K.S., Trefler, R.J.: Uncovering symmetries in irregular process networks. In: Giacobazzi, R., Berdine, J., Mastroeni, I. (eds.) VMCAI 2013. LNCS, vol. 7737, pp. 496\u2013514. Springer, Heidelberg (2013)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/978-3-319-21145-9_17","volume-title":"Graph Transformation","author":"J St\u00fcckrath","year":"2015","unstructured":"St\u00fcckrath, J.: Uncover: using coverability analysis for verifying graph transformation systems. In: Parisi-Presicce, F., Westfechtel, B. (eds.) ICGT 2015. LNCS, vol. 9151, pp. 266\u2013274. Springer, Heidelberg (2015)"},{"key":"5_CR15","unstructured":"https:\/\/github.com\/pierreganty\/mist\/"},{"key":"5_CR16","unstructured":"http:\/\/users.mat.unimi.it\/users\/ghilardi\/mcmt\/"},{"key":"5_CR17","unstructured":"http:\/\/www.it.uu.se\/research\/docs\/fm\/apv\/tools\/pfs\/"},{"key":"5_CR18","unstructured":"http:\/\/www.it.uu.se\/research\/docs\/fm\/apv\/tools\/undip\/"},{"key":"5_CR19","unstructured":"http:\/\/www.liafa.jussieu.fr\/~sighirea\/trex\/"},{"key":"5_CR20","unstructured":"http:\/\/www.lsv.ens-cachan.fr\/Software\/fast\/"},{"key":"5_CR21","unstructured":"http:\/\/www.montefiore.ulg.ac.be\/~boigelot\/research\/lash\/"},{"key":"5_CR22","unstructured":"http:\/\/www.ti.inf.uni-due.de\/de\/research\/tools\/uncover\/"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45994-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T18:11:33Z","timestamp":1749579093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45994-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319459936","9783319459943"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45994-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}