Solving multi-objective workflow satisfiability problems with optimization modulo theories techniques

Clara Bertolissi, Daniel R. Dos Santos, Silvio Ranise

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

4 Citations (Scopus)

Abstract

Security-sensitive workflows impose constraints on the controlflow 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.

Original languageEnglish
Title of host publicationSACMAT 2018 - Proceedings of the 23rd ACM Symposium on Access Control Models and Technologies
PublisherAssociation for Computing Machinery, Inc
Pages117-128
Number of pages12
ISBN (Electronic)9781450356664
DOIs
Publication statusPublished - 7 Jun 2018
Event23rd ACM Symposium on Access Control Models and Technologies (SACMAT 2018) - Indianapolis, United States
Duration: 13 Jun 201815 Jun 2018
Conference number: 23
http://www.sacmat.org

Conference

Conference23rd ACM Symposium on Access Control Models and Technologies (SACMAT 2018)
Abbreviated titleSACMAT 2018
CountryUnited States
CityIndianapolis
Period13/06/1815/06/18
Internet address

Keywords

  • Business process
  • Optimization modulo theories
  • Workflow satisfiability

Fingerprint Dive into the research topics of 'Solving multi-objective workflow satisfiability problems with optimization modulo theories techniques'. Together they form a unique fingerprint.

Cite this