Automatic filter generation and generalization
    1.
    发明授权
    Automatic filter generation and generalization 有权
    自动过滤器生成和泛化

    公开(公告)号:US08316448B2

    公开(公告)日:2012-11-20

    申请号:US11925575

    申请日:2007-10-26

    IPC分类号: H04L29/06

    摘要: Methods and architectures for automatic filter generation are described. In an embodiment, these filters are generated in order to block inputs which would otherwise disrupt the normal functioning of a program. An initial set of filter conditions is generated by analyzing the path of a program from a point at which a bad input is received to the point at which the malfunctioning of the program is detected and creating conditions on an input which ensure that this path is followed. Having generated the initial set of filter conditions, the set is made less specific by determining which instructions do not influence whether the point of detection of the attack is reached and removing the filter conditions which correspond to these instructions.

    摘要翻译: 描述了自动过滤器生成的方法和体系结构。 在一个实施例中,生成这些滤波器以便阻止否则将中断程序的正常功能的输入。 通过从接收到不良输入的点到检测到程序故障的点分析程序的路径并在输入上创建条件来产生初始的过滤条件集合,以确保遵循该路径 。 在产生初始的滤波条件集之后,通过确定哪些指令不影响是否达到攻击的检测点,并且去除与这些指令相对应的滤波条件,使该集合具有较小的特定性。

    Automatic Filter Generation and Generalization
    2.
    发明申请
    Automatic Filter Generation and Generalization 有权
    自动过滤器生成和泛化

    公开(公告)号:US20090113550A1

    公开(公告)日:2009-04-30

    申请号:US11925575

    申请日:2007-10-26

    IPC分类号: G06F21/00

    摘要: Methods and architectures for automatic filter generation are described. In an embodiment, these filters are generated in order to block inputs which would otherwise disrupt the normal functioning of a program. An initial set of filter conditions is generated by analyzing the path of a program from a point at which a bad input is received to the point at which the malfunctioning of the program is detected and creating conditions on an input which ensure that this path is followed. Having generated the initial set of filter conditions, the set is made less specific by determining which instructions do not influence whether the point of detection of the attack is reached and removing the filter conditions which correspond to these instructions.

    摘要翻译: 描述了自动过滤器生成的方法和体系结构。 在一个实施例中,生成这些滤波器以便阻止否则将中断程序的正常功能的输入。 通过从接收到不良输入的点到检测到程序故障的点分析程序的路径并在输入上创建条件来产生初始的过滤条件集合,以确保遵循该路径 。 在产生初始的滤波条件集之后,通过确定哪些指令不影响是否达到攻击的检测点,并且去除与这些指令相对应的滤波条件,使该集合具有较小的特定性。

    DISTRIBUTED SYSTEM CHECKER
    3.
    发明申请
    DISTRIBUTED SYSTEM CHECKER 有权
    分布式系统检查器

    公开(公告)号:US20100125758A1

    公开(公告)日:2010-05-20

    申请号:US12272779

    申请日:2008-11-17

    IPC分类号: G06F11/34

    CPC分类号: G06F11/362

    摘要: A distributed system checker may check a distributed system against events to detect bugs in the distributed system. The events may include machines crashes, network partitions, and packet losses, for example. The distributed system checker may check a distributed system that can have multiple threads and multiple processes running on multiple nodes. To obtain control over a distributed system, a distributed system checker may insert an interposition layer between a process and the operating system on each node.

    摘要翻译: 分布式系统检查器可以根据事件检查分布式系统以检测分布式系统中的错误。 例如,事件可能包括机器崩溃,网络分区和数据包丢失。 分布式系统检查器可以检查可以在多个节点上运行多个线程和多个进程的分布式系统。 为了获得对分布式系统的控制,分布式系统检查器可以在进程和每个节点上的操作系统之间插入插入层。

    DYNAMIC INTERFACE REDUCTION FOR SOFTWARE MODEL CHECKING
    4.
    发明申请
    DYNAMIC INTERFACE REDUCTION FOR SOFTWARE MODEL CHECKING 有权
    动态界面减少软件模型检查

    公开(公告)号:US20120311542A1

    公开(公告)日:2012-12-06

    申请号:US13118489

    申请日:2011-05-30

    IPC分类号: G06F9/44

    CPC分类号: G06F11/3608 G06F8/75

    摘要: Architecture employs an iterative process that incrementally discovers inter-component interactions and explores local state spaces within each component. Thus, the architecture lazily constructs the behavior of the environment of a component in the target software system, and integrates the construction of the inter-component interactions with the model checking process itself, and hence, does not need to eagerly construct the interface process. Component-based state space reduction is applied during the exploration of the whole system. The architecture decomposes a target software system into a set of loosely coupled components where interactions between the components tend to be significantly simpler than interactions within each component. An iterative algorithm facilitates the component-based state space reduction, which is exponential, on the real large-scale software systems.

    摘要翻译: 架构采用迭代过程,逐步发现组件间交互并探索每个组件内的本地状态空间。 因此,架构懒惰地构建了目标软件系统中组件环境的行为,并将组件间交互的构建与模型检查过程本身进行了整合,因此不需要急于构建接口过程。 在整个系统的探索过程中,应用了基于组件的状态空间减少。 该架构将目标软件系统分解成一组松散耦合的组件,其中组件之间的交互往往比每个组件内的交互明显简单。 迭代算法有助于在真正的大规模软件系统上基于组件的状态空间减少,这是指数级的。

    Dynamic interface reduction for software model checking
    5.
    发明授权
    Dynamic interface reduction for software model checking 有权
    软件模型检查的动态界面缩减

    公开(公告)号:US08671396B2

    公开(公告)日:2014-03-11

    申请号:US13118489

    申请日:2011-05-30

    IPC分类号: G06F9/44

    CPC分类号: G06F11/3608 G06F8/75

    摘要: Architecture employs an iterative process that incrementally discovers inter-component interactions and explores local state spaces within each component. Thus, the architecture lazily constructs the behavior of the environment of a component in the target software system, and integrates the construction of the inter-component interactions with the model checking process itself, and hence, does not need to eagerly construct the interface process. Component-based state space reduction is applied during the exploration of the whole system. The architecture decomposes a target software system into a set of loosely coupled components where interactions between the components tend to be significantly simpler than interactions within each component. An iterative algorithm facilitates the component-based state space reduction, which is exponential, on the real large-scale software systems.

    摘要翻译: 架构采用迭代过程,逐步发现组件间交互并探索每个组件内的本地状态空间。 因此,架构懒惰地构建了目标软件系统中组件环境的行为,并将组件间交互的构建与模型检查过程本身进行了整合,因此不需要急于构建接口过程。 在整个系统的探索过程中,应用了基于组件的状态空间减少。 该架构将目标软件系统分解成一组松散耦合的组件,其中组件之间的交互往往比每个组件内的交互明显简单。 迭代算法有助于在真正的大规模软件系统上基于组件的状态空间减少,这是指数级的。

    Distributed system checker
    6.
    发明授权
    Distributed system checker 有权
    分布式系统检查器

    公开(公告)号:US07984332B2

    公开(公告)日:2011-07-19

    申请号:US12272779

    申请日:2008-11-17

    IPC分类号: G06F11/00

    CPC分类号: G06F11/362

    摘要: A distributed system checker may check a distributed system against events to detect bugs in the distributed system. The events may include machines crashes, network partitions, and packet losses, for example. The distributed system checker may check a distributed system that can have multiple threads and multiple processes running on multiple nodes. To obtain control over a distributed system, a distributed system checker may insert an interposition layer between a process and the operating system on each node.

    摘要翻译: 分布式系统检查器可以根据事件检查分布式系统以检测分布式系统中的错误。 例如,事件可能包括机器崩溃,网络分区和数据包丢失。 分布式系统检查器可以检查可以在多个节点上运行多个线程和多个进程的分布式系统。 为了获得对分布式系统的控制,分布式系统检查器可以在进程和每个节点上的操作系统之间插入插入层。

    Efficient approaches for bounded model checking
    8.
    发明授权
    Efficient approaches for bounded model checking 失效
    有限模型检查的有效方法

    公开(公告)号:US07711525B2

    公开(公告)日:2010-05-04

    申请号:US10157486

    申请日:2002-05-30

    IPC分类号: G06F17/10

    CPC分类号: G06F17/504

    摘要: A method for bounded model checking of arbitrary Linear Time Logic temporal properties. The method comprises translating properties associated with temporal operators F(p), G(p), U(p, q) and X(p) into property checking schemas comprising Boolean satisfiability checks, wherein F represents an eventuality operator, G represents a globally operator, U represents an until operator and X represents a next-time operator. The overall property is checked in a customized manner by repeated invocations of the property checking schemas for F(p), G(p), U(p, q), X(p) operators and standard handling of atomic propositions and Boolean operators.

    摘要翻译: 一种用于任意线性时间逻辑时间属性的有界模型检查的方法。 该方法包括将与时间运算符F(p),G(p),U(p,q)和X(p)相关联的属性转换成包括布尔可满足性检查的属性检查模式,其中F表示可能性运算符,G表示全局 运算符,U表示直到运算符,X表示下一运算符。 通过重复调用F(p),G(p),U(p,q),X(p)运算符的属性检查模式以及原子命题和布尔运算符的标准处理来检查整体属性。

    Incremental computing for web search
    9.
    发明授权
    Incremental computing for web search 有权
    网页搜索的增量计算

    公开(公告)号:US08560509B2

    公开(公告)日:2013-10-15

    申请号:US13178495

    申请日:2011-07-08

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30902

    摘要: Architecture that performs incremental computing for web searches by employing methods at least for storing the results of repeat queries on unchanged webpages and for computing results for the repeated queries. The architecture includes one or more algorithms for pre-computing query results on index servers, for only selectively choosing index servers whose result for a query change for a query computation process, and for re-using the unchanged web pages stored in the cache and computing results upon changed index and unchanged index separately.

    摘要翻译: 通过采用至少用于存储不变网页上的重复查询结果以及重复查询的计算结果的方法,为网页搜索执行增量计算的体系结构。 架构包括用于在索引服务器上预先计算查询结果的一种或多种算法,用于仅选择性地选择其查询计算过程的查询结果的结果的索引服务器,以及重新使用存储在高速缓存和计算中的不变网页 分别指标变动指数和不变指数。

    Handling of satisfaction and conflicts in a quantified Boolean formula solver
    10.
    发明申请
    Handling of satisfaction and conflicts in a quantified Boolean formula solver 失效
    在量化布尔公式求解器中处理满意度和冲突

    公开(公告)号:US20070179920A1

    公开(公告)日:2007-08-02

    申请号:US11328009

    申请日:2006-01-09

    申请人: Lintao Zhang

    发明人: Lintao Zhang

    IPC分类号: G06F15/18

    CPC分类号: G06N5/003

    摘要: In order to provide for more efficient QBF satisfiability determination, the formula to be checked is transformed into one formula which is equi-satisfiable, and one which is equi-tautological. The conjunction or disjunction of these two formulas, then, is used to determine satisfiability, with the result being that a determination of satisfiability is more easily achieved. A conjunctive normal form transformation of the initial formula yields a group of clauses, only one of which must be unsatisfiable for the formula to be unsatisfiable. A disjunctive normal form transformation of the initial formula yields a group of cubes, only one of which must be satisfiable in order for the formula to be determined to be satisfiable.

    摘要翻译: 为了提供更有效的QBF可满足度确定,要检查的公式被转换为一个等价可比的公式,其中一个是等价的。 然后,这两个公式的连接或分离用于确定可满足性,结果是更容易实现可满足性的确定。 初始公式的联合正态形式转换产生一组条款,其中只有一个条款必须不能令人满意,因为该公式不能令人满意。 初始公式的分离正态形式转换产生一组立方体,其中只有一个立方体必须是可满足的,以便确定公式是可满足的。