The PROGRES approach: language and environment
Handbook of graph grammars and computing by graph transformation
Proceedings of the 22nd international conference on Software engineering
An axiomatic basis for computer programming
Communications of the ACM
Computational Completeness of Programming Languages Based on Graph Transformation
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Relabelling in Graph Transformation
ICGT '02 Proceedings of the First International Conference on Graph Transformation
A framework for the verification of infinite-state graph transformation systems
Information and Computation
Towards the Verification of Attributed Graph Transformation Systems
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
The Graph Programming Language GP
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Verification of Sequential and Concurrent Programs
Verification of Sequential and Concurrent Programs
Compositional Verification of Architectural Refactorings
Architecting Dependable Systems VI
A hoare calculus for graph programs
ICGT'10 Proceedings of the 5th international conference on Graph transformations
GrGen: a fast SPO-based graph rewriting tool
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Weakest preconditions for high-level programs
ICGT'06 Proceedings of the Third international conference on Graph Transformations
A hoare calculus for graph programs
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Graph transformations for MDE, adaptation, and models at runtime
SFM'12 Proceedings of the 12th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: formal methods for model-driven engineering
Hoare-Style Verification of Graph Programs
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
Verification of graph programs
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
| Hi-index | 0.00 |
We present Hoare-style axiom schemata and inference rules for verifying the partial correctness of programs in the graph programming language GP. The pre- and postconditions of this calculus are the nested conditions of Habel, Pennemann and Rensink, extended with expressions for labels in order to deal with GP's conditional rule schemata and infinite label alphabet. We show that the proof rules are sound with respect to GP's operational semantics.