Constraint Branching in Workflow Satisfiability Problem-Reference-Cited by-同舟云学术

Constraint Branching in Workflow Satisfiability Problem

Published:2020-05-28 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 25th ACM Symposium on Access Control Models and Technologies
language:
Short-container-title:

Author:

Gutin Gregory¹,Karapetyan Daniel²

Affiliation:

1. Royal Holloway, University of London, Egham , United Kingdom

2. University of Nottingham, Nottingham, United Kingdom

Funder

The Leverhulme Trust

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3381991.3395600

Reference25 articles.

1. American National Standards Institute. ANSI INCITS 359--2004 for Role Based Access Control 2004. American National Standards Institute. ANSI INCITS 359--2004 for Role Based Access Control 2004.

2. The Sat4j library, release 2.2

3. The specification and enforcement of authorization constraints in workflow management systems

4. Automated Synthesis of Run-time Monitors to Enforce Authorization Policies in Business Processes

5. Solving Multi-Objective Workflow Satisfiability Problems with Optimization Modulo Theories Techniques

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. SATQUBOLIB: A Python Framework for Creating and Benchmarking (Max-)3SAT QUBOs;Communications in Computer and Information Science;2024

2. Solving the Workflow Satisfiability Problem using General Purpose Solvers;IEEE Transactions on Dependable and Secure Computing;2022

3. Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis;ACM Transactions on Privacy and Security;2021-08-31

4. Toward an Ideal Access Control Strategy for Industry 4.0 Manufacturing Systems;IEEE Access;2021