As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Process-driven applications (PDAs) rely on a combination of executable process models and code that implements individual process steps. These step implementations rely on process variables that maintain state across process steps and are used to take decisions on alternative execution paths, i. e. they hold data received from and saved to (external) backend systems. As a result, the data flow of a PDA can become complex even if each step implementation is kept simple. Complexity arises from various possibilities for manipulating process variables, in addition to the variety of execution paths that make it difficult to keep track of process variables.We propose a static analysis approach for managing or reducing complexity by limiting the solution space of implementations. It checks assertions on the data flow in PDAs while taking process variables into account. Assertions are specified using our novel data-flow validation language (DFVL). For demonstration, DFVL and automated assertion checking are implemented as part of an open source process application validation tool. The tool facilitates the use of DFVL for automated static analyses in the same way as unit tests are used for software testing. A short evaluation shows the applicability of our approach and tool.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.