Bounded Model Checking of Graph Transformation Systems via SMT Solving - Formal Techniques for Distributed Systems Access content directly
Conference Papers Year : 2013

Bounded Model Checking of Graph Transformation Systems via SMT Solving

Tobias Isenberg
  • Function : Author
  • PersonId : 1007059
Dominik Steenken
  • Function : Author
  • PersonId : 1007060
Heike Wehrheim
  • Function : Author
  • PersonId : 1007061


Bounded model checking (BMC) complements classical model checking by an efficient technique for checking error-freedom of bounded system paths. Usually, BMC approaches reduce the verification problem to propositional satisfiability. With the recent advances in SAT solving, this has proven to be a fast analysis.In this paper we develop a bounded model checking technique for graph transformation systems. Graph transformation systems (GTSs) provide an intuitive, visual way of specifying system models and their structural changes. An analysis of such models – however – remains difficult since GTSs often give rise to infinite state spaces. In our BMC technique we use first-order instead of propositional logic for encoding complex graph structures and rules. Today’s off-the-shelf SMT solvers can then readily be employed for satisfiability solving. The encoding heavily employs the concept of uninterpreted function symbols for representing edge labels. We have proven soundness of the encoding and report on experiments with different case studies.
Fichier principal
Vignette du fichier
978-3-642-38592-6_13_Chapter.pdf (376.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01515236 , version 1 (27-04-2017)





Tobias Isenberg, Dominik Steenken, Heike Wehrheim. Bounded Model Checking of Graph Transformation Systems via SMT Solving. 15th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOOODS) / 33th International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2013, Florence, Italy. pp.178-192, ⟨10.1007/978-3-642-38592-6_13⟩. ⟨hal-01515236⟩
72 View
123 Download



Gmail Facebook X LinkedIn More