Ensuring Correctness of Model Transformations While Remaining Decidable
DOI10.1007/978-3-319-46750-4_18zbMath1482.68085OpenAlexW2523485023MaRDI QIDQ3179408
Rachid Echahed, Martin Strecker, Jon Haël Brenas
Publication date: 21 December 2016
Published in: Theoretical Aspects of Computing – ICTAC 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-46750-4_18
Knowledge representation (68T30) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- Deciding effectively propositional logic using DPLL and substitution sets
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Hybrid logics: characterization, interpolation and complexity
- Dafny: An Automatic Program Verifier for Functional Correctness
- Verifying Monadic Second-Order Properties of Graph Programs
- Inductively Sequential Term-Graph Rewrite Systems
- Sesqui-Pushout Rewriting
- On the Use of Alloy to Analyze Graph Transformation Systems
- Correctness of high-level transformation systems relative to nested conditions
- Managing Change in Graph-Structured Data Using Description Logics
- A Dynamic Logic for Termgraph Rewriting
- A Hoare Calculus for Graph Programs
- The classical decision problem.
- Unnamed Item
- Unnamed Item
This page was built for publication: Ensuring Correctness of Model Transformations While Remaining Decidable
