{"title":"支持向量机的程序分析","authors":"Andrea Flexeder, Matthias Putz, T. Runkler","doi":"10.1109/IJCNN.2012.6252469","DOIUrl":null,"url":null,"abstract":"The prerequisite for practicable program analysis is the identification of the individual procedures, which correspond to individual stack frames. We present how machine learning techniques can be used in the setting of program analysis in order to find these stack frames. This combination of machine learning and abstract interpretation-based analysis provides the first fully automatic analysis framework for executables. Our approach can also be applied to identify library functions or malicious behaviour in a given piece of assembly.","PeriodicalId":287844,"journal":{"name":"The 2012 International Joint Conference on Neural Networks (IJCNN)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Support vector machines for program analysis\",\"authors\":\"Andrea Flexeder, Matthias Putz, T. Runkler\",\"doi\":\"10.1109/IJCNN.2012.6252469\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The prerequisite for practicable program analysis is the identification of the individual procedures, which correspond to individual stack frames. We present how machine learning techniques can be used in the setting of program analysis in order to find these stack frames. This combination of machine learning and abstract interpretation-based analysis provides the first fully automatic analysis framework for executables. Our approach can also be applied to identify library functions or malicious behaviour in a given piece of assembly.\",\"PeriodicalId\":287844,\"journal\":{\"name\":\"The 2012 International Joint Conference on Neural Networks (IJCNN)\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-06-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2012 International Joint Conference on Neural Networks (IJCNN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IJCNN.2012.6252469\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2012 International Joint Conference on Neural Networks (IJCNN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJCNN.2012.6252469","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The prerequisite for practicable program analysis is the identification of the individual procedures, which correspond to individual stack frames. We present how machine learning techniques can be used in the setting of program analysis in order to find these stack frames. This combination of machine learning and abstract interpretation-based analysis provides the first fully automatic analysis framework for executables. Our approach can also be applied to identify library functions or malicious behaviour in a given piece of assembly.