The existence of refinement mappings
Theoretical Computer Science
On the computational complexity of dynamic graph problems
Theoretical Computer Science
Model checking
The B Language and Method: A Guide to Practical Formal Development
The B Language and Method: A Guide to Practical Formal Development
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Incremental Model Checking in the Modal Mu-Calculus
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Incremental methods for formal verification and logic synthesis
Incremental methods for formal verification and logic synthesis
Model-Driven Software Development
Model-Driven Software Development
Towards Verifying Model Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
Graph-grammars: An algebraic approach
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Branching Bisimilarity with Explicit Divergence
Fundamenta Informaticae
CTL-Property Transformations Along an Incremental Design Process
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient Detection of Conflicts in Graph-based Model Transformation
Electronic Notes in Theoretical Computer Science (ENTCS)
Graph Transformation in a Nutshell
Electronic Notes in Theoretical Computer Science (ENTCS)
An incremental bisimulation algorithm
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
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
Showing full semantics preservation in model transformation: a comparison of techniques
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
CADP 2010: a toolbox for the construction and analysis of distributed processes
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Property-dependent reductions for the modal Mu-calculus
Proceedings of the 18th international SPIN conference on Model checking software
Graph transformation in constant time
ICGT'06 Proceedings of the Third international conference on Graph Transformations
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Hi-index | 0.00 |
In model-driven software development, models and model refinements are used to create software. To automatically generate correct software from abstract models by means of model refinement, desirable properties of the initial models must be preserved. We propose an explicit-state model checking technique to determine whether refinements are property preserving. We use networks of labelled transition systems (LTSs) to represent models with concurrent components, and formalise refinements as systems of LTS transformation rules. Property preservation checking involves determining how a rule system relates to an input network, and checking bisimilarity between behaviour subjected to transformation and the corresponding behaviour after transformation. In this way, one avoids generating the entire LTS of the new model. Experimental results demonstrate speedups of several orders of magnitude.