Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
The model transformation language of the VIATRA2 framework
Science of Computer Programming
Modeling and Verifying Graph Transformations in Proof Assistants
Electronic Notes in Theoretical Computer Science (ENTCS)
Augur 2 --- A New Version of a Tool for the Analysis of Graph Transformation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A framework for the verification of infinite-state graph transformation systems
Information and Computation
Resolution-Like Theorem Proving for High-Level Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Correctness of high-level transformation systems relative to nested conditions†
Mathematical Structures in Computer Science
Formal Verification of Graph Grammars using Mathematical Induction
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards Automated, Formal Verification of Model Transformations
ICST '10 Proceedings of the 2010 Third International Conference on Software Testing, Verification and Validation
Data structure specifications via local equality axioms
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
A decidable fragment of separation logic
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
This paper explores how to reason locally about global properties of graph transformations, in particular properties involving transitive closure of the edge relations of the graph. We show under which conditions we can soundly reduce reasoning about all nodes in the graph to reasoning about a finite set of nodes. We then give an effective procedure to turn this reduced problem into a Boolean satisfiability problem.