{"title":"Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses","authors":"H. Seidl, K. Verma","doi":"10.1007/978-3-540-71322-7_5","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":217710,"journal":{"name":"Program Analysis and Compilation","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Program Analysis and Compilation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-540-71322-7_5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}