Abstract
We introduce a logic-based formalism to specify updates on arbitrary graphs. For the resulting language called GLog, we introduce an assertional language for reasoning about infinite sets of graph configurations in which we use reachability predicates to specify paths of arbitrary length. For the considered assertional language and a restricted class of update rules, we define a symbolic procedure to compute predecessor configurations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: acceleration from theory to practice. STTT 10(5), 401–424 (2008)
Bertrand, N., Delzanno, G., König, B., Sangnier, A., Stückrath, 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 – 2 June 2012, pp. 101–116 (2012)
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–29 (2009). http://arxiv.org/pdf/0903.3126.pdf
Das, S., Perkins, C., Belding-Royer, E.: Ad hoc on-demand distance vector (AODV) routing (2003)
Delzanno, G.: A logic-based approach to verify distributed protocols. To appear in the Proceedings of CILC (2016)
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–17 December 2012, pp. 289–300 (2012)
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–24 June 1998, pp. 70–80 (1998)
Fioravanti, F., Pettorossi, A., Proietti, M., Senni, V.: Improving reachability analysis of in nite state systems by specialization. Fundam. Inform. 119(3–4), 281–300 (2012)
German, S.M., Sistla, A.P.: Reasoning about systems with many processes. J. ACM 39(3), 675–735 (1992)
Ghamarian, A.H., de Mol, M., Rensink, A., Zambon, E., Zimakova, M.: Modelling and analysis using groove. STTT 14(1), 15–40 (2012)
König, 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–210 (2008)
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–179. Springer, Heidelberg (2010)
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–514. Springer, Heidelberg (2013)
Stückrath, J.: Uncover: using coverability analysis for verifying graph transformation systems. In: Parisi-Presicce, F., Westfechtel, B. (eds.) ICGT 2015. LNCS, vol. 9151, pp. 266–274. Springer, Heidelberg (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Delzanno, G. (2016). Reachability Predicates for Graph Assertions. In: Larsen, K., Potapov, I., Srba, J. (eds) Reachability Problems. RP 2016. Lecture Notes in Computer Science(), vol 9899. Springer, Cham. https://doi.org/10.1007/978-3-319-45994-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-45994-3_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45993-6
Online ISBN: 978-3-319-45994-3
eBook Packages: Computer ScienceComputer Science (R0)