Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Bounded Model Checking of Graph Transformation Systems via SMT Solving

Abstract : 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.
Complete list of metadata

Cited literature [31 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, April 27, 2017 - 10:46:43 AM
Last modification on : Thursday, July 26, 2018 - 3:20:05 PM
Long-term archiving on: : Friday, July 28, 2017 - 12:47:30 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views


Files downloads