An illustrated mathematical foundation for ERA
The unified computation laboratory
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Functorial theory of parameterized specifications in a general specification framework
Theoretical Computer Science
Category theory for computing science, 2nd ed.
Category theory for computing science, 2nd ed.
A vision for management of complex models
ACM SIGMOD Record
Data Models
Visualization vs. Specification in Diagrammatic Notations: A Case Study with the UML
DIAGRAMS '02 Proceedings of the Second International Conference on Diagrammatic Representation and Inference
Unified Modeling Language Reference Manual, The (2nd Edition)
Unified Modeling Language Reference Manual, The (2nd Edition)
Model-Driven Development: Its Essence and Opportunities
ISORC '06 Proceedings of the Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing
Model synchronization: mappings, tiles, and categories
GTTSE'09 Proceedings of the 3rd international summer school conference on Generative and transformational techniques in software engineering III
Model transformation and induced instance migration: a universal framework
SBMF'11 Proceedings of the 14th Brazilian conference on Formal Methods: foundations and Applications
A graph transformation-based semantics for deep metamodelling
AGTIVE'11 Proceedings of the 4th international conference on Applications of Graph Transformations with Industrial Relevance
Hi-index | 0.00 |
Formal generalized sketches is a graph-based specification format that borrows its main ideas from categorical and ordinary first-order logic, and adapts them to software engineering needs. In the engineering jargon, it is a modeling language design pattern that combines mathematical rigor and appealing graphical appearance. The paper presents a careful motivation and justification of the applicability of generalized sketches for formalizing practical modeling notations. We extend the sketch formalism by dependencies between predicate symbols and develop new semantic notions based on the Instances-as-typed-structures idea. We show that this new framework fits in the general patterns of the institution theory and is well amenable to algebraic manipulations.