会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Minimum delta generator for program binaries
    • 程序二进制文件的最小增量生成器
    • US07263531B2
    • 2007-08-28
    • US10862554
    • 2004-06-07
    • Ramarathnam VenkatesanSaurabh Sinha
    • Ramarathnam VenkatesanSaurabh Sinha
    • G06F17/30
    • G06F8/658Y10S707/99936Y10S707/99943
    • Implementations of this invention provide a technology for generating a minimum delta between at least two program binaries. An implementation of this invention is given a source program (S) in a binary format and a target program (T) in a binary form. It constructs control flow graphs (CFGs) of each. It matches common blocks of the S's CFGs and T's CFGs. The blocks are matched based upon their content and their local neighborhoods. In addition, the register renaming problems is solved so that blocks can be fairly compared. This implementation of this invention produces an intermediate output, which is the content of unmatched blocks. It generates a set of edge edit operations for merging the unmatched blocks into S. The combination of the unmatched blocks and the edit operations is the delta. To patch S to produce a reconstructed copy of T, the delta is merged with S. This abstract itself is not intended to limit the scope of this patent. The scope of the present invention is pointed out in the appending claims.
    • 本发明的实现提供了一种用于在至少两个程序二进制文件之间生成最小增量的技术。 以二进制格式给出本发明的实现方案,并以二进制形式给出目标程序(T)。 它构建了每个的控制流图(CFG)。 它匹配S的CFG和T的CFG的通用块。 基于他们的内容和他们当地的社区匹配。 此外,解决了寄存器重命名问题,以便可以比较块。 本发明的该实施方式产生中间输出,其是不匹配块的内容。 它生成一组用于将不匹配的块合并到S中的边缘编辑操作。不匹配块和编辑操作的组合是增量。 为了修补S以产生T的重构副本,该delta与S合并。该摘要本身并不旨在限制该专利的范围。 在所附权利要求中指出了本发明的范围。
    • 6. 发明授权
    • Minimum delta generator for program binaries
    • 程序二进制文件的最小增量生成器
    • US07681190B2
    • 2010-03-16
    • US11276814
    • 2006-03-15
    • Ramarathnam VenkatesanSaurabh Sinha
    • Ramarathnam VenkatesanSaurabh Sinha
    • G06F9/44
    • G06F8/658Y10S707/99936Y10S707/99943
    • Implementations provide a technology for generating a minimum delta between at least two program binaries. An implementation is given a source program (S) in a binary format and a target program (T) in a binary form. It constructs control flow graphs (CFGs) of each. It matches common blocks of the S's CFGs and T's CFGs. The blocks are matched based upon their content and their local neighborhoods. In addition, the register renaming problems is solved so that blocks can be fairly compared. This implementation produces an intermediate output, which is the content of unmatched blocks. It generates a set of edge edit operations for merging the unmatched blocks into S. The combination of the unmatched blocks and the edit operations is the delta. To patch S to produce a reconstructed copy of T, the delta is merged with S.
    • 实现提供了一种用于在至少两个程序二进制文件之间生成最小增量的技术。 给出了二进制格式的源程序(S)和二进制形式的目标程序(T)的实现。 它构建了每个的控制流图(CFG)。 它匹配S的CFG和T的CFG的通用块。 基于他们的内容和他们当地的社区匹配。 此外,解决了寄存器重命名问题,以便可以比较块。 该实现产生中间输出,它是不匹配块的内容。 它生成一组用于将不匹配的块合并到S中的边缘编辑操作。不匹配块和编辑操作的组合是增量。 为了修补S以产生T的重构副本,delta与S合并。