会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • System and method for providing exceptional flow control in protected code through memory layers
    • 通过内存层在受保护的代码中提供卓越的流量控制的系统和方法
    • US20060037003A1
    • 2006-02-16
    • US10918130
    • 2004-08-13
    • Dean LongNedim FreskoChristopher Plummer
    • Dean LongNedim FreskoChristopher Plummer
    • G06F9/44
    • G06F9/45504G06F11/3624G06F12/0269
    • A system and method for providing exceptional flow control in protected code through memory layers. Code is generated. The generated code includes a sequence of normal operations and is subject to protection against copying during execution of the generated code. The generated code is instantiated as a master process into a master layer in a memory space. The master process is cloned by instantiating a copy of the master process as a child layer in the memory space. Execution points within the generated code are identified. A copy of at least a portion of the generated code containing each execution point as an exception layer is instantiated in the memory space. The generated code in the exception layer is patched at each identified execution point with operations exceptional to the normal operations sequence and which are performed upon a triggering of each execution point during execution of the generated code.
    • 一种用于通过存储器层在受保护代码中提供异常流控制的系统和方法。 代码生成。 生成的代码包括正常操作的顺序,并且在执行生成的代码期间受到保护以防止复制。 将生成的代码作为主进程实例化为内存空间中的主层。 通过将主进程的副本实例化为内存空间中的子层来克隆主进程。 识别生成代码内的执行点。 将包含每个执行点的生成代码的至少一部分的副本作为异常层在内存空间中被实例化。 异常层中生成的代码在每个识别的执行点处被修补,其中操作与正常操作序列异常,并且在执行生成的代码期间触发每个执行点时执行。
    • 5. 发明授权
    • Trap-based mechanism for tracking accesses of object class names
    • 用于跟踪对象类名称访问的基于陷阱的机制
    • US08769250B2
    • 2014-07-01
    • US12554595
    • 2009-09-04
    • Nedim FreskoDean R. LongJiangli Zhou
    • Nedim FreskoDean R. LongJiangli Zhou
    • G06F9/00
    • G06F12/145G06F11/3636G06F12/109G06F2212/1012G06F2212/656
    • In general, the invention relates to a method. The method includes receiving notification, which includes context information, of a trap. The method further includes accessing, based at least partially upon the context information, a particular instruction that caused the trap, determining, based at least partially upon the context information, a particular address that is to be accessed by the particular instruction, updating a set of log information to indicate accessing of the particular address, causing subsequent accesses of the particular address to not give rise to a trap, after causing subsequent accesses of the particular address to not give rise to a trap, accessing the particular address, after accessing the particular address, causing subsequent accesses of the particular address to give rise to a trap, and causing the particular instruction to not be executed.
    • 通常,本发明涉及一种方法。 该方法包括接收陷阱的通知,其包括上下文信息。 该方法还包括至少部分地基于上下文信息访问引起陷阱的特定指令,至少部分地基于上下文信息确定特定指令要访问的特定地址,更新集合 的日志信息以指示特定地址的访问,导致特定地址的后续访问不引起陷阱,在使特定地址的后续访问不引起陷阱,访问特定地址之后,在访问特定地址之后 特定地址,引起特定地址的后续访问以产生陷阱,并使特定指令不被执行。
    • 7. 发明申请
    • SHARED JAVA JAR FILES
    • 共享的JAVA JAR文件
    • US20110145358A1
    • 2011-06-16
    • US12974748
    • 2010-12-21
    • Erez LandauDean R. E. LongNedim Fresko
    • Erez LandauDean R. E. LongNedim Fresko
    • G06F15/167G06F12/08
    • G06F9/44563
    • Techniques are disclosed for sharing programmatic modules among isolated virtual machines. A master JVM process loads data from a programmatic module, storing certain elements of that data into its private memory region, and storing other elements of that data into a “read-only” area of a shareable memory region. The master JVM process copies loaded data from its private memory region into a “read/write” area of the shareable memory region. Instead of re-loading the data from the programmatic module, other JVM processes map to the read-only area and also copy the loaded data from the read/write area into their own private memory regions. The private memory areas of all of the JVM processes begin at the same virtual memory address, so references between read-only data and copied data are preserved correctly. As a result, multiple JVM processes start up faster, and memory is conserved by avoiding the redundant storage of shareable data.
    • 公开了用于在隔离的虚拟机之间共享程序化模块的技术。 主JVM进程从编程模块加载数据,将该数据的某些元素存储到其专用存储器区域中,并将该数据的其他元素存储到可共享存储器区域的“只读”区域中。 主JVM进程将加载的数据从其专用存储器区域复制到可共享内存区域的“读/写”区域。 代替从编程模块重新加载数据,其他JVM进程映射到只读区域,并将加载的数据从读/写区域复制到其自己的专用存储器区域中。 所有JVM进程的专用内存区域都从同一个虚拟内存地址开始,因此只读数据和复制的数据之间的引用被正确保存。 因此,多个JVM进程启动速度更快,并且通过避免可共享数据的冗余存储来节省内存。
    • 9. 发明申请
    • System and method for dynamically and persistently tracking incremental profiling data in a process cloning application environment
    • 用于在进程克隆应用程序环境中动态和持续跟踪增量分析数据的系统和方法
    • US20050138623A1
    • 2005-06-23
    • US10745018
    • 2003-12-22
    • Nedim Fresko
    • Nedim Fresko
    • G06F11/34G06F9/48G06F9/46
    • G06F9/4843
    • A system and method for dynamically and persistently tracking incremental profiling data in a process cloning application environment is presented. A master runtime system process is executed. A memory space of the master runtime system process is cloned as a child runtime system process responsive to a process request. The child runtime system process is executed. The execution of the child runtime system process is profiled by collecting profiling data incrementally. The child runtime system process profiles are fed back to the master runtime system process to benefit subsequent cloned child runtime system processes. In a further embodiment, the child runtime system process profiles are maintained in a persistent storage for use by the master runtime system process upon the next start up.
    • 介绍了一种用于在过程克隆应用程序环境中动态和持续跟踪增量分析数据的系统和方法。 执行主运行时系统进程。 主运行时系统进程的内存空间作为响应于进程请求的子运行时系统进程而被克隆。 执行子运行系统进程。 通过逐步收集分析数据来分析子运行时系统进程的执行情况。 将子运行时系统进程配置文件反馈到主运行时系统进程,以便受益于后续克隆的子系统进程。 在进一步的实施例中,子运行时系统进程简档被保存在永久存储器中以供下一次启动时的主运行时系统进程使用。
    • 10. 发明授权
    • System and method for reducing the footprint of preloaded classes
    • 用于减少预加载类的占用空间的系统和方法
    • US06658492B1
    • 2003-12-02
    • US09045508
    • 1998-03-20
    • Hideya KawaharaNedim Fresko
    • Hideya KawaharaNedim Fresko
    • G06F900
    • G06F9/44573
    • A method and system that reduces the space allocated for internal data structures by a runtime engine. The internal data structures store member information for preloaded classes used by applications executed by the runtime engine. The system determines the different types of internal data structures represented in the classes and identifies thee possible values of each type's members. The system next determines the amount of space required to store the values for each type in a respective value table and the number of bits needed to index each entry of that table. The system determines based on the stored information whether occurrences of a member are optimally represented as a set of value table indices and a value table or, in the conventional manner, as a general variable that stores the member's value for each occurrence. The system then emits appropriate information for the member and its parent data structure.
    • 减少由运行时引擎分配给内部数据结构的空间的方法和系统。 内部数据结构存储由运行时引擎执行的应用程序使用的预加载类的成员信息。 系统确定类中表示的不同类型的内部数据结构,并标识每种类型成员的可能值。 系统接下来确定在各个值表中存储每种类型的值所需的空间量以及索引该表的每个条目所需的位数。 系统基于所存储的信息确定成员的出现是否被最佳地表示为一组价值表索引和价值表,或者以常规方式作为存储每次出现的会员价值的一般变量。 然后系统会为该成员及其父数据结构发出适当的信息。