Verifying BPEL-like programs with Hoare logic

Luo, Chenguang; Qin, Shengchao; Qiu, Zongyan

doi:10.1007/s11704-008-0039-2

Cited by 10 publications

(7 citation statements)

References 15 publications

(16 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It would be interesting to see if probability can be added into the recently proposed web services and web transaction models [13,14,30,31]. It will also be interesting to see if probability can be taken into account when reasoning about business processes [15]. In order to consider the proof of T 1 ≈ T 2 , let (1) x = p 1 /( p 1 + p 2 − p 1 × p 2 ), y = p 1 + p 2 − p 1 × p 2 (2) Σ denotes the set containing all the states.…”

Section: Resultsmentioning

confidence: 99%

PTSC: probability, time and shared-variable concurrency

Zhu

Qin

et al. 2009

Innovations Syst Softw Eng

Self Cite

View full text Add to dashboard Cite

Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formalize languages comprising all these features. In this paper, we integrate probability, time and concurrency in one single model, where the concurrency feature is modelled using shared-variable-based communication. The probability feature is represented by a probabilistic nondeterministic choice, probabilistic guarded choice and a probabilistic version of parallel composition. We formalize an operational semantics for such an integration. Based on this model we define a bisimulation relation, from which an observational equivalence between probabilistic programs is investigated and a collection of algebraic laws are explored. We also implement a prototype of the operational semantics to animate the execution of probabilistic programs.A preliminary version of this paper appeared in SEW-30: 30th IEEE/NASA Software Engineering Workshop [29].

show abstract

Section: Resultsmentioning

confidence: 99%

PTSC: probability, time and shared-variable concurrency

Zhu

Qin

et al. 2009

Innovations Syst Softw Eng

Self Cite

View full text Add to dashboard Cite

show abstract

“…A detailed proof for this example can be found in the technical report [12] in a strict backward manner of verification.…”

Section: Examplementioning

confidence: 93%

“…Due to space limitation, we omit the proof here. A detailed proof can be found in our companion technical report [12].…”

Section: Soundnessmentioning

confidence: 95%

Verifying BPEL-Like Programs with Hoare Logic

Luo

Qin

Qiu

2008

2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering

Self Cite

View full text Add to dashboard Cite

advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Additional information:Use policyThe full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-prot purposes provided that:• a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be sold in any format or medium without the formal permission of the copyright holders.Please consult the full DRO policy for further details.

show abstract

“…BPE-calculus was modeled both in the absence and in the presence of DPE [47]. Recently, Luo et al have studied the verification of BPEL programs using Hoare logic [33,34]. A set of proof rules were proposed in Hoare logic style.…”

Section: Related Workmentioning

confidence: 99%

Algebraic approach to linking the semantics of web services

Zhu

et al. 2011

Innovations Syst Softw Eng

View full text Add to dashboard Cite

Web services have become more and more important in these years, and BPEL4WS (BPEL) is a de facto standard for the web service composition and orchestration. It contains several distinct features, including the scope-based compensation and fault handling mechanism. We have considered the operational semantics and denotational semantics for BPEL, where a set of algebraic laws can be achieved via these two models, respectively. In this paper, we consider the inverse work, deriving the operational semantics and denotational semantics from algebraic semantics for BPEL. In our model, we introduce four types of typical programs, by which every program can be expressed as the summation of these four types. Based on the algebraic semantics, the strategy for deriving the operational semantics is provided and a transition system is derived by strict proof. This can be considered as the soundness exploration for the operational semantics A short version of this paper appeared in based on the algebraic semantics. Further, the equivalence between the derivation strategy and the derived transition system is explored, which can be considered as the completeness of the operational semantics. Finally, the derivation of the denotational semantics from algebraic semantics is explored, which can support to reason about more program properties easily.

show abstract

Verifying BPEL-like programs with Hoare logic

Cited by 10 publications

References 15 publications

PTSC: probability, time and shared-variable concurrency

PTSC: probability, time and shared-variable concurrency

Verifying BPEL-Like Programs with Hoare Logic

Algebraic approach to linking the semantics of web services

Contact Info

Product

Resources

About