会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 61. 发明申请
    • STATIC ANALYSIS OF COMPUTER SOFTWARE APPLICATIONS
    • 计算机软件应用的静态分析
    • US20130086562A1
    • 2013-04-04
    • US13411779
    • 2012-03-05
    • MARCO PISTOIAOmer Tripp
    • MARCO PISTOIAOmer Tripp
    • G06F9/44
    • G06F8/43
    • Static analysis of a computer software application can be performed by applying a first level of abstraction to model a plurality of run-time objects, thereby producing a set of object abstractions. Static data-flow analysis of the computer software application can be performed using the set of object abstractions, thereby producing a first data-flow propagation graph. A data-flow bottleneck can be identified within the data-flow propagation graph. A second level of abstraction can be applied to model any of the run-time objects having in the set of object abstractions a corresponding object abstraction that is traceable to the data-flow bottleneck. The applying the second level of abstraction can decompose the corresponding object abstraction into a set of object abstractions, thereby modifying the set of object abstractions. Static data-flow analysis of the computer software application can be performed using the modified set of object abstractions.
    • 可以通过应用第一级抽象来对多个运行时对象建模来执行计算机软件应用的静态分析,从而产生一组对象抽象。 可以使用一组对象抽象来执行计算机软件应用的静态数据流分析,从而产生第一数据流传播图。 数据流传输图可以识别数据流瓶颈。 可以应用第二级抽象来建模具有对象抽象集合的任何运行时对象,该对象抽象可追溯到数据流瓶颈。 应用第二级抽象可以将相应的对象抽象分解成一组对象抽象,从而修改对象抽象集合。 计算机软件应用程序的静态数据流分析可以使用修改后的对象抽象集执行。
    • 62. 发明授权
    • Modular and/or demand-driven string analysis of a computer program
    • 计算机程序的模块化和/或需求驱动的字符串分析
    • US08381199B2
    • 2013-02-19
    • US12907974
    • 2010-10-19
    • Takaaki TateishiOmer TrippMarco Pistoia
    • Takaaki TateishiOmer TrippMarco Pistoia
    • G06F9/44G06F9/45
    • G06F9/4482
    • Modular and/or demand-driven string analysis of a computer program is performed. Each method of the program is encoded into monadic second-order logic (M2L) to yield a set of predicate declarations and a set of constraints. The two sets for each method are composed to yield a union set of predicate declarations and a union set of constraints for the program. The union set of constraints includes a particular set of constraints corresponding to call relationships among the methods. An M2L formula including a free variable corresponding to a program variable is added to the union set of constraints. The two union sets are processed to verify a satisfiability of the constraints in relation to an illegal pattern. Where the constraints are satisfiable, the program can generate a string containing the illegal pattern. Where the constraints are not satisfiable, the program never generates a string containing the illegal pattern.
    • 执行计算机程序的模块化和/或需求驱动的字符串分析。 程序的每个方法被编码成一元二阶逻辑(M2L),以产生一组谓词声明和一组约束。 每个方法的两个集合被组合以产生一个联合集的谓词声明和该程序的约束集合。 联合约束集包括与方法之间的调用关系相对应的特定一组约束。 包含与程序变量相对应的自由变量的M2L公式被添加到约束集合中。 处理两个联合集以验证与非法模式相关的约束的可满足性。 在约束满足的情况下,程序可以生成包含非法模式的字符串。 在约束不可满足的情况下,程序不会生成包含非法模式的字符串。
    • 64. 发明申请
    • Modular and/or demand-driven string analysis of a computer program
    • 计算机程序的模块化和/或需求驱动的字符串分析
    • US20120096440A1
    • 2012-04-19
    • US12907974
    • 2010-10-19
    • Takaaki TateishiOmer TrippMarco Pistoia
    • Takaaki TateishiOmer TrippMarco Pistoia
    • G06F9/44G06F9/45
    • G06F9/4482
    • Modular and/or demand-driven string analysis of a computer program is performed. Each method of the program is encoded into monadic second-order logic (M2L) to yield a set of predicate declarations and a set of constraints. The two sets for each method are composed to yield a union set of predicate declarations and a union set of constraints for the program. The union set of constraints includes a particular set of constraints corresponding to call relationships among the methods. An M2L formula including a free variable corresponding to a program variable is added to the union set of constraints. The two union sets are processed to verify a satisfiability of the constraints in relation to an illegal pattern. Where the constraints are satisfiable, the program can generate a string containing the illegal pattern. Where the constraints are not satisfiable, the program never generates a string containing the illegal pattern.
    • 执行计算机程序的模块化和/或需求驱动的字符串分析。 程序的每个方法被编码成一元二阶逻辑(M2L),以产生一组谓词声明和一组约束。 每个方法的两个集合被组合以产生一个联合集的谓词声明和该程序的约束集合。 联合约束集包括与方法之间的呼叫关系相对应的特定一组约束。 包含与程序变量相对应的自由变量的M2L公式被添加到约束集合中。 处理两个联合集以验证与非法模式相关的约束的可满足性。 在约束满足的情况下,程序可以生成包含非法模式的字符串。 在约束不可满足的情况下,程序不会生成包含非法模式的字符串。
    • 65. 发明申请
    • CONFIDENCE-BASED STATIC ANALYSIS
    • 基于信心的静态分析
    • US20120084755A1
    • 2012-04-05
    • US12895470
    • 2010-09-30
    • Marco PistoiaOmer Tripp
    • Marco PistoiaOmer Tripp
    • G06F9/44
    • G06F11/3604
    • Systems, methods and program products are provided for confidence-based static analysis, including initiating a static analysis of computer software, associating a confidence value with a first element of the static analysis, determining a current state of the static analysis, calculating an adjusted confidence value in accordance with a confidence adjustment function as applied to the current state and the confidence value associated with the first element, associating the adjusted confidence value with a second element of the static analysis resulting from a transition from the first element, and eliminating the second element from the static analysis if the adjusted confidence value meets elimination criteria.
    • 提供系统,方法和程序产品用于基于置信度的静态分析,包括启动计算机软件的静态分析,将置信度值与静态分析的第一要素相关联,确定静态分析的当前状态,计算调整后的置信度 根据应用于当前状态的置信度调整函数和与第一元素相关联的置信度值,将调整后的置信度值与由第一元素的转变产生的静态分析的第二元素相关联,并且消除第二元素 如果调整的置信度值符合消除标准,则来自静态分析的元素。
    • 67. 发明申请
    • IDENTIFICATION OF READ/WRITE CHAINS DURING STATIC ANALYSIS OF COMPUTER SOFTWARE
    • 计算机软件静态分析期间读/写链的识别
    • US20090300266A1
    • 2009-12-03
    • US12129894
    • 2008-05-30
    • Marco PistoiaTakaaki TateishiOmer TrippOmri Weisman
    • Marco PistoiaTakaaki TateishiOmer TrippOmri Weisman
    • G06F12/00
    • G06F8/433
    • A system for identifying read/write chains in computer software, including a static analysis engine identifying within computer software logical container accesses, a string analyzer configured to at least partly resolve any variables identifying the logical container in any of the accesses by determining a set of potential values of any of the variables, and a Logical Container Access Virtualization component (LCAV) configured to identify the type and scope of any permutations of the accesses, where each of the permutations is defined by substituting any of the potential values for any of the access variables, and identify any read/write chains within the computer software by matching any of the access permutations that read from the logical container with any of the access permutations that write to the logical container if there is an intersection between the scopes of the read and write access permutations.
    • 一种用于识别计算机软件中的读/写链的系统,包括在计算机软件逻辑容器访问内识别的静态分析引擎,串行分析器,其被配置为至少部分地解析任何访问中识别逻辑容器的任何变量, 任何变量的潜在值和逻辑容器访问虚拟化组件(LCAV),其被配置为识别访问的任何排列的类型和范围,其中每个排列通过将任何潜在值替换为任何 访问变量,并通过将从逻辑容器读取的任何访问排列与写入逻辑容器的任何访问排列进行匹配,以识别计算机软件中的任何读/写链,如果读取范围之间存在交集 并写入访问排列。