Graph grammars with negative application conditions
Fundamenta Informaticae - Special issue on graph transformations
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
Graph-based specification of access control policies
Journal of Computer and System Sciences
Theory of Constraints and Application Conditions: From Graphs to High-Level Structures
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Nested constraints and application conditions for high-level structures
Formal Methods in Software and Systems Modeling
Satisfiability of high-level conditions
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
| Hi-index | 0.00 |
A major goal of this thesis is the ability to determine the correctness of graphical specifications consisting of a graph precondition, a graph program and graph postcondition. According to Dijkstra, the correctness of program specifications can be shown by constructing a weakest precondition of the program relative to the postcondition and checking whether the precondition implies the weakest precondition. With the intention of tool support, we investigate the construction of weakest graph preconditions, consider fragments of graph conditions, for which the implication problem is decidable, and investigate an approximative solution of said problem in the general case. All research is done within the framework of adhesive high-level replacement categories. Therefore, the results will be applicable to different kinds of transformation systems and petri nets.