{"title":"一类具有多项式保护的程序的终止","authors":"Bin Wu, L. Shen, Zhongqin Bi, Zhenbing Zeng","doi":"10.1109/ICIME.2009.102","DOIUrl":null,"url":null,"abstract":"Determining the termination of programs is a basic task in computing science. By analyzing the powers of a matrix symbolically using its eigenvalues, this paper presents a method to prove termination of a class of loop programs with nonlinear guards and linear assignments.The termination of a linear assignment loop is only decided by the eigen values, whose module is greater than one, of the matrix defining the loop assignments.","PeriodicalId":445284,"journal":{"name":"2009 International Conference on Information Management and Engineering","volume":"150 7","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Termination of a Class of the Program with Polynomial Guards\",\"authors\":\"Bin Wu, L. Shen, Zhongqin Bi, Zhenbing Zeng\",\"doi\":\"10.1109/ICIME.2009.102\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Determining the termination of programs is a basic task in computing science. By analyzing the powers of a matrix symbolically using its eigenvalues, this paper presents a method to prove termination of a class of loop programs with nonlinear guards and linear assignments.The termination of a linear assignment loop is only decided by the eigen values, whose module is greater than one, of the matrix defining the loop assignments.\",\"PeriodicalId\":445284,\"journal\":{\"name\":\"2009 International Conference on Information Management and Engineering\",\"volume\":\"150 7\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Information Management and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIME.2009.102\",\"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 International Conference on Information Management and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIME.2009.102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Termination of a Class of the Program with Polynomial Guards
Determining the termination of programs is a basic task in computing science. By analyzing the powers of a matrix symbolically using its eigenvalues, this paper presents a method to prove termination of a class of loop programs with nonlinear guards and linear assignments.The termination of a linear assignment loop is only decided by the eigen values, whose module is greater than one, of the matrix defining the loop assignments.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
