activity
20122021
most citedAlgorithms for the workflow satisfiability problem engineered for counting constraints

19 citations · 23 across the 9 of their papers we have counts for

collaborators
Showing cs.DSShow all

5 papers · 1 filter

cs.DS2021

Valued Authorization Policy Existence Problem: Theory and Experiments

Jason Crampton, Eduard Eiben, Gregory Gutin +2

Recent work has shown that many problems of satisfiability and resiliency in workflows may be viewed as special cases of the authorization policy existence problem (APEP), which re…

cs.DS2019

Bounded and Approximate Strong Satisfiability in Workflows

Jason Crampton, Gregory Gutin, Diptapriyo Majumdar

There has been a considerable amount of interest in recent years in the problem of workflow satisfiability, which asks whether the existence of constraints in a workflow specificat…

cs.DS2016

A Multivariate Approach for Checking Resiliency in Access Control

Jason Crampton, Gregory Gutin, Rémi Watrigant

In recent years, several combinatorial problems were introduced in the area of access control. Typically, such problems deal with an authorization policy, seen as a relation $UR \s…

cs.DS201519 cited

Algorithms for the workflow satisfiability problem engineered for counting constraints

D. Cohen, J. Crampton, A. Gagarin +2

The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification that satisfies the constraints in the…

cs.DS2013

Constraint Expressions and Workflow Satisfiability

Jason Crampton, Gregory Gutin

A workflow specification defines a set of steps and the order in which those steps must be executed. Security requirements and business rules may impose constraints on which users…