Towards Service Composition Based on Theorem Proving

Abstract

Abstract. Web Service composition has become a critical technology to react to the complex functional requirements put forward by business logic in ecommerce. How to guarantee the reliability of composite Web service is a hot topic through all the phase of lifecycle, including design, development and deployment. To this end, we are motivated to propose a Type Theory (TT) based method to automatic service composition. First of all, a service model in form of TT representation defines the atomic services declarations, semantic relation and composition request. Then, a set of TT rules that helps to prove the satisfiability of the user's request is formally given. Later, several useful tools transforming the service declaration files to the propositions and extracting the composition result from the proof is discussed. To face the challenge of reliability, we show a hybrid model, which dynamically binds service with the corresponding strict proving, to ensure the reliability of our method during compositing services. At last, the proposed method is implemented and a complete case study is conducted to demonstrate the applicability and effectiveness of our techniques.