Handling loops in programs and examining feasible software behavior for detecting malicious code
    1.
    发明授权
    Handling loops in programs and examining feasible software behavior for detecting malicious code 有权
    在程序中处理循环并检查可行的软件行为以检测恶意代码

    公开(公告)号:US07945898B1

    公开(公告)日:2011-05-17

    申请号:US11477019

    申请日:2006-06-28

    CPC分类号: G06F11/3676 G06F11/3696

    摘要: The present invention is directed to automatically analyzing software systems for identifying faults or bugs and/or detection of malicious code. In various embodiments, the present invention measures code coverage for high priority invocable program elements, uses a relaxed coverage estimation technique that, instead of guaranteeing which code units will be executed, guarantees that at least a certain number of code units will be executed, determines and solves constraints in code to identify infeasible paths containing one or more selected nodes, determines, for a composite data type, a range of values for each of at least two non-composite data fields, and/or translates, prior to code analysis complex code into simpler code having fewer operators.

    摘要翻译: 本发明旨在自动分析用于识别故障或错误和/或恶意代码的检测的软件系统。 在各种实施例中,本发明测量高优先级可调节节目元素的代码覆盖率,使用宽松的覆盖估计技术,而不是保证哪些代码单元将被执行,保证将至少执行一定数量的代码单元将被执行 并且解码代码中的约束以识别包含一个或多个所选节点的不可行路径,为复合数据类型确定至少两个非复合数据字段中的每一个的值的范围,和/或在代码分析复合体之前翻译 代码变成更简单的代码,具有较少的运算符。

    Prioritize code for testing to improve code coverage of complex software
    2.
    发明授权
    Prioritize code for testing to improve code coverage of complex software 有权
    确定测试代码的优先级,以提高复杂软件的代码覆盖率

    公开(公告)号:US07886272B1

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

    申请号:US11477020

    申请日:2006-06-28

    CPC分类号: G06F11/3676 G06F11/3696

    摘要: The present invention is directed to automatically analyzing software systems for identifying faults or bugs and/or detection of malicious code. In various embodiments, the present invention measures code coverage for high priority invocable program elements, uses a relaxed coverage estimation technique that, instead of guaranteeing which code units will be executed, guarantees that at least a certain number of code units will be executed, determines and solves constraints in code to identify infeasible paths containing one or more selected nodes, determines, for a composite data type, a range of values for each of at least two non-composite data fields, and/or translates, prior to code analysis complex code into simpler code having fewer operators.

    摘要翻译: 本发明旨在自动分析用于识别故障或错误和/或恶意代码的检测的软件系统。 在各种实施例中,本发明测量高优先级可调节节目元素的代码覆盖率,使用宽松的覆盖估计技术,而不是保证哪些代码单元将被执行,保证将至少执行一定数量的代码单元将被执行 并且解码代码中的约束以识别包含一个或多个所选节点的不可行路径,为复合数据类型确定至少两个非复合数据字段中的每一个的值的范围,和/或在代码分析复合体之前翻译 代码变成更简单的代码,具有较少的运算符。

    Constraint solver to code based test data generation for improving software reliability and security
    3.
    发明授权
    Constraint solver to code based test data generation for improving software reliability and security 有权
    约束求解器到基于代码的测试数据生成,以提高软件的可靠性和安全性

    公开(公告)号:US07861226B1

    公开(公告)日:2010-12-28

    申请号:US11477043

    申请日:2006-06-28

    IPC分类号: G06F9/44 G06F9/45

    CPC分类号: G06F11/3676 G06F11/3696

    摘要: The present invention is directed to automatically analyzing software systems for identifying faults or bugs and/or detection of malicious code. In various embodiments, the present invention measures code coverage for high priority invocable program elements, uses a relaxed coverage estimation technique that, instead of guaranteeing which code units will be executed, guarantees that at least a certain number of code units will be executed, determines and solves constraints in code to identify infeasible paths containing one or more selected nodes, determines, for a composite data type, a range of values for each of at least two non-composite data fields, and/or translates, prior to code analysis complex code into simpler code having fewer operators.

    摘要翻译: 本发明旨在自动分析用于识别故障或错误和/或恶意代码的检测的软件系统。 在各种实施例中,本发明测量高优先级可调节节目元素的代码覆盖率,使用宽松的覆盖估计技术,而不是保证哪些代码单元将被执行,保证将至少执行一定数量的代码单元将被执行 并且解码代码中的约束以识别包含一个或多个所选节点的不可行路径,为复合数据类型确定至少两个非复合数据字段中的每一个的值的范围,和/或在代码分析复合体之前翻译 代码变成更简单的代码,具有较少的运算符。