{"title":"一种改进的使用堆栈跟踪的静态程序切片算法","authors":"Hongchang Zhang, Shujuan Jiang, Rong Jin","doi":"10.1109/ICSESS.2011.5982378","DOIUrl":null,"url":null,"abstract":"In order to improve the accuracy of the static program slicing which is used to locate the faults that cause an exception, we propose a new approach that uses the stack trace which is stored when an exception occurred. The proposed approach consists of three steps. First, it uses stack trace to infer the execution trace and figure out those methods and statements that have not been ever executed. Then, these methods which are not executed will be ignored when building the system dependence graph. Finally, the accurate slice will be got by adopting the improved program slicing algorithm. We perform an empirical study of our new approach by using four reported bugs of open-source project Ant. And the result shows that using our approach the slice is 8 percent less than using the general static program slicing algorithm on average.","PeriodicalId":108533,"journal":{"name":"2011 IEEE 2nd International Conference on Software Engineering and Service Science","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"An improved static program slicing algorithm using stack trace\",\"authors\":\"Hongchang Zhang, Shujuan Jiang, Rong Jin\",\"doi\":\"10.1109/ICSESS.2011.5982378\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to improve the accuracy of the static program slicing which is used to locate the faults that cause an exception, we propose a new approach that uses the stack trace which is stored when an exception occurred. The proposed approach consists of three steps. First, it uses stack trace to infer the execution trace and figure out those methods and statements that have not been ever executed. Then, these methods which are not executed will be ignored when building the system dependence graph. Finally, the accurate slice will be got by adopting the improved program slicing algorithm. We perform an empirical study of our new approach by using four reported bugs of open-source project Ant. And the result shows that using our approach the slice is 8 percent less than using the general static program slicing algorithm on average.\",\"PeriodicalId\":108533,\"journal\":{\"name\":\"2011 IEEE 2nd International Conference on Software Engineering and Service Science\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE 2nd International Conference on Software Engineering and Service Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSESS.2011.5982378\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 2nd International Conference on Software Engineering and Service Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSESS.2011.5982378","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An improved static program slicing algorithm using stack trace
In order to improve the accuracy of the static program slicing which is used to locate the faults that cause an exception, we propose a new approach that uses the stack trace which is stored when an exception occurred. The proposed approach consists of three steps. First, it uses stack trace to infer the execution trace and figure out those methods and statements that have not been ever executed. Then, these methods which are not executed will be ignored when building the system dependence graph. Finally, the accurate slice will be got by adopting the improved program slicing algorithm. We perform an empirical study of our new approach by using four reported bugs of open-source project Ant. And the result shows that using our approach the slice is 8 percent less than using the general static program slicing algorithm on average.