Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
PX: a computational logic
ACM Transactions on Programming Languages and Systems (TOPLAS)
Synthesis of ML programs in the system Coq
Journal of Symbolic Computation - Special issue on automatic programming
Infinite objects in type theory
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
IEEE Transactions on Software Engineering
A Theory of Objects
Java Program Verification via a Hoare Logic with Abrupt Termination
FASE '00 Proceedings of the Third Internationsl Conference on Fundamental Approaches to Software Engineering: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Coq and Hardware Verification: A Case Study
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Adapting Proofs-as-Programs: The Curry-Howard Protocol (Monographs in Computer Science)
Adapting Proofs-as-Programs: The Curry-Howard Protocol (Monographs in Computer Science)
The meta-object facility typed
Proceedings of the 2006 ACM symposium on Applied computing
Separation of Concerns and Consistent Integration in Requirements Modelling
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Proofs-as-Model-Transformations
ICMT '08 Proceedings of the 1st international conference on Theory and Practice of Model Transformations
ICMT '09 Proceedings of the 2nd International Conference on Theory and Practice of Model Transformations
Correct-by-construction model transformations from partially ordered specifications in Coq
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
A type-theoretic framework for certified model transformations
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
A formalisation of constraint-aware model transformations
FASE'10 Proceedings of the 13th international conference on Fundamental Approaches to Software Engineering
Typing artifacts in megamodeling
Software and Systems Modeling (SoSyM)
Hi-index | 0.00 |
The Object Managment Group's Meta-Object Facility (MOF) [19] is a semiformal approach to writing models and metamodels (models of models). It works according to a model/metamodel hierarchy, where software is specified by models, models are defined as instances of metamodels, which are, in turn, defined as instances of the MOF meta-metamodel. By writing models and metamodels in a common framework, the MOF meta-metamodel, it is easier to perform systematic model/metamodel interchange and integration. However, the approach is only useful if metamodels are correctly specified – a single error in a metamodel specification will result in the propagation of errors throughout instantiating models and final model implementations. An important open question is how to develop provably correct metamodels. This paper applies constructive type theory to formalize the MOF metamodelling approach. The benefit of the formalization is that correct typing corresponds to provably correct metamodels and models. Because the MOF is the central technology behind the Model Driven Architecture initiative [18], our work is intended to lay a formal foundation for making Model Driven Architecture more trustworthy.