Artikel in Tagungsband INPROC-2009-33

Monakova, Ganna; Kopp, Oliver; Leymann, Frank; Moser, Simon; Schäfers, Klaus: Verifying Business Rules Using an SMT Solver for BPEL Processes.
In: Proceedings of the Business Process and Services Computing Conference: BPSC'09.
Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik.
Lecture Notes in Informatics, englisch.
Gesellschaft für Informatik e.V. (GI), März 2009.
ISBN: 978-3-88579-241-3.
Artikel in Tagungsband (Konferenz-Beitrag).
CR-Klassif.H.4.1 (Office Automation)
Keywordsconstraint verification

WS-BPEL is the standard for modelling executable business processes. Recently, verification of BPEL processes has been an important topic in the research community. While most of the existing approaches for BPEL process verification merely consider control-flow based analysis, some actually consider data-flows, but only in a very restrictive manner. In this paper, we present a novel approach that combines control-flow analysis and data-flow analysis, producing a logical representation of a process model. This logical representation captures the relations between process variables and execution paths that allow properties to be verified using Satisfiability Modulo Theory (SMT) solvers under constraints represented by the modelled assertions.

Volltext und
andere Links
BPSC 2009
Abteilung(en)Universität Stuttgart, Institut für Architektur von Anwendungssystemen
Eingabedatum19. März 2009
   Publ. Institut   Publ. Informatik