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

Clara Bertolissi; Daniel R. Dos Santos; Silvio Ranise

doi:10.1145/3205977.3205982

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

Clara Bertolissi
, Daniel R. Dos Santos
, Silvio Ranise

Security

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

11 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 language	English
Title of host publication	SACMAT 2018 - Proceedings of the 23rd ACM Symposium on Access Control Models and Technologies
Publisher	Association for Computing Machinery, Inc.
Pages	117-128
Number of pages	12
ISBN (Electronic)	9781450356664
DOIs	https://doi.org/10.1145/3205977.3205982
Publication status	Published - 7 Jun 2018
Event	23rd ACM Symposium on Access Control Models and Technologies (SACMAT 2018) - Indianapolis, United States Duration: 13 Jun 2018 → 15 Jun 2018 Conference number: 23 http://www.sacmat.org

Conference

Conference	23rd ACM Symposium on Access Control Models and Technologies (SACMAT 2018)
Abbreviated title	SACMAT 2018
Country/Territory	United States
City	Indianapolis
Period	13/06/18 → 15/06/18
Internet address	http://www.sacmat.org

Keywords

Business process
Optimization modulo theories
Workflow satisfiability

Access to Document

10.1145/3205977.3205982

Cite this

@inproceedings{ccc1319661f14dc8bca80f7b1a658a68,

title = "Solving multi-objective workflow satisfiability problems with optimization modulo theories techniques",

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.",

keywords = "Business process, Optimization modulo theories, Workflow satisfiability",

author = "Clara Bertolissi and \{Dos Santos\}, \{Daniel R.\} and Silvio Ranise",

year = "2018",

month = jun,

day = "7",

doi = "10.1145/3205977.3205982",

language = "English",

pages = "117--128",

booktitle = "SACMAT 2018 - Proceedings of the 23rd ACM Symposium on Access Control Models and Technologies",

publisher = "Association for Computing Machinery, Inc.",

address = "United States",

note = "23rd ACM Symposium on Access Control Models and Technologies (SACMAT 2018), SACMAT 2018 ; Conference date: 13-06-2018 Through 15-06-2018",

url = "http://www.sacmat.org",

}

Bertolissi, C, Dos Santos, DR & Ranise, S 2018, Solving multi-objective workflow satisfiability problems with optimization modulo theories techniques. in SACMAT 2018 - Proceedings of the 23rd ACM Symposium on Access Control Models and Technologies. Association for Computing Machinery, Inc., pp. 117-128, 23rd ACM Symposium on Access Control Models and Technologies (SACMAT 2018), Indianapolis, Indiana, United States, 13/06/18. https://doi.org/10.1145/3205977.3205982

Solving multi-objective workflow satisfiability problems with optimization modulo theories techniques. / Bertolissi, Clara; Dos Santos, Daniel R.; Ranise, Silvio.
SACMAT 2018 - Proceedings of the 23rd ACM Symposium on Access Control Models and Technologies. Association for Computing Machinery, Inc., 2018. p. 117-128.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

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

AU - Bertolissi, Clara

AU - Dos Santos, Daniel R.

AU - Ranise, Silvio

N1 - Conference code: 23

PY - 2018/6/7

Y1 - 2018/6/7

N2 - 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.

AB - 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.

KW - Business process

KW - Optimization modulo theories

KW - Workflow satisfiability

UR - https://www.scopus.com/pages/publications/85049332725

U2 - 10.1145/3205977.3205982

DO - 10.1145/3205977.3205982

M3 - Conference contribution

AN - SCOPUS:85049332725

SP - 117

EP - 128

BT - SACMAT 2018 - Proceedings of the 23rd ACM Symposium on Access Control Models and Technologies

PB - Association for Computing Machinery, Inc.

T2 - 23rd ACM Symposium on Access Control Models and Technologies (SACMAT 2018)

Y2 - 13 June 2018 through 15 June 2018

ER -

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

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this