Pages that link to "Item:Q3625675"
From MaRDI portal
The following pages link to Correctness of high-level transformation systems relative to nested conditions (Q3625675):
Displaying 50 items.
- Amalgamation of domain specific languages with behaviour (Q347380) (← links)
- Symbolic graphs for attributed graph constraints (Q631573) (← links)
- Institutions for navigational logics for graphical structures (Q724928) (← links)
- Constructing optimized constraint-preserving application conditions for model transformation rules (Q780069) (← links)
- Reasoning with graph constraints (Q973044) (← links)
- A navigational logic for reasoning about graph properties (Q1996850) (← links)
- Single pushout rewriting in comprehensive systems of graph-like structures (Q2049985) (← links)
- Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality (Q2049986) (← links)
- Rewriting theory for the life sciences: a unifying theory of CTMC semantics (Q2049987) (← links)
- Comprehensive systems: a formal foundation for multi-model consistency management (Q2065549) (← links)
- Schema compliant consistency management via triple graph grammars and integer linear programming (Q2065551) (← links)
- A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications (Q2096426) (← links)
- Monadic second-order incorrectness logic for GP 2 (Q2096431) (← links)
- A generalized concurrent rule construction for double-pushout rewriting (Q2117256) (← links)
- Incorrectness logic for graph programs (Q2117260) (← links)
- Evaluation diversity for graph conditions (Q2117262) (← links)
- Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars (Q2117263) (← links)
- Verifying graph programs with monadic second-order logic (Q2117269) (← links)
- Constructing constraint-preserving interaction schemes in adhesive categories (Q2185892) (← links)
- Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs (Q2192461) (← links)
- Theorem proving graph grammars with attributes and negative application conditions (Q2358623) (← links)
- Presenting basic graph logic (Q2671594) (← links)
- Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions (Q2683030) (← links)
- Satisfiability of Constraint Specifications on XML Documents (Q2945725) (← links)
- Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations (Q2947219) (← links)
- Inductive Invariant Checking with Partial Negative Application Conditions (Q2947222) (← links)
- Parallel Independence of Amalgamated Graph Transformations Applied to Model Transformation (Q3059710) (← links)
- Ensuring Correctness of Model Transformations While Remaining Decidable (Q3179408) (← links)
- On the Specification and Verification of Model Transformations (Q3184747) (← links)
- On the Operationalization of Graph Queries with Generalized Discrimination Networks (Q3187810) (← links)
- High-Level Programs and Program Conditions (Q3540400) (← links)
- Resolution-Like Theorem Proving for High-Level Conditions (Q3540406) (← links)
- Development of Correct Graph Transformation Systems (Q3540429) (← links)
- Interactive and automated proofs for graph transformations (Q4585009) (← links)
- (Q5020535) (← links)
- (Q5020951) (← links)
- (Q5021217) (← links)
- (Q5021219) (← links)
- (Q5021222) (← links)
- (Q5021224) (← links)
- (Q5021228) (← links)
- (Q5021230) (← links)
- (Q5028460) (← links)
- Preserving consistency in geometric modeling with graph transformations (Q5059141) (← links)
- Initial Conflicts for Transformation Rules with Nested Application Conditions (Q5100729) (← links)
- Rewriting Theory for the Life Sciences: A Unifying Theory of CTMC Semantics (Q5100733) (← links)
- Graph Parsing as Graph Transformation (Q5100735) (← links)
- Graph Consistency as a Graduated Property (Q5100736) (← links)
- Formal Verification of Invariants for Attributed Graph Transformation Systems Based on Nested Attributed Graph Conditions (Q5100737) (← links)
- Optimistic and Pessimistic On-the-fly Analysis for Metric Temporal Graph Logic (Q5100739) (← links)