Armaël Guéneau, Jacques-Henri Jourdan, A. Charguéraud, F. Pottier
{"title":"一种增量周期检测算法的形式化证明与分析","authors":"Armaël Guéneau, Jacques-Henri Jourdan, A. Charguéraud, F. Pottier","doi":"10.4230/LIPIcs.ITP.2019.18","DOIUrl":null,"url":null,"abstract":"We study a state-of-the-art incremental cycle detection algorithm due to Bender, Fineman, Gilbert, and Tarjan. We propose a simple change that allows the algorithm to be regarded as genuinely online. Then, we exploit Separation Logic with Time Credits to simultaneously verify the correctness and the worst-case amortized asymptotic complexity of the modified algorithm.","PeriodicalId":296683,"journal":{"name":"International Conference on Interactive Theorem Proving","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Formal Proof and Analysis of an Incremental Cycle Detection Algorithm\",\"authors\":\"Armaël Guéneau, Jacques-Henri Jourdan, A. Charguéraud, F. Pottier\",\"doi\":\"10.4230/LIPIcs.ITP.2019.18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study a state-of-the-art incremental cycle detection algorithm due to Bender, Fineman, Gilbert, and Tarjan. We propose a simple change that allows the algorithm to be regarded as genuinely online. Then, we exploit Separation Logic with Time Credits to simultaneously verify the correctness and the worst-case amortized asymptotic complexity of the modified algorithm.\",\"PeriodicalId\":296683,\"journal\":{\"name\":\"International Conference on Interactive Theorem Proving\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Interactive Theorem Proving\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/LIPIcs.ITP.2019.18\",\"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.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Formal Proof and Analysis of an Incremental Cycle Detection Algorithm
We study a state-of-the-art incremental cycle detection algorithm due to Bender, Fineman, Gilbert, and Tarjan. We propose a simple change that allows the algorithm to be regarded as genuinely online. Then, we exploit Separation Logic with Time Credits to simultaneously verify the correctness and the worst-case amortized asymptotic complexity of the modified algorithm.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
