Graph-based specification of access control policies
From MaRDI portal
Publication:2486563
Recommendations
- scientific article; zbMATH DE number 2087433
- scientific article; zbMATH DE number 1701357
- Graph transformations for the specification of access control policies
- A graph-based framework for the analysis of access control policies
- Representation and Reasoning on Role-Based Access Control Policies with Conceptual Graphs
Cites work
- scientific article; zbMATH DE number 1701357 (Why is no real title available?)
- scientific article; zbMATH DE number 4049096 (Why is no real title available?)
- scientific article; zbMATH DE number 1231489 (Why is no real title available?)
- scientific article; zbMATH DE number 1739882 (Why is no real title available?)
- scientific article; zbMATH DE number 1504839 (Why is no real title available?)
- scientific article; zbMATH DE number 2087433 (Why is no real title available?)
- scientific article; zbMATH DE number 1437942 (Why is no real title available?)
- A formal model for role-based access control using graph transformation
- Amalgamation of graph transformations: a synchronization mechanism
- Formal software specification with refinements and modules of typed graph transformation systems
- Handbook of Graph Grammars and Computing by Graph Transformation
- The category of typed graph grammars and its adjunctions with categories of derivations
Cited in
(29)- scientific article; zbMATH DE number 2087433 (Why is no real title available?)
- Flexible support for multiple access control policies
- Specifying and Reasoning About Dynamic Access-Control Policies
- A framework for the analysis of access control policies with emergency management
- Graph transformations for the specification of access control policies
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- A navigational logic for reasoning about graph properties
- scientific article; zbMATH DE number 1956494 (Why is no real title available?)
- Resolution-Like Theorem Proving for High-Level Conditions
- scientific article; zbMATH DE number 2016078 (Why is no real title available?)
- Formal specification and validation of security policies
- A formal model for role-based access control using graph transformation
- A graph-based framework for the analysis of access control policies
- Correctness of high-level transformation systems relative to nested conditions
- Graph-theoretic method for merging security system specifications
- Reasoning with graph constraints
- Development of Correct Graph Transformation Systems
- Initial conflicts for transformation rules with nested application conditions
- Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
- Symbolic graphs for attributed graph constraints
- On the Specification and Verification of Model Transformations
- Decidability of safety in graph-based models for access control
- Parallelism and concurrency in adhesive high-level replacement systems with negative application conditions
- Representation and Reasoning on Role-Based Access Control Policies with Conceptual Graphs
- Specification and verification of access control policies in EB\(^{3}\)SEC: work in progress
- Semantic access control model: a formal specification
- Layered graph logic as an assertion language for access control policy models
- High-Level Programs and Program Conditions
- scientific article; zbMATH DE number 1701357 (Why is no real title available?)
This page was built for publication: Graph-based specification of access control policies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486563)