High-Level Programs and Program Conditions
From MaRDI portal
Recommendations
Cites work
- Correctness of high-level transformation systems relative to nested conditions
- Double-pullback transitions and coalgebraic loose semantics for graph transformation systems
- Fundamental theory for typed attributed graphs and graph transformation based on adhesive HLR categories
- Graph-based specification of access control policies
- High-Level Programs and Program Conditions
- scientific article; zbMATH DE number 1701353 (Why is no real title available?)
- scientific article; zbMATH DE number 1231489 (Why is no real title available?)
- scientific article; zbMATH DE number 1765704 (Why is no real title available?)
- Nested Quantification in Graph Transformation Rules
- Parallelism and concurrency in adhesive high-level replacement systems with negative application conditions
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Pushout-Properties: An analysis of gluing constructions for graphs
- Theory of constraints and application conditions: from graphs to high-level structures
- Weakest Preconditions for High-Level Programs
This page was built for publication: High-Level Programs and Program Conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540400)