ST-CRTS: Dynamic Unmasking of Compiler Optimizations and Obfuscations

ST-CRTS：编译器优化和混淆的动态揭秘

• 批准号: 0541382
• 负责人: Rajiv Gupta
• 金额: $ 30万
• 依托单位: University of Arizona
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2006
• 资助国家: 美国
• 起止时间: 2006-02-01 至 2007-10-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0541382&HistoricalAwards=false
• 关键词: ST; CRTS; Dynamic; Unmasking; Compiler

BackgroundIn this project the PI argues that many applications, related to software reliability and software protection, require automated comparison of original and the transformed versions of the program.The goal of this comparison is to match instructions from two versions that correspond to each other. The PI refers to this process of automatically unmasking the effects of program transformations as matching.Intellectual Merit:-The PI propose to develop nearly accurate dynamic matching algorithms which are designed to -Use execution histories to find mapping between code that appears to be different but behaves the same during an execution. -Perform matching at binary level.-Use matching to compare execution histories of the two versions at regular intervals and report the set of unmatched statements. -Combination of techniques that use Diablo to produce a static program representation and runtime algorithms that process Valgrind generated traces for compression are being implemented to produce Whole Execution Traces (WETs). -Deposit in a WET database and accessed by the Dynamic Matching module to carry out matching.Broader ImpactThe PI has involved 2 PhD students in the preliminary work carried out for the proposed research.These students are expected to finish their degrees by the end of the proposed project. In addition, other graduate and undergraduate students in Programming Languages classes taught by the PI will use the infrastructure in their class projects.Initially the research results produced by this project will be incorporated into the above courses taught by the PI. Later PI will develop a dedicated course on Dynamic Techniques. The labs and lectures prepared will be freely made available through the project website. Once such a course is ready, the PI will also undertake a book writing project to produce a formal text in the broader area of dynamic analysis.Although the initial goal of this research is to develop dynamic unmasking techniques for optimized and obfuscated code, the dynamic information analysis infrastructure that is being developed will also be useful in other areas of research such as performance analysis and debugging. Therefore, the infrastructure produced will be have a broader impact by being useful to other researchers as well.

在这个项目中，PI认为许多与软件可靠性和软件保护有关的应用需要对程序的原始版本和转换版本进行自动比较，这种比较的目标是匹配来自两个版本的指令。PI指的是这种自动揭示程序转换效果的过程，即匹配。智力上的优点：-PI建议开发近乎精确的动态匹配算法，该算法旨在-使用执行历史来找到看起来不同的代码之间的映射， 在执行死刑时也是一样- 在二进制级别执行匹配。-使用匹配功能定期比较两个版本的执行历史记录 间隔，并报告不匹配的语句集。- 使用Diablo生成静态程序表示和运行时的技术组合 正在实施处理Valgrind生成的轨迹以进行压缩的算法， 执行跟踪（WESTERN）。- 存款在WET数据库中，并由动态匹配模块访问以执行匹配。更广泛的影响PI已经涉及2名博士生为拟议的研究进行的前期工作。这些学生预计将在拟议的项目结束时完成学位。此外，PI教授的编程语言课程的其他研究生和本科生将在他们的课堂项目中使用该基础设施。最初，该项目产生的研究成果将被纳入PI教授的上述课程中。稍后PI将开发一个关于动态技术的专门课程。准备的实验和讲座将通过项目网站免费提供。一旦这样的课程准备就绪，PI还将进行一个写书项目，在更广泛的动态分析领域产生一个正式的文本。虽然这项研究的最初目标是开发动态解蔽技术的优化和混淆的代码，动态信息分析基础设施，正在开发的也将是有用的其他领域的研究，如性能分析和调试。因此，所产生的基础设施也将对其他研究人员有用，从而产生更广泛的影响。