A simple calculus for program transformation (inclusive of induction)
Science of Computer Programming
A calculus of refinements for program derivations
Acta Informatica
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
An update calculus for expressing type-safe program updates
Science of Computer Programming
Modeling and Verifying Graph Transformations in Proof Assistants
Electronic Notes in Theoretical Computer Science (ENTCS)
Rewriting Logic Semantics and Verification of Model Transformations
FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
The operation recorder: specifying model refactorings by-example
Proceedings of the 24th ACM SIGPLAN conference companion on Object oriented programming systems languages and applications
Verification of architectural refactorings by rule extraction
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
Modelling and analysis using GROOVE
International Journal on Software Tools for Technology Transfer (STTT)
On formalizing EMF modeling operations with graph transformations
ACM SIGSOFT Software Engineering Notes
Hi-index | 0.00 |
Model transformations play an essential role in many aspects of model-driven development. By-demonstration approaches provide a user-friendly tool for specifying reusable model transformations. Here, a modeler performs the model transformation only once by hand and an executable transformation is automatically derived. Such a transformation is characterized by the set of pre- and postconditions that are required to be satisfied prior and after the execution of the transformation. However, the automatically derived conditions are usually too restrictive or incomplete and need to be refined manually to obtain the intended model transformation. As model transformations may be specified improperly despite the use of by-demonstration development approaches, we propose to employ formal verification techniques to detect inconsistent and erroneous transformations. In particular, we conjecture that methods drawn from software model checking and theorem proving might be employed to verify certain correctness properties of model transformations.