Ran Chen, C. Cohen, J. Lévy, Stephan Merz, L. Théry
{"title":"Tarjan强连通分量算法在Why3, Coq和Isabelle中的形式化证明","authors":"Ran Chen, C. Cohen, J. Lévy, Stephan Merz, L. Théry","doi":"10.4230/LIPIcs.ITP.2019.13","DOIUrl":null,"url":null,"abstract":"Comparing provers on a formalization of the same problem is always a valuable exercise. In thispaper, we present the formal proof of correctness of a non-trivial algorithm from graph theory thatwas carried out in three proof assistants: Why3,Coq, and Isabelle.","PeriodicalId":296683,"journal":{"name":"International Conference on Interactive Theorem Proving","volume":"201 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Formal Proofs of Tarjan's Strongly Connected Components Algorithm in Why3, Coq and Isabelle\",\"authors\":\"Ran Chen, C. Cohen, J. Lévy, Stephan Merz, L. Théry\",\"doi\":\"10.4230/LIPIcs.ITP.2019.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Comparing provers on a formalization of the same problem is always a valuable exercise. In thispaper, we present the formal proof of correctness of a non-trivial algorithm from graph theory thatwas carried out in three proof assistants: Why3,Coq, and Isabelle.\",\"PeriodicalId\":296683,\"journal\":{\"name\":\"International Conference on Interactive Theorem Proving\",\"volume\":\"201 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Interactive Theorem Proving\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/LIPIcs.ITP.2019.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Interactive Theorem Proving","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.ITP.2019.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Formal Proofs of Tarjan's Strongly Connected Components Algorithm in Why3, Coq and Isabelle
Comparing provers on a formalization of the same problem is always a valuable exercise. In thispaper, we present the formal proof of correctness of a non-trivial algorithm from graph theory thatwas carried out in three proof assistants: Why3,Coq, and Isabelle.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
