Abstract
One way of developing reliable systems is through the use of Formal Methods. A Graph Grammar specification is visual and based in a simple mechanism of rewriting rules. On the other hand, verification through theorem proving allows the proof of properties for systems with huge (and infinite) state space. There is a previously proposed approach that has allowed the application of theorem proving technique to graph grammars. One of the disadvantages of such an approach (and theorem proving in general) is the specific mathematical knowledge required from the user for concluding the proofs. This paper proposes proof strategies in order to help the developer in the verification process through theorem proving, when adopting graph grammar as specification language.
The authors gratefully acknowledge financial support received from CNPq and FAPERGS, specially under Grants, ARD 11/0764-9, PRONEM 11/2016-2 and PRONEX 10/0043-0.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ehrig, H., Heckel, R., Korff, M., Löwe, M., Ribeiro, L., Wagner, A., Corradini, A.: Handbook of graph grammars and computing by graph transformation, pp. 247–312. World Scientific Publishing Co., Inc., River Edge (1997)
Robinson, J.A., Voronkov, A. (eds.): Handbook of Automated Reasoning (in 2 volumes). Elsevier and MIT Press (2001)
de Mello, A.M., Junior, L.C.L., Foss, L., da Costa Cavalheiro, S.A.: Graph grammars: A comparison between verification methods. In: WEIT, pp. 88–94 (2011)
da Costa, S.A., Ribeiro, L.: Verification of graph grammars using a logical approach. Sci. Comput. Program. 77(4), 480–504 (2012)
Ribeiro, L., Dotti, F.L., da Costa, S.A., Dillenburg, F.C.: Towards theorem proving graph grammars using Event-B. ECEASST 30 (2010)
da Costa, S.A.: Relational approach of graph grammars. PhD thesis, UFRGS, Brazil (2010)
DEPLOY: Event-B and the rodin platform (Mai 2013), http://www.event-b.org/ (last accessed Mai 2013)
Abrial, J.R., Butler, M., Hallerstede, S., Hoang, T.S., Mehta, F., Voisin, L.: Rodin: An open toolset for modelling and reasoning in Event-B. International Journal on Software Tools for Technology Transfer (STTT) 12(6), 447–466 (2010)
Tanenbaum, A.: Computer Networks, 4th edn. Prentice Hall Professional Technical Reference (2002)
Abrial, J.R.: Modeling in Event-B: System and Software Engineering, 1st edn. Cambridge University Press, New York (2010)
da Costa Cavalheiro, S.A., Foss, L., Ribeiro, L.: Specification patterns for properties over reachable states of graph grammars. In: Gheyi, R., Naumann, D. (eds.) SBMF 2012. LNCS, vol. 7498, pp. 83–98. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lemos Junior, L.C., André da Costa Cavalheiro, S., Foss, L. (2013). Theorem Proving Graph Grammars: Strategies for Discharging Proof Obligations. In: Iyoda, J., de Moura, L. (eds) Formal Methods: Foundations and Applications. SBMF 2013. Lecture Notes in Computer Science, vol 8195. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41071-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-41071-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41070-3
Online ISBN: 978-3-642-41071-0
eBook Packages: Computer ScienceComputer Science (R0)