A data-dependent process (DDP) models an application who- se control flow is guided by a finite state machine, as well as by the state of an underlying database. DDPs are com- monly found e.g., in e-commerce. In this paper we develop a framework supporting the use of provenance in static (tem- poral) analysis of possible DDP executions. Using prove- nance support, analysts can interactively test and explore the e↵ect of hypothetical modifications to a DDP’s state machine and/or to the underlying database. They can also extend the analysis to incorporate the propagation of anno- tations from meta-domains of interest, e.g., cost or access privileges.
Toward this goal we note that the framework of semiring- based provenance was proven highly e↵ective in fulfilling similar needs in the context of database queries. In this paper we consider novel constructions that generalize the semiring approach to the context of DDP analysis. These constructions address two interacting new challenges: (1) to combine provenance annotations for both information that resides in the database and information about external in- puts (e.g., user choices), and (2) to finitely capture infinite process executions. We analyze our solution from theoretical and experimental perspectives, proving its e↵ectiveness.
