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

Petros Papapanagiotou
(University of Edinburgh)
Jacques D. Fleuriot
(University of Edinburgh)

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.

In Laura Kovacs, Rosario Pugliese and Francesco Tiezzi: Proceedings 7th International Workshop on Automated Specification and Verification of Web Systems (WWV 2011), Reykjavik, Iceland, 9th June 2011, Electronic Proceedings in Theoretical Computer Science 61, pp. 1–16.
Published: 10th August 2011.

ArXived at: http://dx.doi.org/10.4204/EPTCS.61.1 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org