Predicate calculus and program semantics
Predicate calculus and program semantics
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Termination of graph rewriting is undecidable
Fundamenta Informaticae
Bounded Model Checking Using Satisfiability Solving
Formal Methods in System Design
A Discipline of Programming
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
Approximating the Behaviour of Graph Transformation Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Graph-based specification of access control policies
Journal of Computer and System Sciences
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation
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
Verifying Object-Based Graph Grammars
Electronic Notes in Theoretical Computer Science (ENTCS)
A logic for analyzing abstractions of graph transformation systems
SAS'03 Proceedings of the 10th international conference on Static analysis
Termination criteria for model transformation
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
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
Counterexample-Guided abstraction refinement for the analysis of graph transformation systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
Electronic Notes in Theoretical Computer Science (ENTCS)
High-Level Programs and Program Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Resolution-Like Theorem Proving for High-Level Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Development of Correct Graph Transformation Systems
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Application of Graph Transformation in Verification of Dynamic Systems
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Correctness of high-level transformation systems relative to nested conditions†
Mathematical Structures in Computer Science
A hoare calculus for graph programs
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Correctness of graph programs relative to HR+ conditions
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Satisfiability of high-level conditions
ICGT'06 Proceedings of the Third 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
Knowledge-Based graph exploration analysis
AGTIVE'11 Proceedings of the 4th international conference on Applications of Graph Transformations with Industrial Relevance
Verification of graph programs
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
| Hi-index | 0.00 |
In proof theory, a standard method for showing the correctness of a program w.r.t. given pre- and postconditions is to construct a weakest precondition and to show that the precondition implies the weakest precondition. In this paper, graph programs in the sense of Habel and Plump 2001 are extended to programs over high-level rules with application conditions, a formal definition of weakest preconditions for high-level programs in the sense of Dijkstra 1975 is given, and a construction of weakest preconditions is presented.