Information and Computation
Algebraic approach to single-pushout graph transformation
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Role-Based Access Control Models
Computer
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation
Protection in operating systems
Communications of the ACM
A Formal Model for Role-Based Access Control Using Graph Transformation
ESORICS '00 Proceedings of the 6th European Symposium on Research in Computer Security
Graph Rewriting in Some Categories of Partial Morphisms
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
A Uniform Approach to Graph Rewriting: The Pullback Approach
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
Role-Based Access Control
Double-pushout graph transformation revisited
Mathematical Structures in Computer Science
Graph-grammars: An algebraic approach
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Graph Transformation Units --- An Overview
Concurrency, Graphs and Models
Shaped Generic Graph Transformation
Applications of Graph Transformations with Industrial Relevance
Transformation of Type Graphs with Inheritance for Ensuring Security in E-Government Networks
FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
A Heterogeneous Pushout Approach to Term-Graph Transformation
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Graph rewriting in span-categories
ICGT'10 Proceedings of the 5th international conference on Graph transformations
How to delete categorically - Two pushout complement constructions
Journal of Symbolic Computation
A lattice-theoretical perspective on adhesive categories
Journal of Symbolic Computation
Refactoring information systems: association folding and unfolding
ACM SIGSOFT Software Engineering Notes
Transforming provenance using redaction
Proceedings of the 16th ACM symposium on Access control models and technologies
Model transformation and induced instance migration: a universal framework
SBMF'11 Proceedings of the 14th Brazilian conference on Formal Methods: foundations and Applications
An institution for graph transformation
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
Composition of model transformations: a categorical framework
SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
Refined graph rewriting in span-categories: a framework for algebraic graph transformation
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Graph transformation with focus on incident edges
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Pattern graphs and rule-based models: the semantics of kappa
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
A declarative and bidirectional model transformation approach based on graph co-spans
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |
Sesqui-pushout (SqPO) rewriting—“sesqui” means “one and a half” in Latin—is a new algebraic approach to abstract rewriting in any category. SqPO rewriting is a deterministic and conservative extension of double-pushout (dpo) rewriting, which allows to model “deletion in unknown context”, a typical feature of single-pushout (spo) rewriting, as well as cloning. After illustrating the expressiveness of the proposed approach through a case study modelling an access control system, we discuss sufficient conditions for the existence of final pullback complements and we analyze the relationship between SqPO and the classical dpo and spo approaches.