会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Control flow analysis using deductive reaching definitions
    • 使用演绎达成定义的控制流分析
    • US08615748B2
    • 2013-12-24
    • US12903552
    • 2010-10-13
    • Patrick R. DoyleAllan H. KielstraPramod Ramarao
    • Patrick R. DoyleAllan H. KielstraPramod Ramarao
    • G06F9/45
    • G06F8/75G06F8/433
    • A computer-implemented process for deductive reaching definition analysis receives a control flow graph to form a set of received blocks and edges, performs traditional reaching definitions to produce bit-vectors OUT(b), GEN(b) and KILL(b) for each block in the set of received blocks and receives impossibility indicators for a set of definitions that are impossible on specific edges. The computer-implemented process further performs deduction operations using a combination of the bit-vectors and impossibility indicators to deduce that additional definitions cannot reach certain blocks to create resulting reachability information and provides the resulting reachability information as a result to a requestor. A related system and program product is also provided.
    • 用于演绎到达定义分析的计算机实现的过程接收控制流程图以形成一组接收的块和边缘,执行传统的达成定义以产生每个的向量OUT(b),GEN(b)和KILL(b) 在一组接收到的块中阻塞,并且收到在特定边缘不可能的一组定义的不可能性指示符。 计算机实现的过程进一步使用比特向量和不可能性指示符的组合来执行扣除操作,以推断附加定义不能到达某些块以创建所得到的可达性信息,并且将结果可达性信息提供给请求者。 还提供了相关的系统和程序产品。
    • 4. 发明申请
    • Control Flow Analysis Using Deductive Reaching Definitions
    • 使用演绎到达定义的控制流分析
    • US20110191761A1
    • 2011-08-04
    • US12903552
    • 2010-10-13
    • Patrick R. DoyleAllan H. KielstraPramod Ramarao
    • Patrick R. DoyleAllan H. KielstraPramod Ramarao
    • G06F9/45
    • G06F8/75G06F8/433
    • A computer-implemented process for deductive reaching definition analysis receives a control flow graph to form a set of received blocks and edges, performs traditional reaching definitions to produce bit-vectors OUT(b), GEN(b) and KILL(b) for each block in the set of received blocks and receives impossibility indicators for a set of definitions that are impossible on specific edges. The computer-implemented process further performs deduction operations using a combination of the bit-vectors and impossibility indicators to deduce that additional definitions cannot reach certain blocks to create resulting reachability information and provides the resulting reachability information as a result to a requestor. A related system and program product is also provided.
    • 用于演绎到达定义分析的计算机实现的过程接收控制流程图以形成一组接收的块和边缘,执行传统的达成定义以产生每个的向量OUT(b),GEN(b)和KILL(b) 在一组接收到的块中阻塞,并且收到在特定边缘不可能的一组定义的不可能性指示符。 计算机实现的过程进一步使用比特向量和不可能性指示符的组合来执行扣除操作,以推断附加定义不能到达某些块以创建所得到的可达性信息,并且将结果可达性信息提供给请求者。 还提供了相关的系统和程序产品。
    • 5. 发明申请
    • APPARATUS AND METHOD TO SELECTIVELY REMOVE MEMOIZING FUNCTIONS FROM PROGRAM CODE
    • 从程序代码中选择删除备忘功能的设备和方法
    • US20120096448A1
    • 2012-04-19
    • US12903672
    • 2010-10-13
    • Patrick R. Doyle
    • Patrick R. Doyle
    • G06F9/45
    • G06F8/4441G06F8/433
    • A method to selectively remove memoizing functions from computer program code is disclosed herein. In one embodiment, such a method includes locating a memoizing function call in program code. The method then replaces the memoizing function call with a simple object allocation. Using escape analysis, the method determines whether the replacement is legal. If the replacement is not legal, the method removes the simple object allocation and reinserts the original memoizing function call in its place. If the replacement is legal, the method retains the simple object allocation in the program code. If desired, certain compiler optimizations, such as stack allocation and scalarization, may then be performed on the simple object allocation. A corresponding computer program product and apparatus are also disclosed herein.
    • 本文公开了一种从计算机程序代码中选择性地去除记忆功能的方法。 在一个实施例中,这种方法包括在程序代码中定位记忆功能调用。 然后,该方法用简单的对象分配替换记忆函数调用。 使用逃逸分析,该方法确定替换是否合法。 如果替换不合法,该方法将删除简单的对象分配并重新插入原始的记忆函数调用。 如果替换是合法的,则该方法保留程序代码中的简单对象分配。 如果需要,可以在简单对象分配上执行某些编译器优化,例如堆栈分配和标量化。 本文还公开了相应的计算机程序产品和装置。
    • 7. 发明授权
    • Apparatus and method to selectively remove memoizing functions from program code
    • 从程序代码中选择性地去除记忆功能的装置和方法
    • US08418160B2
    • 2013-04-09
    • US12903672
    • 2010-10-13
    • Patrick R. Doyle
    • Patrick R. Doyle
    • G06F9/45
    • G06F8/4441G06F8/433
    • A method to selectively remove memoizing functions from computer program code includes initially locating a memoizing function call in the program code. The method then replaces the memoizing function call with a simple object allocation. Using escape analysis, the method determines whether the replacement is legal. If the replacement is not legal, the method removes the simple object allocation and reinserts the original memoizing function call in its place. If the replacement is legal, the method retains the simple object allocation in the program code. If desired, certain compiler optimizations, such as stack allocation and scalarization, may then be performed on the simple object allocation. A corresponding computer program product and apparatus are also disclosed.
    • 从计算机程序代码中选择性地去除记忆功能的方法包括首先在程序代码中定位记忆功能调用。 然后,该方法用简单的对象分配替换记忆函数调用。 使用逃逸分析,该方法确定替换是否合法。 如果替换不合法,该方法将删除简单的对象分配并重新插入原始的记忆函数调用。 如果替换是合法的,则该方法保留程序代码中的简单对象分配。 如果需要,可以在简单对象分配上执行某些编译器优化,例如堆栈分配和标量化。 还公开了相应的计算机程序产品和装置。