摘要:
Program partitioning of an application can include creating execution flow graphs and static flow graphs of targeted functions or operations of the application. Based on the execution flow graphs or static flow graphs, replay interfaces are created. The replay interfaces provide data flows that are usable in re-execution of the application during program development.
摘要:
A “Demand-Driven Pointer Analyzer” (DDPA) provides a “demand-driven” field-sensitive pointer analysis process. This process rapidly and accurately identifies alias sets for selected pointers in software modules or programs of any size, including large-scale C/C++ programs such as a complete operating system (OS). The DDPA formulates the pointer analysis task as a Context-Free Language (CFL) reachability problem that operates using a Program Expression Graph (PEG) automatically constructed from the program code. The PEG provides a node and edge-based graph representation of all expressions and assignments in the program and allows the DDPA to rapidly identify aliases for pointers in the program by traversing the graph as a CFL reachability problem to determine pointer alias sets. In various embodiments, the DDPA is also context-sensitive.
摘要翻译:“需求驱动的指针分析器”(DDPA)提供了一个“需求驱动的”现场敏感指针分析过程。 此过程可快速准确地识别软件模块或任何大小的程序(包括大型C / C ++程序,如完整的操作系统(OS))中的所选指针的别名集。 DDPA使用由程序代码自动构建的程序表达式图(PEG)来运行,使指针分析任务形成为无上下文语言(CFL)可达性问题。 PEG提供程序中所有表达式和赋值的节点和边缘图表示,并允许DDPA通过遍历图形来快速识别程序中的指针的别名,作为CFL可达性问题,以确定指针别名集。 在各种实施例中,DDPA也是上下文相关的。
摘要:
A “Demand-Driven Pointer Analyzer” (DDPA) provides a “demand-driven” field-sensitive pointer analysis process. This process rapidly and accurately identifies alias sets for selected pointers in software modules or programs of any size, including large-scale C/C++ programs such as a complete operating system (OS). The DDPA formulates the pointer analysis task as a Context-Free Language (CFL) reachability problem that operates using a Program Expression Graph (PEG) automatically constructed from the program code. The PEG provides a node and edge-based graph representation of all expressions and assignments in the program and allows the DDPA to rapidly identify aliases for pointers in the program by traversing the graph as a CFL reachability problem to determine pointer alias sets. In various embodiments, the DDPA is also context-sensitive.
摘要翻译:需求驱动指针分析器(DDPA)提供了一种需求驱动的现场敏感指针分析过程。 此过程可快速准确地识别软件模块或任何大小的程序(包括大型C / C ++程序,如完整的操作系统(OS))中的所选指针的别名集。 DDPA使用由程序代码自动构建的程序表达式图(PEG)来运行,使指针分析任务形成为无上下文语言(CFL)可达性问题。 PEG提供程序中所有表达式和赋值的节点和边缘图表示,并允许DDPA通过遍历图形来快速识别程序中的指针的别名,作为CFL可达性问题,以确定指针别名集。 在各种实施例中,DDPA也是上下文相关的。