会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method for binary-level branch reversal on computer architectures supporting predicated execution
    • 支持预处理执行的计算机体系结构的二进制级分支反转方法
    • US06834383B2
    • 2004-12-21
    • US09994258
    • 2001-11-26
    • David Mitford GilliesRonnie Ira Chaiken
    • David Mitford GilliesRonnie Ira Chaiken
    • G06F944
    • G06F9/30058G06F8/44G06F9/30072G06F9/3842
    • Described is a method that identifies a predicate expression representing conditions in predicated assembly language instructions that determine a direction of a conditional branch instruction. The predicate expression is employed to enable a transformation to be made that causes the conditional branch instruction to trigger, or execute, when an opposite condition is true. A method is directed to producing a binary-level conditional branch reversal within a binary program on a computer architecture that supports a predicated execution. The method includes obtaining a predicate expression representing a condition that influences a direction of program flow of the binary-level conditional branch to be reversed, determining a binary-level transformation that causes the binary-level conditional branch to be triggered when an opposite condition is true, and modifying the binary-level conditional branch with the determined binary-level transformation, wherein the binary-level conditional branch is reversed.
    • 描述了一种识别表示条件分支指令的方向的预测汇编语言指令中的条件的谓词表达式的方法。 使用谓词表达式以使得能够进行转换,导致条件分支指令在相反条件为真时触发或执行。 一种方法涉及在支持预定执行的计算机体系结构上的二进制程序中产生二进制级条件分支反转。 该方法包括:获得表示影响要反转的二进制级条件分支的节目流的方向的条件的谓词表达式,确定当相反的条件是相反的条件时,引起二进制级条件分支被触发的二进制级变换 真的,并用确定的二进制级变换修改二进制级条件分支,其中二进制级条件分支被反转。
    • 2. 发明授权
    • Assigning free register to unmaterialized predicate in inverse predicate expression obtained for branch reversal in predicated execution system
    • 在预测执行系统中为分支反转获得的反谓词表达式中将无效寄存器分配给非物质谓词
    • US07350061B2
    • 2008-03-25
    • US10973326
    • 2004-10-25
    • David Mitford GilliesRonnie Ira Chaiken
    • David Mitford GilliesRonnie Ira Chaiken
    • G06F9/44
    • G06F9/30058G06F8/44G06F9/30072G06F9/3842
    • Described is a method that identifies a predicate expression representing conditions in predicated assembly language instructions that determine a direction of a conditional branch instruction. The predicate expression is employed to enable a transformation to be made that causes the conditional branch instruction to trigger, or execute, when an opposite condition is true. A method is directed to producing a binary-level conditional branch reversal within a binary program on a computer architecture that supports a predicated execution. The method includes obtaining a predicate expression representing a condition that influences a direction of program flow of the binary-level conditional branch to be reversed, determining a binary-level transformation that causes the binary-level conditional branch to be triggered when an opposite condition is true, and modifying the binary-level conditional branch with the determined binary-level transformation, wherein the binary-level conditional branch is reversed.
    • 描述了一种识别表示条件分支指令的方向的预测汇编语言指令中的条件的谓词表达式的方法。 使用谓词表达式以使得能够进行转换,导致条件分支指令在相反条件为真时触发或执行。 一种方法涉及在支持预定执行的计算机体系结构上的二进制程序中产生二进制级条件分支反转。 该方法包括:获得表示影响要反转的二进制级条件分支的节目流的方向的条件的谓词表达式,确定当相反的条件是相反的条件时引起二进制级条件分支被触发的二进制级变换 真的,并用确定的二进制级变换修改二进制级条件分支,其中二进制级条件分支被反转。
    • 3. 发明授权
    • Method and system for rewriting unwind data in the presence of exceptions
    • 在存在异常的情况下重写展开数据的方法和系统
    • US07426719B2
    • 2008-09-16
    • US09997056
    • 2001-11-29
    • Ronnie Ira ChaikenDavid Mitford Gillies
    • Ronnie Ira ChaikenDavid Mitford Gillies
    • G06F9/44
    • G06F9/4484
    • Described is a system and method of regenerating stack unwind data in the presence of exceptions. The system is directed to generating metadata for use during stack unwinding. The system includes procedures, a first plurality of metadata, and an unwind rewriter. Each metadata is associated with a corresponding procedure in the procedures. The unwind rewriter generates new metadata from the first plurality of metadata in response to a modification of the sequence of binary instructions within a procedure, such that the new metadata accurately represents the modified sequence of binary instructions. The method regenerates metadata in response to a binary modification to a procedure by receiving a first group of metadata associated with the unmodified procedure, parsing the first group of metadata, and generating a second group of metadata that accurately represents the binary modification to the procedure.
    • 描述了在存在异常的情况下重新生成堆叠展开数据的系统和方法。 该系统旨在生成用于堆栈展开期间使用的元数据。 该系统包括程序,第一多个元数据和退绕重写器。 每个元数据与过程中的相应过程相关联。 回卷重写器响应于过程中的二进制指令序列的修改而从第一多个元数据生成新的元数据,使得新的元数据准确地表示二进制指令的修改的序列。 所述方法通过接收与所述未修改过程相关联的第一组元数据,解析所述第一组元数据以及生成准确地表示所述过程的二进制修改的第二组元数据来响应于过程的二进制修改而重新生成元数据。
    • 4. 发明授权
    • Determining guarding predicate from partition graph based deduction to generate inverse predicate expression for branch reversal
    • 从基于分区图的推导确定保护谓词以生成分支反转的反谓词表达式
    • US07203936B2
    • 2007-04-10
    • US10934018
    • 2004-09-02
    • David Mitford GilliesRonnie Ira Chaiken
    • David Mitford GilliesRonnie Ira Chaiken
    • G06F9/44
    • G06F9/30058G06F8/44G06F9/30072G06F9/3842
    • Described is a method that identifies a predicate expression representing conditions in predicated assembly language instructions that determine a direction of a conditional branch instruction. The predicate expression is employed to enable a transformation to be made that causes the conditional branch instruction to trigger, or execute, when an opposite condition is true. A method is directed to producing a binary-level conditional branch reversal within a binary program on a computer architecture that supports a predicated execution. The method includes obtaining a predicate expression representing a condition that influences a direction of program flow of the binary-level conditional branch to be reversed, determining a binary-level transformation that causes the binary-level conditional branch to be triggered when an opposite condition is true, and modifying the binary-level conditional branch with the determined binary-level transformation, wherein the binary-level conditional branch is reversed.
    • 描述了一种识别表示条件分支指令的方向的预测汇编语言指令中的条件的谓词表达式的方法。 使用谓词表达式以使得能够进行转换,导致条件分支指令在相反条件为真时触发或执行。 一种方法涉及在支持预定执行的计算机体系结构上的二进制程序中产生二进制级条件分支反转。 该方法包括:获得表示影响要反转的二进制级条件分支的节目流的方向的条件的谓词表达式,确定当相反的条件是相反的条件时,引起二进制级条件分支被触发的二进制级变换 真的,并用确定的二进制级变换修改二进制级条件分支,其中二进制级条件分支被反转。
    • 5. 发明授权
    • Apparatus and method for incrementally update static single assignment form for cloned variable name definitions
    • 用于逐步更新克隆变量名称定义的静态单一分配表单的设备和方法
    • US06249910B1
    • 2001-06-19
    • US09072282
    • 1998-05-04
    • Dz-ching JuDavid Mitford GilliesA. V. S. Sastry
    • Dz-ching JuDavid Mitford GilliesA. V. S. Sastry
    • G06F945
    • G06F8/433G06F8/443
    • An improved technique for incrementally updating a source code representation having cloned variable name definitions to static single assignment (SSA) form is described. The technique receives an intermediate representation of a source program in non-SSA form having one or more cloned variable name definitions that correspond to an original variable name. All the original variable names and their corresponding cloned variable names are collected. An iterative dominance frontier set for those nodes containing a cloned variable name definition or an original variable name definition is formed. This iterative dominance frontier set is then used to determine the nodes in which a single phi-function is inserted for each original variable name. Each use of an original variable name is changed to the cloned variable name that reaches the use. The arguments of the inserted phi-functions are then updated with the cloned variable names that reach the inserted phi-functions. Finally, all dead instructions including the original variable definitions, redundant cloned variable definitions, and redundant inserted phi-functions are eliminated.
    • 描述了一种用于将具有克隆的变量名定义的源代码表示递增地更新为静态单赋值(SSA)形式的改进技术。 该技术以非SSA形式接收源程序的中间表示,其具有对应于原始变量名称的一个或多个克隆变量名称定义。 收集所有原始变量名称及其相应的克隆变量名称。 形成了包含克隆变量名定义或原始变量名定义的节点的迭代优势前沿。 然后使用该迭代优势前沿集来确定为每个原始变量名称插入单个phi函数的节点。 每个使用原始变量名称都将更改为达到使用的克隆变量名称。 然后使用到达插入的phi函数的克隆变量名称更新插入的phi函数的参数。 最后,消除了所有死亡指令,包括原始变量定义,冗余克隆变量定义和冗余插入的phi函数。