Three logics for branching bisimulation
Journal of the ACM (JACM)
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Software/Hardware Engineering with the Parallel Object-Oriented Specification Language
MEMOCODE '07 Proceedings of the 5th IEEE/ACM International Conference on Formal Methods and Models for Codesign
Transforming Process Algebra Models into UML State Machines: Bridging a Semantic Gap?
ICMT '08 Proceedings of the 1st international conference on Theory and Practice of Model Transformations
Semantical Correctness and Completeness of Model Transformations Using Graph and Rule Transformation
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
On the correctness of model transformations in the development of embedded systems
Proceedings of the 13th Monterey conference on Composition of embedded systems: scientific and industrial issues
An exercise in iterative domain-specific language design
Proceedings of the Joint ERCIM Workshop on Software Evolution (EVOL) and International Workshop on Principles of Software Evolution (IWPSE)
Showing full semantics preservation in model transformation: a comparison of techniques
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
ICSTW '11 Proceedings of the 2011 IEEE Fourth International Conference on Software Testing, Verification and Validation Workshops
Completeness-driven development
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Incremental formal verification for model refining
Proceedings of the Workshop on Model-Driven Engineering, Verification and Validation
Hi-index | 0.00 |
Correctness of model transformations is a prerequisite for generating correct implementations from models. Given refining model transformations that preserve desirable properties, models can be transformed into correct-by-construction implementations. However, proving that model transformations preserve properties is far from trivial. Therefore, we aim for simple correctness proofs by designing model transformations that are as fine-grained as possible. Furthermore, we advocate the reuse of model transformations to reduce the number of proofs. For a simple domain-specific language, SLCO, we define a formal framework to reason about the correctness, reusability, and composition of the fine-grained model transformations used to transform a given model to three target languages: NQC, Promela and POOSL. The correctness criterion induces that the original model and the resulting model obtained after a proper sequence of transformations have the same observable behavior.