Calders, Toon and Dekeyser, Stijn and Hidders, Jan and Paredaens, Jan (2006) Analyzing workflows implied by instance-dependent access rules. In: 2006 ACM SIGMOD/PODS Conference, 26-29 June 2006, Chicago, Illinois.
PDF (Accepted Version)
Recently proposed form-based web information systems liberate the capture and reuse of data in organizations by substituting the development of technical implementations of electronic forms for the conceptual modelling of forms' tree-structured schemas and their data access rules. Significantly, these instance-dependent rules also imply a workflow process associated to a form, eliminating the need for a costly workflow design phase. Instead, the workflows thus created in an ad hoc manner by unsophisticated end-users can be automatically analyzed, and incorrect forms rejected. This paper examines fundamental correctness properties of workflows that are implied by instance-dependent access rules. Specifically, we study the decidability of the form completability property and the semi-soundness of a form's workflow. These problems are affected by a choice of constraints on the path language used to express access rules and completion formulas, and on the depth of the form's schema tree. Hence, we study these problems by examining them in the context of several different fragments determined by such constraints.
|Item Type:||Conference or Workshop Item (Commonwealth Reporting Category E) (Paper)|
|Additional Information:||PODS'06, June 26-28, 2006, Chicago, Illinois, USA. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in PODS'06, http://tangra.si.umich.edu/clair/sigmod-pods06/|
|Uncontrolled Keywords:||instance-dependent access rules, workflows|
|Subjects:||230000 Mathematical Sciences|
|Depositing User:||epEditor USQ|
|Date Deposited:||11 Oct 2007 00:27|
|Last Modified:||02 Jul 2013 22:33|
Actions (login required)
|Archive Repository Staff Only|