{"title":"HOL中动作时间逻辑的机械化","authors":"J. von Wright","doi":"10.1109/hol.1991.596282","DOIUrl":null,"url":null,"abstract":"A n attempt to mechanise reasoning about concurrent algorithms is described. The HOY, theorem prover is used i o formalise the semantics of the Temporal Logic of Actions (TLA) . Using this formalisation, the proof rules of T L A are proved as theorems in the HOL system. Two examples show how TLA-reasoning about algorithms can then be carried out using the HOL syst em.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"26 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Mechanizing The Temporal Logic Of Actions In HOL\",\"authors\":\"J. von Wright\",\"doi\":\"10.1109/hol.1991.596282\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A n attempt to mechanise reasoning about concurrent algorithms is described. The HOY, theorem prover is used i o formalise the semantics of the Temporal Logic of Actions (TLA) . Using this formalisation, the proof rules of T L A are proved as theorems in the HOL system. Two examples show how TLA-reasoning about algorithms can then be carried out using the HOL syst em.\",\"PeriodicalId\":213603,\"journal\":{\"name\":\"1991., International Workshop on the HOL Theorem Proving System and Its Applications\",\"volume\":\"26 2\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1991., International Workshop on the HOL Theorem Proving System and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/hol.1991.596282\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/hol.1991.596282","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
摘要
本文描述了对并发算法进行机械化推理的尝试。HOY定理证明器用于形式化动作时间逻辑(TLA)的语义。利用这种形式化，在HOL系统中以定理的形式证明了T - L - A的证明规则。两个例子展示了如何使用HOL系统对算法进行tla推理。
A n attempt to mechanise reasoning about concurrent algorithms is described. The HOY, theorem prover is used i o formalise the semantics of the Temporal Logic of Actions (TLA) . Using this formalisation, the proof rules of T L A are proved as theorems in the HOL system. Two examples show how TLA-reasoning about algorithms can then be carried out using the HOL syst em.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
