会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Stack of variable length operands and method for use
    • 堆栈的可变长度操作数和方法使用
    • US07302550B1
    • 2007-11-27
    • US10030106
    • 2000-07-17
    • Martin Merck
    • Martin Merck
    • G06F9/34
    • G06F7/78
    • An operand stack (10) permits optimization of memory space and a continuous check of operand type by creating a type memory (20) which stores type information for each operand, said information comprising information about the length of the operand.This length information available for each single operand permits the operands to be stored extremely densely, while the prior art uses uniform length stack elements for each operand, their length depending on the longest operand.
    • 操作数堆栈(10)允许通过创建存储每个操作数的类型信息的类型存储器(20)来优化存储器空间和对操作数类型的连续检查,所述信息包括关于操作数的长度的信息。 可用于每个单个操作数的该长度信息允许操作数被非常密集地存储,而现有技术对于每个操作数使用均匀的长度堆栈元素,其长度取决于最长操作数。
    • 3. 发明授权
    • Data carrier
    • 数据载体
    • US06793143B2
    • 2004-09-21
    • US10406315
    • 2003-07-24
    • Thomas FreyMartin Merck
    • Thomas FreyMartin Merck
    • G06K1906
    • G07F7/1008G06F9/44521G06F9/45504G06Q20/341G06Q20/35765
    • A data carrier for interpreter-based execution of an application existing in the form of an application program resulting from an object-oriented source program includes a communication device (10), and a memory device (12) containing at least one application program and an interpreter unit (15). The application program is structured in class files (22) each containing a library section (25) whose entries (46) are formed by invariable elements of the interaction context and which is structured in a sequence of equally long segments (50) each comprising a predetermined number of bytes. A certain number of segments (5) forms an entry (46). The physical position of the first segment of each entry (46) within the byte sequence is used by the interpreter unit (15) as a reference for the entry (46).
    • 用于基于面向对象的源程序生成的以应用程序形式存在的应用的基于解释器的执行的数据载体包括通信设备(10)和存储设备(12),该存储设备包含至少一个应用程序和 口译单位(15)。 应用程序被构造在类文件(22)中,每个文件包含库部分(25),其条目(46)由交互上下文的不变元素形成,并且被构造为具有同样长的段(50)的序列,每个段包括 预定字节数。 一定数量的段(5)形成条目(46)。 字节序列中的每个条目(46)的第一段的物理位置由解释器单元(15)用作条目(46)的参考。
    • 4. 发明授权
    • Method for virtually enlarging the stack of a portable data carrier
    • 用于虚拟地扩大便携式数据载体的堆叠的方法
    • US07000071B2
    • 2006-02-14
    • US10344565
    • 2001-08-21
    • Daniel CiesingerThomas FreyMartin MerckThomas Stocker
    • Daniel CiesingerThomas FreyMartin MerckThomas Stocker
    • G00F12/00
    • G07F7/1008G06Q20/3552
    • A method is proposed for virtual enlargement of the stack of a portable data carrier allowing reloading of executable program code. To permit the execution of programs requiring a larger stack than that physically present, the stack is segmented into at least two stack segments and their fill state monitored. When complete occupation of a segment is recognized, the oldest stack segment is swapped out to a further storage medium. The further storage medium is a nonvolatile read-write memory that can be a slower memory compared to the stack. When sufficient memory space is available in the stack again, the swapped out segment is returned. The method includes managing a destination address of each stack segment swapped out to the non-volatile read-write memory in a register in a volatile read-write memory.
    • 提出了一种用于虚拟放大便携式数据载体的堆栈的方法,允许重新加载可执行程序代码。 为了允许执行需要比实际存在的堆栈更大的堆栈的程序,堆栈被分段成至少两个堆栈段,并且监视它们的填充状态。 当识别到段的完全占用时,最旧的堆栈段被交换到另外的存储介质。 另外的存储介质是与堆叠相比可以是较慢存储器的非易失性读写存储器。 当栈中有足够的内存空间时,返回换出的段。 该方法包括在易失性读写存储器中的寄存器中管理交换到非易失性读写存储器的每个堆栈段的目的地址。