Academic Journal

Verifying Business Rules Using an SMT Solver for BPEL Processes

التفاصيل البيبلوغرافية
العنوان: Verifying Business Rules Using an SMT Solver for BPEL Processes
المؤلفون: Ganna Monakova, Oliver Kopp, Frank Leymann, Simon Moser, Klaus Schäfers
المساهمون: The Pennsylvania State University CiteSeerX Archives
المصدر: http://subs.emis.de/LNI/Proceedings/Proceedings147/gi-proc-147-005.pdf.
سنة النشر: 2009
المجموعة: CiteSeerX
الوصف: 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 BPELprocessverification merely consider control-flow based analysis, some actually consider data-flows, but only in avery restrictive manner. In this paper, we present anovel approach that combines control-flow analysis and data-flow analysis, producing alogical representation of aprocess model. This logical representation captures the relations between process variables and execution paths that allow properties to be verified using Satisfiability Modulo Theory (SMT) solversunder constraints represented by the modelled assertions.
نوع الوثيقة: text
وصف الملف: application/pdf
اللغة: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.6795; http://subs.emis.de/LNI/Proceedings/Proceedings147/gi-proc-147-005.pdf
الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.6795
http://subs.emis.de/LNI/Proceedings/Proceedings147/gi-proc-147-005.pdf
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
رقم الانضمام: edsbas.726A973
قاعدة البيانات: BASE