Solving Multi-Objective Workflow Satisfiability Problems with Optimization Modulo Theories Techniques
| Title | Solving Multi-Objective Workflow Satisfiability Problems with Optimization Modulo Theories Techniques |
| Publication Type | Conference Paper |
| Year of Publication | 2018 |
| Authors | Bertolissi, Clara, dos Santos, Daniel R., Ranise, Silvio |
| Conference Name | Proceedings of the 23Nd ACM on Symposium on Access Control Models and Technologies |
| Publisher | ACM |
| Conference Location | New York, NY, USA |
| ISBN Number | 978-1-4503-5666-4 |
| Keywords | business process, composability, control theory, optimization modulo theories, pubcrawl, resilience, Resiliency, security, workflow satisfiability |
| Abstract | Security-sensitive workflows impose constraints on the control-flow and authorization policies that may lead to unsatisfiable instances. In these cases, it is still possible to find "least bad" executions where costs associated to authorization violations are minimized, solving the so-called Multi-Objective Workflow Satisfiability Problem (MO-WSP). The MO-WSP is inspired by the Valued WSP and its generalization, the Bi-Objective WSP, but our work considers quantitative solutions to the WSP without abstracting control-flow constraints. In this paper, we define variations of the MO-WSP and solve them using bounded model checking and optimization modulo theories solving. We validate our solutions on real-world workflows and show their scalability on synthetic instances. |
| URL | https://dl.acm.org/citation.cfm?doid=3205977.3205982 |
| DOI | 10.1145/3205977.3205982 |
| Citation Key | bertolissi_solving_2018 |