Measuring coupling between coverage tasks and use thereof
    1.
    发明授权
    Measuring coupling between coverage tasks and use thereof 失效
    测量覆盖任务之间的耦合及其使用

    公开(公告)号:US08719789B2

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

    申请号:US13041453

    申请日:2011-03-07

    CPC classification number: G06F11/3676 G06F11/3684

    Abstract: Test coverage is enhanced by measuring various types of coupling between coverage tasks. The coupling measurements may be implicit coupling measurements, explicit coupling measurements, coding coupling measurements, performance coupling measurements, resource coupling measurements or the like. Coupling scores are calculated for coverage tasks and based thereon ranking of the coverage tasks or groups of coverage tasks may be determined The ranking may be utilized in selecting for which uncovered coverage task a test should be designed. The ranking may be utilized in computing a coverage measurement of a test suite. The ranking may be utilized to rank tests, based on the coverage tasks each test covers. Ranking of tests may be utilized for various purposes such as performing test selection.

    Abstract translation: 通过测量覆盖任务之间的各种类型的耦合来增强测试覆盖。 耦合测量可以是隐式耦合测量,显式耦合测量,编码耦合测量,性能耦合测量,资源耦合测量等。 计算覆盖任务的耦合分数,并且可以基于覆盖任务或覆盖任务组的等级来确定。排序可以用于选择应该设计测试的哪个未覆盖的覆盖任务。 排名可用于计算测试套件的覆盖率测量。 根据每个测试涵盖的覆盖任务,排名可以用于对测试进行排名。 测试的排名可以用于各种目的,例如执行测试选择。

    Operating system aided code coverage
    2.
    发明授权
    Operating system aided code coverage 有权
    操作系统辅助代码覆盖

    公开(公告)号:US08312433B2

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

    申请号:US12334688

    申请日:2008-12-15

    CPC classification number: G06F11/3676

    Abstract: A method, system, and computer program product for operating system (OS) aided code coverage are provided. The method includes reading context information associated with a software process in response to a context switching event in an OS, the OS initiating the reading of the context information and controlling scheduling of the software process. The method further includes determining coverage information for code implementing the software process as a function of the context information in response to the OS reading the context information, and storing the coverage information as coverage data.

    Abstract translation: 提供了一种用于操作系统(OS)辅助代码覆盖的方法,系统和计算机程序产品。 该方法包括响应于OS中的上下文切换事件读取与软件过程相关联的上下文信息,OS启动对上下文信息的读取并且控制软件过程的调度。 所述方法还包括:响应于所述OS读取所述上下文信息,确定作为所述上下文信息的函数来实现所述软件过程的代码的覆盖信息,以及将所述覆盖信息作为覆盖数据进行存储。

    Apparatus for and method of life-time test coverage for executable code
    3.
    发明授权
    Apparatus for and method of life-time test coverage for executable code 失效
    可执行代码的终身测试覆盖的装置和方法

    公开(公告)号:US08181068B2

    公开(公告)日:2012-05-15

    申请号:US12055339

    申请日:2008-03-26

    CPC classification number: G06F9/30145 G06F9/30167 G06F11/3676

    Abstract: A novel and useful apparatus for and method of associating a dedicated coverage bit to each instruction in a software system. Coverage bits are set every time the software application runs, enabling a more comprehensive and on-going code coverage analysis. The code coverage bit mechanism enables code coverage analysis for all installations of a software application, not just software in development mode or at a specific installation. Code coverage bits are implemented in either the instruction set architecture (ISA) of the central processing unit, the executable file of a software application, a companion file to the executable file or a code coverage table residing in memory of the computer system.

    Abstract translation: 一种用于将专用覆盖位与软件系统中的每条指令相关联的新颖有用的装置和方法。 每次软件应用程序运行时都会设置覆盖位,从而实现更全面和持续的代码覆盖分析。 代码覆盖位机制可以对软件应用程序的所有安装进行代码覆盖分析,而不仅仅是在开发模式下或在特定安装中的软件。 代码覆盖位在中央处理单元的指令集架构(ISA),软件应用的可执行文件,到可执行文件的伴随文件或驻留在计算机系统的存储器中的代码覆盖表中实现。

    OPERATING SYSTEM AIDED CODE COVERAGE
    4.
    发明申请
    OPERATING SYSTEM AIDED CODE COVERAGE 有权
    操作系统辅助代码覆盖

    公开(公告)号:US20100153926A1

    公开(公告)日:2010-06-17

    申请号:US12334688

    申请日:2008-12-15

    CPC classification number: G06F11/3676

    Abstract: A method, system, and computer program product for operating system (OS) aided code coverage are provided. The method includes reading context information associated with a software process in response to a context switching event in an OS, the OS initiating the reading of the context information and controlling scheduling of the software process. The method further includes determining coverage information for code implementing the software process as a function of the context information in response to the OS reading the context information, and storing the coverage information as coverage data.

    Abstract translation: 提供了一种用于操作系统(OS)辅助代码覆盖的方法,系统和计算机程序产品。 该方法包括响应于OS中的上下文切换事件读取与软件过程相关联的上下文信息,OS启动对上下文信息的读取并且控制软件过程的调度。 所述方法还包括:响应于所述OS读取所述上下文信息,确定作为所述上下文信息的函数来实现所述软件过程的代码的覆盖信息,以及将所述覆盖信息作为覆盖数据进行存储。

    Automatic Reminder for Repeating Calendar Events
    5.
    发明申请
    Automatic Reminder for Repeating Calendar Events 审中-公开
    自动提醒重复日历活动

    公开(公告)号:US20080172283A1

    公开(公告)日:2008-07-17

    申请号:US11623759

    申请日:2007-01-17

    CPC classification number: G06Q10/109 G06Q10/1093

    Abstract: Managing repeating events in a calendar application, including scheduling a series of repeating events using a calendar application executed by a computer, and configuring the calendar application to provide a reminder announcing the last event in the series as being the last event in the series.

    Abstract translation: 管理日历应用程序中的重复事件,包括使用计算机执行的日历应用程序调度一系列重复事件,以及配置日历应用程序,以提供通知系列中最后一个事件作为系列中最后一个事件的提示。

    Optimizing post-link code
    6.
    发明授权
    Optimizing post-link code 有权
    优化后链接代码

    公开(公告)号:US06966055B2

    公开(公告)日:2005-11-15

    申请号:US09798879

    申请日:2001-03-02

    CPC classification number: G06F8/443

    Abstract: A method for code optimization includes disassembling object code that has been compiled and linked, and identifying a function in the disassembled code, the function including store and restore instructions with respect to a register. The disassembled code is analyzed to locate a call to the function followed by an instruction to kill the register. The code is modified so as to eliminate the store instruction from the function when the function is invoked by the located call.

    Abstract translation: 用于代码优化的方法包括拆卸已经编译和链接的目标代码,以及识别反汇编代码中的功能,该功能包括相对于寄存器的存储和恢复指令。 分解的代码被分析以定位对该功能的调用,然后是一个杀死寄存器的指令。 修改代码,以便在定位调用调用函数时,从函数中消除存储指令。

    MEASURING COUPLING BETWEEN COVERAGE TASKS AND USE THEREOF
    7.
    发明申请
    MEASURING COUPLING BETWEEN COVERAGE TASKS AND USE THEREOF 失效
    覆盖任务之间的测量耦合及其使用

    公开(公告)号:US20120233596A1

    公开(公告)日:2012-09-13

    申请号:US13041453

    申请日:2011-03-07

    CPC classification number: G06F11/3676 G06F11/3684

    Abstract: Test coverage is enhanced by measuring various types of coupling between coverage tasks. The coupling measurements may be implicit coupling measurements, explicit coupling measurements, coding coupling measurements, performance coupling measurements, resource coupling measurements or the like. Coupling scores are calculated for coverage tasks and based thereon ranking of the coverage tasks or groups of coverage tasks may be determined The ranking may be utilized in selecting for which uncovered coverage task a test should be designed. The ranking may be utilized in computing a coverage measurement of a test suite. The ranking may be utilized to rank tests, based on the coverage tasks each test covers. Ranking of tests may be utilized for various purposes such as performing test selection.

    Abstract translation: 通过测量覆盖任务之间的各种类型的耦合来增强测试覆盖。 耦合测量可以是隐式耦合测量,显式耦合测量,编码耦合测量,性能耦合测量,资源耦合测量等。 计算覆盖任务的耦合分数,并且可以基于覆盖任务或覆盖任务组的等级来确定。排序可以用于选择应该设计测试的哪个未覆盖的覆盖任务。 排名可用于计算测试套件的覆盖率测量。 根据每个测试涵盖的覆盖任务,排名可以用于对测试进行排名。 测试的排名可以用于各种目的,例如执行测试选择。

    DETECTING AND OPTIMIZING FALSE SHARING
    8.
    发明申请
    DETECTING AND OPTIMIZING FALSE SHARING 失效
    检测和优化虚假共享

    公开(公告)号:US20110283152A1

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

    申请号:US12780904

    申请日:2010-05-16

    Abstract: Systems and methods for cache optimization are provided. The method comprises tracing objects instantiated during execution of a program code under test according to type of access by one or more threads running in parallel, wherein said tracing provides information about order in which different instances of one or more objects are accessed by said one or more threads and whether the type of access is a read operation or a write operation; and utilizing tracing information to build a temporal relationship graph (TRG) for the accessed objects, wherein the objects are represented by nodes in the TRG and at least two types of edges for connecting the nodes are defined.

    Abstract translation: 提供了缓存优化的系统和方法。 该方法包括根据由并行运行的一个或多个线程的访问类型来跟踪在执行被测程序代码期间实例化的对象,其中所述跟踪提供关于一个或多个对象的不同实例被所述一个或多个对象访问的顺序的信息, 更多线程以及访问类型是读操作还是写操作; 并且利用跟踪信息为所访问的对象建立时间关系图(TRG),其中所述对象由所述TRG中的节点表示,并且用于连接所述节点的至少两种类型的边缘被定义。

    Percolating hot function store/restores to colder calling functions
    9.
    发明授权
    Percolating hot function store/restores to colder calling functions 有权
    渗透热功能存储/恢复到较冷的调用功能

    公开(公告)号:US07036116B2

    公开(公告)日:2006-04-25

    申请号:US10097063

    申请日:2002-03-14

    CPC classification number: G06F8/443

    Abstract: A method for post-link code optimization by identifying cold caller functions of a hot callee function, and percolating store and restore instructions with respect to non-volatile registers from the callee function to the caller function.

    Abstract translation: 一种用于通过识别热被叫方功能的冷呼叫者功能的后链路代码优化的方法,以及相对于从被调用者功能到呼叫者功能的非易失性寄存器的存储和恢复指令。

    Eliminating store/restores within hot function prolog/epilogs using volatile registers
    10.
    发明授权
    Eliminating store/restores within hot function prolog/epilogs using volatile registers 失效
    使用易失性寄存器消除热功能序言/ epilogs内的存储/恢复

    公开(公告)号:US07017154B2

    公开(公告)日:2006-03-21

    申请号:US10096827

    申请日:2002-03-14

    CPC classification number: G06F8/443 G06F9/4486

    Abstract: A post-link optimization method for renaming non-volatile registers with unused volatile registers, then removing the non-volatile register store/restore instructions from a function prolog/epilog. The volatile registers are saved before each function call and restored immediately afterwards. The optimization method is worthwhile if all of the call instructions are rarely invoked relative to the function prolog/epilog. The method requires that the hot function be disassembled, but does not require the full control flow graph.

    Abstract translation: 一种用于使用未使用的易失性寄存器重命名非易失性寄存器的后链优化方法,然后从函数prolog / epilog中删除非易失性寄存器存储/恢复指令。 每个功能调用之前保存易失性寄存器,并立即恢复。 如果所有的调用指令相对于函数prolog / epilog很少被调用,那么优化方法是值得的。 该方法要求热功能被拆卸,但不需要完整的控制流程图。

Patent Agency Ranking