会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Scalable rundown protection for object lifetime management
    • 可扩展的防范对象生命周期管理
    • US07571288B2
    • 2009-08-04
    • US11480799
    • 2006-07-03
    • Ravisankar PudipeddiNeill CliftNeal R. Christiansen
    • Ravisankar PudipeddiNeill CliftNeal R. Christiansen
    • G06F12/00
    • G06F12/0261
    • Object rundown protection that scales with the number of processors in a shared-memory computer system is disclosed. Prior to object rundown, a cache-aware reference count data structure is used to prevent cache-pinging that would otherwise result from data sharing across processors in a multiprocessor computer system. In this data structure, a counter of positive references and negative dereferences, aligned on a particular cache line, is maintained for each processor. When an object is to be destroyed, a rundown wait process is begun, during which new references on the object are prohibited, and the total number of outstanding references is added to an on-stack global counter. Destruction is delayed until the global reference count is reduced to zero. In an implementation on non-uniform memory access multiprocessor machines, each processor's reference count is additionally allocated in a region of main memory that is physically close to that processor.
    • 公开了与共享存储器计算机系统中的处理器数量相比较的对象破坏保护。 在对象清除之前,使用缓存感知引用计数数据结构来防止否则会在多处理器计算机系统中的处理器之间的数据共享导致的缓存ping。 在这种数据结构中,为每个处理器维护在特定高速缓存线上对齐的正引用和负解除引用的计数器。 当一个对象被销毁时,就会开始一个破坏的等待过程,在这个过程中,对对象的新引用被禁止,并且未完成引用的总数被添加到一个堆栈全局计数器中。 破坏延迟,直到全局引用计数减少为零。 在非均匀内存访问多处理器机器上的实现中,每个处理器的引用计数额外分配在物理上靠近该处理器的主存储器的区域中。
    • 2. 发明申请
    • Identifying malware that employs stealth techniques
    • 识别使用隐身技术的恶意软件
    • US20070101431A1
    • 2007-05-03
    • US11263599
    • 2005-10-31
    • Neill CliftThushara Wijeratna
    • Neill CliftThushara Wijeratna
    • G06F12/14
    • G06F21/56
    • A method, software system, and computer-readable medium are provided for determining whether a malware that implements stealth techniques is resident on a computer. In one exemplary embodiment, a method is provided that obtains a first set of data that describes the processes that are reported as being active on the computer in a non-interrupt environment. Then, the method causes program execution to be interrupted at runtime so that an analysis of the active processes on the computer may be performed. After program execution is interrupted, a second set data that describes the processes that are reported as being active on the computer in a interrupt environment is obtained. By performing a comparison between the first and second sets of data, a determination may be made regarding whether the collected data contains inconsistencies that are characteristic of malware.
    • 提供了一种方法,软件系统和计算机可读介质,用于确定实施隐形技术的恶意软件是否驻留在计算机上。 在一个示例性实施例中,提供了一种方法,其获得在非中断环境中描述在计算机上被报告为活动的进程的第一组数据。 然后,该方法使得程序执行在运行时被中断,从而可以对计算机上的活动进程进行分析。 在程序执行中断之后,获得描述在中断环境中报告为在计算机上被激活的进程的第二组数据。 通过执行第一和第二组数据之间的比较,可以确定收集的数据是否包含恶意软件的特征的不一致。
    • 5. 发明授权
    • Identifying malware that employs stealth techniques
    • 识别使用隐身技术的恶意软件
    • US07743418B2
    • 2010-06-22
    • US11263599
    • 2005-10-31
    • Neill CliftThushara K. Wijeratna
    • Neill CliftThushara K. Wijeratna
    • G06F12/14G06F7/04G08B23/00
    • G06F21/56
    • A method, software system, and computer-readable medium are provided for determining whether a malware that implements stealth techniques is resident on a computer. In one exemplary embodiment, a method is provided that obtains a first set of data that describes the processes that are reported as being active on the computer in a non-interrupt environment. Then, the method causes program execution to be interrupted at runtime so that an analysis of the active processes on the computer may be performed. After program execution is interrupted, a second set data that describes the processes that are reported as being active on the computer in a interrupt environment is obtained. By performing a comparison between the first and second sets of data, a determination may be made regarding whether the collected data contains inconsistencies that are characteristic of malware.
    • 提供了一种方法,软件系统和计算机可读介质,用于确定实施隐形技术的恶意软件是否驻留在计算机上。 在一个示例性实施例中,提供了一种方法,其获得在非中断环境中描述在计算机上被报告为活动的进程的第一组数据。 然后,该方法使得程序执行在运行时被中断,从而可以对计算机上的活动进程进行分析。 在程序执行中断之后,获得描述在中断环境中报告为在计算机上被激活的进程的第二组数据。 通过执行第一和第二组数据之间的比较,可以确定收集的数据是否包含恶意软件的特征的不一致。
    • 6. 发明申请
    • One-time initialization
    • 一次初始化
    • US20070266386A1
    • 2007-11-15
    • US11432888
    • 2006-05-12
    • Arun KishanNeill Clift
    • Arun KishanNeill Clift
    • G06F9/46
    • G06F9/4806
    • Aspects of the present invention are directed at providing safe and efficient ways for a program to perform a one-time initialization of a data item in a multi-threaded environment. In accordance with one embodiment, a method is provided that allows a program to perform a synchronized initialization of a data item that may be accessed by multiple threads. More specifically, the method includes receiving a request to initialize the data item from a current thread. In response to receiving the request, the method determines whether the current thread is the first thread to attempt to initialize the data item. If the current thread is the first thread to attempt to initialize the data item, the method enforces mutual exclusion and blocks other attempts to initialize the data item made by concurrent threads. Then, the current thread is allowed to execute program code provided by the program to initialize the data item.
    • 本发明的方面旨在为程序在多线程环境中执行数据项的一次初始化提供安全和有效的方式。 根据一个实施例,提供了一种允许程序执行可被多个线程访问的数据项的同步初始化的方法。 更具体地说,该方法包括从当前线程接收初始化数据项的请求。 响应于接收到请求,该方法确定当前线程是否是尝试初始化数据项的第一线程。 如果当前线程是尝试初始化数据项的第一个线程,则该方法会强制执行互斥,并阻止其他尝试初始化由并发线程创建的数据项。 然后,允许当前线程执行程序提供的程序代码来初始化数据项。
    • 7. 发明申请
    • Controlling the isolation of an object
    • 控制对象的隔离
    • US20070130621A1
    • 2007-06-07
    • US11294835
    • 2005-12-06
    • Adrian MarinescuNeill Clift
    • Adrian MarinescuNeill Clift
    • H04L9/32G06F12/14G06F11/00G06K9/00G06F17/30G06F12/16G06F7/04G06F15/18G08B23/00
    • G06F21/6281G06F21/52G06F2221/2147G06F2221/2149
    • Generally described, a method, software system, and computer-readable medium are provided for preventing a malware from colliding on a named object. In accordance with one aspect, a method is provided for creating a private namespace. More specifically, the method includes receiving a request to create a private namespace that contains data for defining the boundary of the private namespace from the current process. Then a determination is made regarding whether a principle associated with the current process has the security attributes that are alleged in the request. In this regard, if the principle that is associated with the current process has the security attributes that are alleged in the request, the method creates a container object to implement the private namespace that is defined by the data received in the request.
    • 通常描述,提供了一种方法,软件系统和计算机可读介质,用于防止恶意软件与命名对象冲突。 根据一个方面,提供了一种创建私有命名空间的方法。 更具体地,该方法包括接收创建私有命名空间的请求,该私有命名空间包含用于从当前进程定义私有命名空间的边界的数据。 然后确定与当前进程相关联的原则是否具有在请求中被指称的安全属性。 在这方面,如果与当前进程相关联的原则具有在请求中声称的安全属性,则该方法将创建一个容器对象来实现由请求中接收的数据定义的私有命名空间。
    • 10. 发明申请
    • Conditional variables without spinlocks
    • 没有自旋锁的条件变量
    • US20060048149A1
    • 2006-03-02
    • US10932475
    • 2004-09-01
    • Neill Clift
    • Neill Clift
    • G06F9/46
    • G06F9/52G06F9/526
    • The use of spinlocks is avoided in the combination of mutex and condition variables by using any suitable atomic compare and swap functionality to add a thread to a list of waiting threads that waits for a data event to occur. Various embodiments of the present invention also provide an organization scheme of data, which describes an access bit, an awaken count, and a pointer to the list of waiting threads. This organization scheme of data helps to optimize the list of waiting threads so as to better awaken a waiting thread or all waiting threads at once.
    • 通过使用任何合适的原子比较和交换功能将线程添加到等待数据事件发生的等待线程的列表中,在互斥体和条件变量的组合中避免使用自旋锁。 本发明的各种实施例还提供数据的组织方案,其描述访问位,唤醒计数和指向等待线程列表的指针。 这种数据组织方案有助于优化等待线程列表,以便一次更好地唤醒等待线程或所有等待线程。