Verifying Business Rules Using an SMT Solver for BPEL Processes.

Ganna Monakova · Oliver Kopp · Frank Leymann

25 citations0/0 files stored

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Business Process Modeling and Analysis Formal Methods in Verification Service-Oriented Architecture and Web Services

Abstract

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.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 25 citations exist upstream.

References

2003Exception Handling in the BPEL4WS Language 2005Applying model checking to BPEL4WS business collaborations 2008Deriving Explicit Data Links in WS-BPEL Processes

Cited by

2013Enriching Process Models for Business Process Compliance Checking in ERP Environments

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.