Theorem Proving Graph Grammars: Strategies for Discharging Proof Obligations

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.