Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Term rewriting and all that
Deriving productions from productions with an application to Picasso's œuvre
Handbook of graph grammars and computing by graph transformation
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
Introduction to the Algebraic Theory of Graph Grammars (A Survey)
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Graph-based specification of access control policies
Journal of Computer and System Sciences
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Theory of Constraints and Application Conditions: From Graphs to High-Level Structures
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Electronic Notes in Theoretical Computer Science (ENTCS)
Correctness of high-level transformation systems relative to nested conditions†
Mathematical Structures in Computer Science
A New Version of GTXL: An Exchange Format for Graph Transformation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Nested quantification in graph transformation rules
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
Confluence of graph transformation revisited
Processes, Terms and Cycles
Workflow-driven tool integration using model transformations
Graph transformations and model-driven engineering
| Hi-index | 0.00 |
High-level conditions are well-suited for expressing structural properties. They can describe the precondition and the postcondition for a high-level program, but they cannot describe the relationship between the input and the output of a program derivation. Therefore, we investigate program conditions, a generalized type of conditions expressing properties on program derivations. Program conditions look like nested rules with application conditions. We present a normal form result, a suitable graphical notation, and conditions under which a satisfying program can be constructed from a program condition. We define a sequential composition on program conditions and show that, for a suitable type of program conditions with a complete dependence relation we have that: Whenever the original programs satisfy the original program conditions, then the composed program satisfies the composed program condition.