A theorem proving framework for the formal verification of Web Services Composition

Details A theorem proving framework for the formal verification of Web Services Composition A theorem proving framework for the formal verification of Web Services Composition

2011-08-11

arxiv.org/abs/1108.2348v1

EPTCS 61, 2011, pp. 1-16

Computer Science

Logic in Computer Science

In Proceedings WWV 2011, arXiv:1108.2085

Scientific paper

10.4204/EPTCS.61.1

We present a rigorous framework for the composition of Web Services within a higher order logic theorem prover. Our approach is based on the proofs-as-processes paradigm that enables inference rules of Classical Linear Logic (CLL) to be translated into pi-calculus processes. In this setting, composition is achieved by representing available web services as CLL sentences, proving the requested composite service as a conjecture, and then extracting the constructed pi-calculus term from the proof. Our framework, implemented in HOL Light, not only uses an expressive logic that allows us to incorporate multiple Web Services properties in the composition process, but also provides guarantees of soundness and correctness for the composition.

Affiliated with

Also associated with

No associations

Rating

A theorem proving framework for the formal verification of Web Services Composition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A theorem proving framework for the formal verification of Web Services Composition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A theorem proving framework for the formal verification of Web Services Composition will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-275759