{"title":"Weakest Preconditions for Applied \\pi-Calculus","authors":"Decai Jiao, D. Sinclair","doi":"10.1109/ICCGI.2007.63","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":102568,"journal":{"name":"2007 International Multi-Conference on Computing in the Global Information Technology (ICCGI'07)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Multi-Conference on Computing in the Global Information Technology (ICCGI'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCGI.2007.63","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
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.