{"title":"一种使用符号符号的程序周期变换","authors":"D. Romannikov, G. Troshina, A. Voevoda","doi":"10.1109/SCM.2015.7190409","DOIUrl":null,"url":null,"abstract":"Nowadays there are not formal tools in the program industrial that can guarantee a lack of errors in analyzed software. A huge number of program paths affect to a complexity of a program analysis. An approach of reducing of a quantity of program paths is described in the paper. This approach bases on a symbolic notation. According to this approach variables after program cycle should be depicted as a symbolic expression. Wherein additional variables are introduced in these expressions for describing of a set of a program variables. After that a program should be depicted as a graph with contexts as a nodes. Then this graph of contexts might be analyzed in any state by calculation of an expression where symbols are substituted by their possible values in this context.","PeriodicalId":106868,"journal":{"name":"2015 XVIII International Conference on Soft Computing and Measurements (SCM)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A program cycle transformation with using of a symbolic notation\",\"authors\":\"D. Romannikov, G. Troshina, A. Voevoda\",\"doi\":\"10.1109/SCM.2015.7190409\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nowadays there are not formal tools in the program industrial that can guarantee a lack of errors in analyzed software. A huge number of program paths affect to a complexity of a program analysis. An approach of reducing of a quantity of program paths is described in the paper. This approach bases on a symbolic notation. According to this approach variables after program cycle should be depicted as a symbolic expression. Wherein additional variables are introduced in these expressions for describing of a set of a program variables. After that a program should be depicted as a graph with contexts as a nodes. Then this graph of contexts might be analyzed in any state by calculation of an expression where symbols are substituted by their possible values in this context.\",\"PeriodicalId\":106868,\"journal\":{\"name\":\"2015 XVIII International Conference on Soft Computing and Measurements (SCM)\",\"volume\":\"64 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 XVIII International Conference on Soft Computing and Measurements (SCM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCM.2015.7190409\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 XVIII International Conference on Soft Computing and Measurements (SCM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCM.2015.7190409","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A program cycle transformation with using of a symbolic notation
Nowadays there are not formal tools in the program industrial that can guarantee a lack of errors in analyzed software. A huge number of program paths affect to a complexity of a program analysis. An approach of reducing of a quantity of program paths is described in the paper. This approach bases on a symbolic notation. According to this approach variables after program cycle should be depicted as a symbolic expression. Wherein additional variables are introduced in these expressions for describing of a set of a program variables. After that a program should be depicted as a graph with contexts as a nodes. Then this graph of contexts might be analyzed in any state by calculation of an expression where symbols are substituted by their possible values in this context.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
