{"title":"证明程序终止和存活的自动化方法","authors":"A. Rybalchenko","doi":"10.1109/SYNASC.2009.70","DOIUrl":null,"url":null,"abstract":"Proving program termination is an important step towards ensuring software reliability. The programmers expect that the majority of code fragments, including procedures, event handles, or other program components, always terminates. Unfortunately, until recently there were no viable approaches for automatically proving termination of programs written in imperative programming languages.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Automated Methods for Proving Program Termination and Liveness\",\"authors\":\"A. Rybalchenko\",\"doi\":\"10.1109/SYNASC.2009.70\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Proving program termination is an important step towards ensuring software reliability. The programmers expect that the majority of code fragments, including procedures, event handles, or other program components, always terminates. Unfortunately, until recently there were no viable approaches for automatically proving termination of programs written in imperative programming languages.\",\"PeriodicalId\":286180,\"journal\":{\"name\":\"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2009.70\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2009.70","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Automated Methods for Proving Program Termination and Liveness
Proving program termination is an important step towards ensuring software reliability. The programmers expect that the majority of code fragments, including procedures, event handles, or other program components, always terminates. Unfortunately, until recently there were no viable approaches for automatically proving termination of programs written in imperative programming languages.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
