The algorithmic beauty of plants
The algorithmic beauty of plants
Design patterns: elements of reusable object-oriented software
Design patterns: elements of reusable object-oriented software
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
Formal refinement patterns for goal-driven requirements elaboration
SIGSOFT '96 Proceedings of the 4th ACM SIGSOFT symposium on Foundations of software engineering
Objects, components, and frameworks with UML: the catalysis approach
Objects, components, and frameworks with UML: the catalysis approach
Patterns in property specifications for finite-state verification
Proceedings of the 21st international conference on Software engineering
The denotational semantics of programming languages
Communications of the ACM
ZUM '97 Proceedings of the 10th International Conference of Z Users on The Z Formal Specification Notation
Patterns to guide practical refactoring: examples targetting promotion in Z
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Frameworks Based on Templates for Rigorous Model-driven Development
Electronic Notes in Theoretical Computer Science (ENTCS)
Autonomous Objects and Bottom-Up Composition in ZOO Applied to a Case Study of Biological Reactivity
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Formal Definition of MOF 2.0 Metamodel Components and Composition
MoDELS '08 Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems
Automated Formalisation for Verification of Diagrammatic Models
Electronic Notes in Theoretical Computer Science (ENTCS)
Platform-Variant Applications from Platform-Independent Models via Templates
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards formally templated relational database representations in z
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
| Hi-index | 0.00 |
Design patterns are usually described in terms of instances. Templates describe sentences of some language with a particular form, generate sentences upon instantiation, and can be used to describe those commonly occurring structures that make a pattern. This paper presents FTL, a language to express templates, and an approach to proof with templates. This enables reuse at the level of formal modelling and verification: patterns of models are captured once and their structure is explored for proof, so that patterns instances can be generated mechanically and proved results related with the pattern can be reused in any context. The paper uses templates to capture the Z promotion pattern and metaproof to prove properties of Z promotion. The proved properties are applicable directly to Z promotions built by template instantiation.