OFFLINE QUERIES IN SOFTWARE DEFINED NETWORKS
    2.
    发明申请
    OFFLINE QUERIES IN SOFTWARE DEFINED NETWORKS 有权
    软件定义网络中的离线查询

    公开(公告)号:US20150172185A1

    公开(公告)日:2015-06-18

    申请号:US14571778

    申请日:2014-12-16

    Abstract: Methods and systems for finding a packet's routing path in a network includes intercepting control messages sent by a controller to one or more switches in a software defined network (SDN). A state of the SDN at a requested time is emulated and one or more possible routing paths through the emulated SDN is identified by replaying the intercepted control messages to one or more emulated switches in the emulated SDN. The one or more possible routing paths correspond to a requested packet injected into the SDN at the requested time.

    Abstract translation: 用于在网络中找到分组的路由路径的方法和系统包括将由控制器发送的控制消息拦截在软件定义网络(SDN)中的一个或多个交换机上。 仿真在请求时间的SDN的状态,并且通过在被仿真的SDN中重放被拦截的控制消息给一个或多个仿真的交换机来识别通过仿真的SDN的一个或多个可能的路由路径。 一个或多个可能的路由路径对应于在请求的时间内注入到SDN中的请求的分组。

    FEEDBACK-DIRECTED RANDOM CLASS UNIT TEST GENERATION USING SYMBOLIC EXECUTION
    3.
    发明申请
    FEEDBACK-DIRECTED RANDOM CLASS UNIT TEST GENERATION USING SYMBOLIC EXECUTION 审中-公开
    使用符号执行的反馈指导的随机类别单元测试生成

    公开(公告)号:US20130091495A1

    公开(公告)日:2013-04-11

    申请号:US13646390

    申请日:2012-10-05

    CPC classification number: G06F11/3684

    Abstract: Methods and systems for generating software analysis test inputs include generating a path query to cover a target branch of a program by executing a symbolic test driver concretely and partially symbolically, where at least one symbolic expression is partially concretized with concrete values; determining whether it is feasible to execute the target branch based on whether the generated path query is satisfiable or unsatisfiable using a constraint solver; if the target branch is feasible, generating a new test driver by replacing symbolic values in the symbolic test driver with generated solution values; and if the target branch is not feasible, analyzing an unsatisfiable core to determine whether unsatisfiability is due to a concretization performed during generation of the path query.

    Abstract translation: 用于生成软件分析测试输入的方法和系统包括通过执行具体和部分符号地执行符号测试驱动程序来生成覆盖程序的目标分支的路径查询,其中至少一个符号表达式具体化为具体值; 基于所生成的路径查询是否可满足或不满足使用约束求解器来确定是否可行执行目标分支; 如果目标分支是可行的,则通过用生成的解值替换符号测试驱动器中的符号值来生成新的测试驱动器; 并且如果目标分支是不可行的,则分析不令人满意的核心以确定不满足性是否由于在生成路径查询期间执行的具体化。

    Effective Lifetime Dependency Analysis and Typestate Analysis
    4.
    发明申请
    Effective Lifetime Dependency Analysis and Typestate Analysis 审中-公开
    有效的终身依赖性分析和类比分析

    公开(公告)号:US20140289712A1

    公开(公告)日:2014-09-25

    申请号:US14199036

    申请日:2014-03-06

    CPC classification number: G06F11/3608 G06F8/433 G06F11/3624

    Abstract: Disclosed are typestate and lifetime dependency analysis methods for identifying bugs in C++ programs. Disclosed are an abstract representation (ARC++) that models C++ objects and which makes object creation/destruction, usage, lifetime and pointer operations explicit in the abstract model thereby providing a basis for static analysis on the C++ program. Also disclosed is a lifetime dependency analysis that tracks implied dependency relationships between lifetimes of objects, to capture an effective high-level abstraction for issues involving temporary objects and internal buffers, and subsequently used in the static analysis that supports typestate checking for the C++ program. Finally disclosed a framework that automatically genarates ARC++ representations from C++ programs and performs typestate checking to detect bugs that are specified as typestate automata over ARC++ representations.

    Abstract translation: 公开了用于识别C ++程序中的错误的类型和寿命依赖性分析方法。 披露的是一个抽象表示(ARC ++),用于对C ++对象进行建模,并使抽象模型中的对象创建/使用,生命周期和指针操作明确,从而为C ++程序的静态分析提供依据。 还公开了一种终身依赖关系分析,可追踪对象生命周期之间的隐含依赖关系,为涉及临时对象和内部缓冲区的问题捕获有效的高级抽象,随后用于支持C ++程序的类型检查的静态分析。 最后披露了一个框架,可以自动生成C ++程序中的ARC ++表示,并执行类型化检查,以检测通过ARC ++表示形式指定为typestate自动机的错误。

    Network Testing
    5.
    发明申请
    Network Testing 审中-公开
    网络测试

    公开(公告)号:US20140337674A1

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

    申请号:US14270445

    申请日:2014-05-06

    CPC classification number: H04L43/50 H04L41/04 H04L41/5096

    Abstract: A network testing method implemented in a software-defined network (SDN) is disclosed. The network testing method comprising providing a test scenario including one or more network events, injecting said one or more network events to the SDN using an SDN controller, and gathering network traffic statistics. A network testing apparatus used in a software-defined network (SDN) also is disclosed. The network testing apparatus comprising a testing system to provide a test scenario including one or more network events, to inject said one or more network events to the SDN using an SDN controller, and to gather network traffic statistics. Other methods, apparatuses, and systems also are disclosed.

    Abstract translation: 公开了一种在软件定义网络(SDN)中实现的网络测试方法。 网络测试方法包括提供包括一个或多个网络事件的测试场景,使用SDN控制器向SDN注入所述一个或多个网络事件,以及收集网络流量统计信息。 还公开了一种在软件定义网络(SDN)中使用的网络测试设备。 所述网络测试装置包括测试系统,以提供包括一个或多个网络事件的测试场景,以使用SDN控制器将所述一个或多个网络事件注入到所述SDN中,并且收集网络流量统计信息。 还公开了其它方法,装置和系统。

    Probabilistic model checking of systems with ranged probabilities
    6.
    发明授权
    Probabilistic model checking of systems with ranged probabilities 有权
    具有范围概率的系统概率模型检验

    公开(公告)号:US08799194B2

    公开(公告)日:2014-08-05

    申请号:US13646377

    申请日:2012-10-05

    CPC classification number: G06N7/005 G06N7/00 G06N99/005

    Abstract: Systems and methods for model checking of live systems are shown that include learning an interval discrete-time Markov chain (IDTMC) model of a deployed system from system logs; and checking the IDTMC model with a processor to determine a probability of violating one or more probabilistic safety properties. Checking the IDTMC model includes calculating a linear part exactly using affine arithmetic; and over-approximating a non-linear part using interval arithmetic.

    Abstract translation: 显示了系统和实时系统模型检查方法,其中包括从系统日志学习部署系统的间隔离散时间马尔可夫链(IDTMC)模型; 并用处理器检查IDTMC模型,以确定违反一个或多个概率安全属性的概率。 检查IDTMC模型包括使用仿射算术精确地计算线性部分; 并使用间隔算术过度近似非线性部分。

Patent Agency Ranking