Analysis and Composition of Web Components Based on p-Calculus

The quality delivered by existing Web applications is often poor. In this paper, the formal verification techniques for web compositions are presents, and the formal models of web composition are proposed. The definition of well-typedness and congruence of web composition basing on pi-calculus are given. At the same time, this paper analysis both static and dynamic composition, replacement of web components, and proposes methods to recover from the incongruence during the web composition. The significance of the work is twofold: on one hand, it provides a formal basis for better understanding of the composition of web components; on the other hand, it lays the ground work for both model checking and specification-based verifying on the web applications.