Correctness of high-level transformation systems relative to nested conditions

From MaRDI portal
Publication:3625675

DOI10.1017/S0960129508007202zbMath1168.68022OpenAlexW2079370090MaRDI QIDQ3625675

Karl-Heinz Pennemann, Annegret Habel

Publication date: 6 May 2009

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129508007202




Related Items (62)

Theorem proving graph grammars with attributes and negative application conditionsEnsuring Correctness of Model Transformations While Remaining DecidablePreserving consistency in geometric modeling with graph transformationsOn the Specification and Verification of Model TransformationsOn the Operationalization of Graph Queries with Generalized Discrimination NetworksAmalgamation of domain specific languages with behaviourSatisfiability of Constraint Specifications on XML DocumentsPresenting basic graph logicInteractive and automated proofs for graph transformationsTranslating Essential OCL Invariants to Nested Graph Constraints Focusing on Set OperationsInductive Invariant Checking with Partial Negative Application ConditionsConstructing constraint-preserving interaction schemes in adhesive categoriesInitial Conflicts for Transformation Rules with Nested Application ConditionsRewriting Theory for the Life Sciences: A Unifying Theory of CTMC SemanticsGraph Parsing as Graph TransformationGraph Consistency as a Graduated PropertyFormal Verification of Invariants for Attributed Graph Transformation Systems Based on Nested Attributed Graph ConditionsOptimistic and Pessimistic On-the-fly Analysis for Metric Temporal Graph LogicA Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in JavaA strict constrained superposition calculus for graphsDouble-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphsHost-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditionsBounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logicSymbolic graphs for attributed graph constraintsA simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivityUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemHigh-Level Programs and Program ConditionsResolution-Like Theorem Proving for High-Level ConditionsDevelopment of Correct Graph Transformation SystemsAn Algorithm for Approximating the Satisfiability Problem of High-level ConditionsA navigational logic for reasoning about graph propertiesFinitary -adhesive categoriesMulti-amalgamation of rules with application conditions in -adhesive categories-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamationFormal analysis of model transformations based on triple graph grammarsAnalysis of permutation equivalence in -adhesive transformation systems with negative application conditionsReasoning with graph constraintsEvaluation diversity for graph conditionsParallel Independence of Amalgamated Graph Transformations Applied to Model TransformationInstitutions for navigational logics for graphical structuresSingle pushout rewriting in comprehensive systems of graph-like structuresTransformation rules with nested application conditions: critical pairs, initial conflicts \& minimalityRewriting theory for the life sciences: a unifying theory of CTMC semanticsComprehensive systems: a formal foundation for multi-model consistency managementSchema compliant consistency management via triple graph grammars and integer linear programmingConstructing optimized constraint-preserving application conditions for model transformation rulesA generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applicationsMonadic second-order incorrectness logic for GP 2A generalized concurrent rule construction for double-pushout rewritingIncorrectness logic for graph programsEvaluation diversity for graph conditionsRule-based top-down parsing for acyclic contextual hyperedge replacement grammarsVerifying graph programs with monadic second-order logic



Cites Work




This page was built for publication: Correctness of high-level transformation systems relative to nested conditions