Weakest Preconditions for Applied \pi-Calculus

In this paper, we develop a logic for reasoning about applied pi-calculus processes based on the concept of weakest precondition and Hoare's logic. We propose a set of weakest precondition (wp) rules for applied pi-calculus and give the soundness proof of these rules. The intention behind this work is to be able to provide a formal basis for analyzing properties of mobile and distributed systems formalized in applied pi- calculus. Let S be the system formalized in applied pi-calculus, its functionality is specified as Hoare triple [pre]S[post], where pre and post are precondition and post condition, respectively. By applying wp rules recursively, we can deduce the weakest precondition of system S with respect to post condition post. One possible application of this method is analyzing properties of Web Service compositions or other component-based software composition.