US 6,880,155 B2Grant
Token-based linking
Issue Date:2005-04-12
•75 Claims
•30 Drawing Sheets
Abstract
A system links architecture neutral code downloaded to a resource constrained computer. The code may be separated into one or more packages having one or more referenceable items. The system maps the one or more referenceable items into corresponding one or more tokens; orders the tokens to correspond to a run-time mode; downloads the packages to the resource constrained computer; and links the packages into an executable code using the ordered tokens.
Metadata
Assignee
- Sun Microsystems, Inc.
Inventors
- Judith E. Schwabe
- Joshua B. Susser
Application Information
Application Number:US 09/243,108
Filing Date:1999-02-02
Priority Date:1999-02-02
Art Unit:2124
Patent Drawings (30 sheets)
Description
Cross Reference to Related Applications
[00002] U.S. patent application Ser. No. 09/243,101, filed Feb. 2, 1999, in the names of inventors Judith E. Schwabe and Joshua Susser, entitled “Object-Oriented Instruction Set for Resource-Constrained Devices”, commonly assigned herewith;
[00003] U.S. patent application Ser. No. 09/243,107, filed Feb. 2, 1999, in the names of inventors Judith E. Schwabe and Joshua Susser, entitled “Zero Overhead Exception Handling”, commonly assigned herewith;
[00004] U.S. patent Ser. No. 10/664,216, entitled “Virtual Machine with Securely Distributed Bytecode Verification” by inventors Moshe Levy and Judith E, Schwabe, filed on Sep. 16, 2003, which is a continuation of U.S. patent Ser. No. 10/283,305, now U.S. Pat. No. 6,640,279, entitled “Virtual Machine with Securely Distributed Bytecode Verification” by inventors Moshe Levy and Judith E. Schwabe, filed on Oct. 30, 2002, which is a continuation of U.S. patent Ser. No. 09/547,225, now U.S. Pat. No. 6,546,454, entitled “Virtual Machine with Securely Distributed Bytecode Verification” by inventors Moshe Levy and Judith E. Schwabe, filed on Apr. 11, 2000, which is a continuation of parent application Ser. No. 08/839,621, now U.S. Pat. No. 6,092,147, filed Apr. 15, 1997 entitled “Virtual Machine with Securely Distributed Bytecode Verification” by inventors Moshe Levy and Judith E. Schwabe, commonly assigned herewith; and
[00005] In addition, an Appendix A entitled “Java Card Virtual Machine Specification: Java Card™ Version 2.1” is attached to this application and forms a part of the present specification.
[00006] A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent disclosure as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all copyright rights whatsoever.
Background
[00007] The present invention relates, in general, to object-oriented, architecture-neutral programs for use with resource-constrained devices such as smart cards and the like.
[00008] A virtual machine is an abstract computing machine generated by a software application or sequence of instructions which is executed by a processor. The term “architecture-neutral” refers to programs, such as those written in the Java™ programming language, which can be executed by a virtual machine on a variety of computer platforms having a variety of different computer architectures. Thus, for example, a virtual machine being executed on a Windows™-based personal computer system will use the same set of instructions as a virtual machine being executed on a UNIX™-based computer system. The result of the platform-independent coding of a virtual machine's sequence of instructions is a stream of one or more bytecodes, each of which is, for example, a one-byte-long numerical code.
[00009] Use of the Java programming language has found many applications including, for example, those associated with Web browsers.
[00010] The Java programming language is object-oriented. In an object-oriented system, a “class” describes a collection of data and methods that operate on that data. Taken together, the data and methods describe the state of and behavior of an object.
[00011] The Java programming language also is verifiable such that, prior to execution of an application written in the Java programming language, a determination can be made as to whether any instruction sequence in the program will attempt to process data of an improper type for that bytecode or whether execution of bytecode instructions in the program will cause underflow or overflow of an operand stack.
[00012] A Java™ virtual machine executes virtual machine code written in the Java programming language and is designed for use with a 32-bit architecture. However, various resource-constrained devices, such as smart cards, have an 8-bit or 16-bit architecture.
[00013] Smart cards, also known as intelligent portable data-carrying cards, generally are made of plastic or metal and have an electronic chip that includes an embedded microprocessor to execute programs and memory to store programs and data. Such devices, which can be about the size of a credit card, typically have limited memory capacity. For example, some smart cards have less than one kilo-byte (1K) of random access memory (RAM) as well as limited read only memory (ROM), and/or non-volatile memory such as electrically erasable programmable read only memory (EEPROM).
[00014] Generally, programs running on a processor of a smart card determine the services offered by the card. As time passes, the programs on the card may need to be updated, for example in order to add a new function or to improve an existing function. To this end, the card should be able to accept new programs which may replace other programs.
[00015] Typically a virtual machine executing byte code (e.g., a full Java virtual machine) requires a sizable amount of memory in loading bytecode and resolving references. Particularly, in the Java virtual machine, symbolic references are used to refer to program elements such as the classes, methods and fields. A Reference to these program elements is resolved by locating the element using its symbolic name. Such operations require a relatively large random access memory (RAM). In an environment that has little RAM, this may not be feasible. Since smart cards are cost-sensitive, they rely on inexpensive, low performance processors and low capacity memory devices. Since cost and power reasons dictate that low-power and low-capacity processor and memory components be deployed in such resource constrained computers, the ability to operate the Java virtual machine on such resource constrained devices is both difficult and yet desirable.
Summary
[00016] In one aspect, a method downloads code to a resource constrained computer. The code is separable into at least one package having at least one referenceable item. The method includes forming the package; forming a mapping of the referenceable item to a corresponding token; and providing the package and the mapping.
[00017] In a second aspect, a method links code downloaded to a resource constrained computer. The method includes receiving the package; receiving a mapping of the referenceable item to a corresponding token; and linking the package using the mapping.
[00018] Advantages of the invention may include one or more of the following. The invention efficiently uses resource on a resource limited device by using smaller storage spaces through unique token identifiers. Further, the invention can link and resolve references to exported items on the resource limited device. Through metadata files such as export files, the invention allows exported elements to be published. Such publication, however, can be done so as to not expose private or proprietary elements and details of the applets and associated libraries. Thereby, various separately developed applications can be loaded onto a resource limited device and share their components with each other without compromising private secure information.
[00019] Moreover, the advantages of an architecture neutral language such as Java can be realized on a resource limited device while preserving its semantics. The tokens may also be used for internal or private elements. Thus, tokens can be assigned to private and package visible instance fields as well as package visible virtual methods. The invention imposes few constraints in assigning tokens, and the token categories may be further defined or optimized for particular applications. As such, the invention supports portable, architecture neutral code that is written once and that runs everywhere, even on resource constrained devices such as smart cards with limited storage capacity.
Drawings
[00020] FIG. 1 illustrates the conversion and loading of hardware platform-independent code onto a smart card.
[00021] FIG. 2 shows a computer system which communicates with the smart card of FIG. 1.
[00022] FIG. 3 shows a diagram illustrating inter-package dependencies.
[00023] FIGS. 4A and 4B are diagrams illustrating two converter operations.
[00024] FIG. 5 is a diagram illustrating two packages and a package registry for resolving static references.
[00025] FIG. 6 is a flowchart illustrating a linking process in conjunction with the packages of FIG. 5.
[00026] FIGS. 7A-7I are diagrams illustrating various class, field and method references.
[00027] FIGS. 8A-8I are flowcharts illustrating processes for assigning tokens and supporting tables.
[00028] FIGS. 9A-9C are flowcharts illustrating processes for resolving tokens for instance fields and methods.
Description
[00029] A method is described for representing linking information for object-oriented programs in a compact, secure format. Utilizing this method, said programs can be downloaded, linked and executed on a resource-constrained device. Resource-constrained devices are generally considered to be those that are restricted in memory and/or computing power or speed. Although the particular implementation discussed below is described in reference to a smart card, the invention can be used with other resource-constrained devices including, but not limited to, cellular telephones, boundary scan devices, field programmable devices, personal data assistants (PDAs) and pagers, as well as other small or miniature devices. In some cases, the resource-constrained device may have as little as 1K of RAM or as little as 16K of ROM. Similarly, some resource-constrained devices are based on an architecture designed for fewer than 32 bits. For example, some of the resource-constrained devices which can be used with the invention are based on an 8-bit or 16-bit architecture, rather than a 32-bit architecture.
[00030] Referring to FIG. 1 , development of an applet for a resource-constrained device, such as a smart card 40, begins in a manner similar to development of a Java program. In other words, a developer writes one or more Java classes and compiles the source code with a Java compiler to produce one or more class files 10. The applet can be run, tested and debugged, for example, on a workstation using simulation tools to emulate the environment on the card 40. When the applet is ready to be downloaded to the card 40, the class files 10 are converted to a converted applet (CAP) file 16 by a converter 14. The converter 14 can be a Java application being executed by a desktop computer. The converter 14 can accept as its input one or more export files 12 in addition to the class files 10 to be converted. An export file 12 contains naming or linking information for the contents of other packages that are imported by the classes being converted.
[00031] In general, the CAP file 16 includes all the classes and interfaces defined in a single Java package and is represented by a stream of 8-bit bytes. All 16-bit and 32-bit quantities are constructed by reading in two or four consecutive 8-bit bytes, respectively. Among other things, the CAP file 16 includes a constant pool component (or “constant pool”) 18 which is packaged separately from a methods component 20. The constant pool 18 can include various types of constants including method and field references which are resolved either when the program is linked or downloaded to the smart card 40 or at the time of execution by the smart card. The methods component 20 specifies the application instructions to be downloaded to the smart card 40 and subsequently executed by the smart card. Further details of the structure of an exemplary CAP file 16 are discussed in the attached Appendix A at pages 53 through 94.
[00032] After conversion, the CAP file 16 can be stored on a computer-readable medium 17 such as a hard drive, a floppy disk, an optical storage medium, a flash device or some other suitable medium. Or the computer-readable medium can be in the form of a carrier wave, e.g., a network data transmission, or a radio frequency (RF) data link.
[00033] The CAP file 16 then can be copied or transferred to a terminal 22 such as a desktop computer with a peripheral card acceptance device (CAD) 24. The CAD 24 allows information to be written to and retrieved from the smart card 40. The CAD 24 includes a card port (not shown) into which the smart card 40 can be inserted. Once inserted, contacts from a connector press against the surface connection area on the smart card 40 to provide power and to permit communications with the smart card, although, in other implementations, contactless communications can be used. The terminal 22 also includes an installation tool 26 which loads the CAP file 16 for transmission to the card 40.
[00034] The smart card 40 has an input/output (I/O) port 42 which can include a set of contacts through which programs, data and other communications are provided. The card 40 also includes an installation tool 46 for receiving the contents of the CAP file 16 and preparing the applet for execution on the card 40. The installation tool 46 can be implemented, for example, as a Java program and can be executed on the card 40. The card 40 also has memory, including volatile memory such as RAM 50. The card 40 also has ROM 52 and non-volatile memory, such as EEPROM 54. The applet prepared by the controller 44 can be stored in the EEPROM 54.
[00035] In one particular implementation, the applet is executed by a virtual machine 49 running on a microprocessor 48. The virtual machine 49, which can be referred to as the Java Card virtual machine, need not load or manipulate the CAP file 16. Rather, the Java Card virtual machine 49 executes the applet code previously stored as part of the CAP file 16. The division of functionality between the Java Card virtual machine 49 and the installation tool 46 allows both the virtual machine and the installation tool to be kept relatively small.
[00036] In general, implementations and applets written for a resource-constrained platform such as the smart card 40 follow the standard rules for Java platform packages. The Java virtual machine and the Java programming language are described in T. Lindholm et al., The Java Virtual Machine Specification (1997), and K. Arnold et al., The Java Programming Language Second Edition, (1998), which are incorporated herein by reference in their entirety. Application programming interface (API) classes for the smart card platform can be written as Java source files which include package designations, where a package includes a number of compilation units and has a unique name. Package mechanisms are used to identify and control access to classes, fields and methods. The Java Card API allows applications written for one Java Card-enabled platform to run on any other Java Card-enabled platform. Additionally, the Java Card API is compatible with formal international standards such as ISO 7816, and industry-specific standards such as Europay/MasterCard/Visa (EMV).
[00037] Although a virtual machine 49 running on a microprocessor 48 has been described as one implementation for executing the bytecodes on the smart card 40, in alternative implementations, an application-specific integrated circuit (ASIC) or a combination of a hardware and firmware can be used instead.
[00038] Referring to FIG. 1 , controller 44 uses an installation tool 46 for receiving the contents of the CAP file 16 and preparing the applet to be executed by a processor 48. The installation tool 46 can be implemented, for example, as a Java program which has been suitably converted to execute on the smart card 40. In the description below, it is assumed that the controller 44 comprises a virtual machine program 49 running on a microprocessor 48. The virtual machine 9 need not load or manipulate the CAP file 16. Rather, the virtual machine 49 executes the applet code in the CAP file 16. The division of functionality between the virtual machine 49 and the installation tool 46 allows both the virtual machine and the installation tool to be kept relatively small. In alternative implementations, the controller 44 can be hardwired, for example, as an application-specific integrated circuit (ASIC) or it can be implemented as a combination of a hardware and firmware.
[00039] The smart card platform, which can be used for other resource-constrained devices as well, supports dynamically created objects including both class instances and arrays. A class is implemented as an extension or subclass of a single existing class and its members are methods as well as variables referred to as fields. A method declares executable code that can be invoked and that passes a fixed number of values as arguments. Classes also can implement Java interfaces. An interface is a reference type whose members are constants and abstract methods. The virtual machine 49 may include an interpreter or native implementation which provides access to a runtime system which includes the Java Card API and supporting functionalities.
[00040] As shown in FIG. 2 , a computer 221 is equipped with a card acceptance device 24 for receiving the card 40 of FIG. 1. The computer 22 may be connected to a network 45 which communicates with a plurality of other computing devices, such as a server 47. It is possible to load data and software onto a smart card over the network 45 using card equipped devices. Downloads of this nature can include applets or other programs to be loaded onto a smart card as well as digital cash and other information used in accordance with a variety of electronic commerce and other applications. The instructions and data used to control processing elements of the card acceptance device and of the smart card may be stored in volatile or non-volatile memory or may be received directly over a communications link e.g., as a carrier wave containing the instructions and/or data. Further, for example, the network 45 can be a LAN or a WAN such as the Internet or other network.
[00041] FIG. 3 shows a diagram illustrating typical hierarchical dependencies among a group of program packages (including both Application Program Interfaces (APIs) and program applets) loaded onto a smart card 40. Applications may be loaded onto the smart card 40 incrementally and linked on-card for execution so that the functionality of the smart card 40 may be updated with additional capabilities in addition to factory-programmed functionalities. In the diagram, a Java language framework 50 and a Java Card framework 52 exist at a Java Card API level. Above the Java Card API level is a custom API level with one or more custom frameworks 54. The custom framework 54 may be supplied by one or more value added providers through various software development kits (SDKs) to extend an existing framework or other API. At the highest level is an application level where various applets 56, 58 and 60 reside.
[00042] As shown in FIG. 3 , a package may depend on other packages at the same API level or from those packages in lower API levels. For example, the applet 58 may refer to program elements in the applet 58 and the Java Card framework 52 may have dependencies from the Java language framework 50. Moreover, the custom framework 54 at the custom API level and the applets 58 and 60 may have references that depend from the Java Card framework 52. In turn, the applets 56 and 58 may have references that depend from the custom framework 54. The applet 56 and the custom framework 54 may also depend from the Java language framework 50. Although the example of FIG. 3 shows linear dependencies, non-linear dependencies such as circular dependencies may be supported using a suitable converter 14 and installation tool 46.
[00043] The conversion of a set of class files from, e.g., a Java application, to a CAP file 74 can generally occur on a desktop computer in preparation for installation on a smart card 40. The desktop computer 22 is generally not as resource constrained as a typical smart card 40. Additionally, the converting operation may be conducted on other suitable platforms as well.
[00044] FIG. 4A shows a system for converting a package, which may define an applet or a library in preparation for downloading onto smart card 40. Converter 72 receives data input from one or more class files 70, which define the functionality of an applet. The converter 72 in turn generates a Java Card CAP file 74 suitable for downloading.
[00045] As discussed in greater detail below, the CAP file 74 contains an export component 82 for resolving references to elements in its package, where those elements may be referenced by other packages. The export component 82 contains entries for static items such as classes, methods and fields. References to dynamic items such as instance fields, virtual methods and interface methods are not required to be presented in the export component, but may be handled according to processes described below.
[00046] In resource constrained devices, the use of Unicode strings to represent items consumes memory and processor resources. In place of strings, the export component 82 maps tokens, or simple unique numerical values, to particular elements defined in other components in the CAP file 74. The token values used to represent these elements in the export component match those published in a corresponding Export File 80.
[00047] In more detail, CAP file 74 has, among others, a header component 76, a constant pool 78, a method component 80, and an export component 78. The constant pool 78 typically includes one or more class, field and method references so that generally references to program elements or items are made indirectly through the package's constant pool 78. Method component 80 contains all the methods implemented by the applet package represented by CAP file 74. Method references resolve to methods located in the method component. Class and static field references resolve to locations in class components and static field components, respectively. These are described further in Appendix A.
[00048] Export component 78 includes one or more entries with a token value 84 and corresponding program element link information 86 that describes where in the package defined in the CAP file A 74 a particular program element is to be found. The link information is specific to the content of the CAP file 74, not the internal representation on a particular card. This component, therefore, does not describe card-specific private or secure information.
[00049] Converter 72 can also generate an Export file 80 during conversion of class files into a CAP file 74. One Export file is generated for each CAP file. Export file 80 typically has one or more entries with a symbolic name 90 for a particular program element in CAP file 74 and its corresponding token value 92. Export file 80 provides information about each externally accessible program element of the package of class files and program information in CAP file 74 that may be referenced (imported) by a second package into a second CAP file (described further below). For example, Export file 80 contains references to all of the public classes and interfaces defined in one Java package, and all of the public and protected fields and methods defined in those classes and interfaces. The Export file 80 also contains a mapping of these program elements or items to tokens which can then be used to map names for imported items to tokens during package conversion. The export file does not expose private or proprietary details of the applets and associated libraries. Thereby, various separately developed applications can be loaded onto a resource limited device and share their components with each other without compromising private secure information. The Export file 80 does not expose private or proprietary elements and details of the applets and associated libraries, separately developed applications can be loaded onto the card 40 and share their exported elements with each other without compromising private secure information.
[00050] With reference to FIGS. 3 and 4A , if a number of class files 70 comprising javacard.framework API 52 were being converted, the Export file 80 generated during conversion would allow other applet programs, being converted separately, to know which tokens to use in order to externally reference items of the javacard.framework.API. For instance, if an applet references the framework class PIN, the Export file 80 for the javacard.framework contains an entry for class javacard.framework.PIN along with its respective token. Converter 72 would place this token in the constant pool of the CAP file of the new applet, to represent an unresolved reference to that class in the framework. As explained further below, during applet execution, the token can be used to locate the referenced item in the export component 78 of the framework API package to retrieve the element link information. For example, the link information of a method may provide information to locate the appropriate method contained in the method component 80 of that package.
[00051] FIG. 4B shows converter 72 converting a second package of class files 94, where those class files 94 import elements from the class files from the first package 70 (FIG. 4A). For example, the second package can be a set of applet classes that rely upon certain classes contained, e.g., in a javacard.framework library package, that has been previously converted (as described above with respect to FIG. 4A). Converter 72 receives data input from class files 94 and from one or more Export files 80 from previously converted packages. Converter 72 generates a CAP file 100 suitable for downloading onto, e.g., the smart card 40.
[00052] CAP file B 100 for the second package includes an import component 104 with a list of all packages referenced by the applet classes. Each such external package reference comprises a mapping 106 between an internal package token and an external unique Application Identifier (AID) for that package. Each package token is used in other components within CAP file 100 to identify a particular referenced external package in a concise manner, thereby reducing the footprint size of the representation of the applet.
[00053] The CAP file 100 also has, among others, a header component 102, an import component 104 and a constant pool 108. The constant pool 108 includes one or more class references 110, which map each class reference with corresponding package tokens, and class tokens, thereby mapping the specified class to its corresponding external package and class within that package. The use of these tokens is further described below. The constant pool 108 can also include one or more method references 112 which similarly map each method reference with corresponding package tokens, class tokens and method tokens. The constant pool 108 can also include one or more field references 114, each with its package token, class token, and field token, respectively.
[00054] Generally, references to program elements or items are made indirectly through the constant pool 108 of each package. References to items in other packages are called external, and are represented in terms of tokens. References to items in the same CAP file are called internal, and can be represented either in terms of tokens, or in a different internal format (such as pointers to locations within the CAP file). For example, the external reference 110 to a class is composed of a package token and a class token. Together those tokens specify a certain class in a certain external package. An internal reference to a class may be a pointer to the class structure's location within the CAP file. Alternatively, the external token system can be used internally as well. The external references 112-114 refer to a static class member, either a field or method, with a package token, a class token, and a token for the static field or static method. An internal reference to a static class member may be a pointer to the item's location in the CAP file, but can also use the token system. References to instance fields, virtual methods and interface methods consist of a class reference and a token of the appropriate type. The class reference indicates whether the reference is external or internal.
[00055] External references in a CAP file can be resolved on a card from token form into the internal representation used by the Java Card virtual machine. A token can only be resolved in the context of the package which defines it. Just as the export file maps from a package's externally visible names to tokens, there is a set of link information for each package on the card that maps from tokens to resolved references. In this manner, the converter 97 processes both the class files 92 and Export file 94, creating an image suitable for downloading the applet onto a resource limited device and resolving references (linking) to the first package.
[00056] After the pre-processing performed in FIGS. 4A and 4B , the CAP file of FIG. 4B may be downloaded to the smart card 40 or a resource constrained device that contains the CAP file of FIG. 4A. FIGS. 5 and 6 illustrate in greater detail how token-based linking is done for static elements on the smartcard 40 or a small device. The static elements include elements whose exact representations are identifiable by the converter during the conversion process.
[00057] In FIG. 5 , an image 200 of a package P2 has been loaded from, e.g., CAP File B 100, onto card 40 and can be linked to a prior package P1 prior to or during execution. Program elements in package P2200 may include references to methods and other data in external package P1 which already exists as an image 174 on card 40 (of CAP File A 74). The image 174 includes, among other things, a header component 176, a constant pool 178, a method component 180, and an export component 182 which contains a list of tokens for all exported static items 185. To aid the resolution of the reference to an external package, a package registry 120 is created on card 40 to provide information used to locate one or more external packages, including image 174 of package P1 which contains particular methods required by image 200 of the package P2.
[00058] The image 200 of the package P2 includes, among other things, a header component 202, an import component 204, a constant pool 208, and a method component 216, all corresponding to the respective components 102, 104, 108, and 116 in CAP file B 100. The general organization of these components is described above with respect to the CAP files and in Appendix A. Typically, the method component 216 will include program references such as “new” (218), “invokestatic” (220) and “getstatic_b” (222) along with their respective invoked class references, method references, and field references.
[00059] FIG. 6 shows a link process 140 for package P2200 of FIG. 5. When an executing method in method component 216 invokes a particular method, e.g., Method T, in method component 180 that is located in an external package (package 1), linking is required (step 142). Using the index provided as an operand to the instruction, the process 140 locates and retrieves in constant pool 208 the matching method reference 212 (step 144). As described below, the method reference consists of a package token, class token, and method token which are used to locate that particular method in an external package. Next, process 140 examines the import component 204 to find the unique AID of external package P1 based on the retrieved package token (step 146). Package registry 120 is then examined to find the location of the package P1 based upon the AID (step 148). Once the image 174 for package P1 is found from package registry 120, export component 182 of image 174 is searched to locate the class with the specified class token (step 150). The program link information for the desired method, e.g., Method T, is then found by searching the list of methods associated with the particular class found in step 150, to locate the method with the specified method token (here method token Y corresponds to Method T of package P1174) (step 152). Finally, the location of the specified method, e.g., Method T, in method component 180 is determined based on the link information provided for the method in the export component 182 (step 154).
[00060] Using the process of FIG. 6 , a package may be downloaded onto a card and prepared for execution by a virtual machine. This process is called “installation.” Various installation processes may be used which differ in the order of processing and linking operations (when the data is received on the card and when it is stored). These installation processes may be optimized based on available resources on the card. In one implementation, no linking occurs and as such, as data is received, it is immediately stored. During interpretation or execution of the code, resolution of external references occur. As such, this implementation is used in a larger (less constrained) small device because all temporary link information is stored permanently on this card.
[00061] As discussed above, instead of Unicode strings as are used in Java class files, tokens are used to identify items in a CAP file and to resolve references on the resource limited device. Tokens for an API are assigned by the API's developer and published in the package export file(s) for that API. Since the name-to-token mappings are published, an API developer may choose any order for tokens within constraints of the invention.
[00062] Together, FIGS. 5 and 6 describe resolution of references to static items, that is, classes, static fields, and static methods. The implementations of these items are fully locatable during compilation and conversion. In contrast, during compilation and conversion, references to instance fields, virtual methods and interface methods are not statically bound to particular implementations. Those items require additional information which is only available with reference to an instance at runtime. Reference resolution to these types are described in reference to FIGS. 9A-9C .
[00063] Token assignments for virtual methods preserve relationships within object oriented class hierarchies. Tokens for virtual methods and interface methods are used as indices into virtual method tables and interface method tables, respectively. A particular card platform can resolve tokens into an internal representation that is most useful for that implementation of a resource limited device VM.
[00064] Some tokens may be resolved to indices. For example, an instance field token may be resolved to an index into a class instance. In such cases, the token value can be distinct from and unrelated to the value of the resolved index.
[00065] Each kind of item in a package has its own independent scope for tokens of that kind. Sample token range and assignment rules for each kind of reference are listed below. Other ranges and assignments of tokens can be made.
[00002]
| Token Type | Range | Type | Scope | |
|---|---|---|---|---|
| Package | 0-127 | Private | CAP file | |
| Class (Including | 0-255 | Public | Package | |
| Interfaces) | ||||
| Static Field | 0-255 | Public | Class | |
| Static Method | 0-255 | Public | Class | |
| Instance Field | 0-255 | Public or Private | Class | |
| Virtual Method | 0-127 | Public or Private | Class | |
| Hierarchy | ||||
| Interface Method | 0-127 | Public | Class | |
[00066] FIGS. 7A-7I are diagrams illustrating representations of references. FIGS. 7A-7C describe references to imported elements, while FIGS. 7D-7I describe references to internal items, some of which use tokens as well.
[00067] FIG. 7A shows a class reference to an external class 180. The class reference of FIG. 7A includes a package token and a class token. FIG. 7B shows a representation of an external field reference. The external field reference 182 includes a package token, a class token and a field token. FIG. 7C shows a representation of an external method reference 184. The external reference 184 includes a package token, a class token, and a method token. It is to be noted that, for virtual methods, the high bit of the method token is set to zero. The setting of the high bit indicates that the method is accessible outside of the defining package. The high bit may be the most significant bit such as the 7th bit of a byte, 15th bit of a word, or the 23rd bit of a three-byte unit.
[00068] The high bit of a package token is set to indicate an imported package. This is used to distinguish between external and internal references. As shown in FIGS. 7D-7I , references to internal elements have their high bits set to zero. The formats of FIGS. 7D-7I are examples of extending token usage, in selected cases, to internal items.
[00069] FIG. 7D shows a representation of an internal class reference 186. The internal class reference 186 includes an offset to a class information structure in the class component. FIG. 7E shows a representation of a static field reference 188 for an internal field. As such, the static field reference 188 has a field which is set to zero and a field for including an offset to a static field in the static field image. FIG. 7F is a representation of a static method reference 190 for internal methods. The static method reference 190 includes a field of padding, that is set to zero, to make the reference the same size as an imported method reference. The static method reference 190 also includes a field which provides information relating to an offset to a static method in the method component.
[00070] FIG. 7G shows a representation of an instance field reference 192 for an internal field. In FIG. 7G , the instance field reference 192 includes an offset to a class information structure in the class component, as well as a field token. FIG. 7H shows a virtual method reference 194 to a public or protected method for an internal method. The virtual method reference 194 includes an offset to a class information structure in the class component, a field which is cleared to indicate an externally accessible virtual method and to conform to the format in FIG. 7C. The virtual method reference 194 also includes a method token.
[00071] Finally, FIG. 7I shows a representation of a virtual method reference 196 to a package visible method for internal methods. The virtual method reference 196 includes an offset to the class information structure and the class component, a field which is set to one indicating that the reference's scope is internal to the package. The reference 196 also includes a method token.
[00072] FIGS. 8A-8I are flowcharts illustrating processes for assigning tokens and constructing virtual method tables and interface method tables. These processes can be performed by a converter 72, as discussed above. Referring now to FIG. 8A , a process 230 for assigning package tokens is shown. Generally, package references from within a CAP file are assigned tokens which are used only in the CAP file.
[00073] The process 230 first obtains a list of imported packages (step 231). The list can be in any order. Next, the process 230 checks whether the number of packages being imported exceeds a predetermined threshold such as 127 (step 232). In this case, a limit of 127 is used in order to represent a package token in 8-bits, with the high bit reserved. If the number of imported packages exceeds the predetermined threshold such as 127, the process fails (step 205).
[00074] Alternatively, the process 230 initializes the current token value to zero (step 233). Next, the process 230 initializes the current package to the first package in the list (step 234). The process 230 then checks whether the current package is null (step 235). If not, the process 230 assigns the current token to the current package (step 236). Next, the process 230 increments the current token value by one (step 237), and sets the current package to the next package in the list (step 238).
[00075] From step 235, in the event that the current package is null, indicating there are no more imported packages, the process 230 records the token in an Import component (step 239) and exits. References to items in imported packages use token values recorded in the imports component.
[00076] Turning now to FIG. 8B , a process 240 for assigning class and interface tokens is shown. The process 240 first obtains an arbitrarily ordered list of public class and interfaces (step 241). Next, it checks whether the number of classes and interfaces exceed a predetermined value such as 256 which is the maximum number of classes that can be represented in 8-bits (step 242). If so, the process 240 fails (step 205). Alternatively, the process 240 initializes the current token value to zero (step 243). It also initializes the current item to the first class or interface in the list obtained in step 241 (step 244). Next, the process 240 determines whether the current item is null which indicates that no more classes or interfaces remain in the list (step 245). If not, the process 240 assigns a current token value to the current item, which may be a class or an interface item (step 246). Next, the process 240 increments the current token value by one (step 247) and sets the current item to the next class or interface in the list (step 248) before looping back to step 245. From step 245, in the event that a current item is null, indicating no more classes or interfaces exist in the list, the process 240 records a token value in the Export component table (step 249). Additionally, the process 240 publishes the token values in the export file (step 251) and exits.
[00077] FIGS. 8C-1 and 8C-2 handle the static field tokens, with FIG. 8C-2 being an optimized version of FIG. 8C-1 by inlining compile-time constants. Externally visible static fields in a package are assigned public tokens. Package-visible and private static fields are not assigned tokens. FIG. 8C-2 describes a process 280 which is an optimization of process 250. In this optimization, tokens are not assigned for final static fields which are initialized to compile-time constants. In this case, the fields are not linked on-card.
[00078] Turning now to FIG. 8C-1 , a process 250 is shown for assigning static-field tokens in a public class or interface. The process 250 first obtains an arbitrarily ordered list of public and protected static fields in the public class or interface (step 252). Then the process 250 sets the current token value to zero (step 254) and initializes the current field to the first static field in the list (step 256). The process 225 then determines whether the current field is null, indicating no more fields are left (step 258). If not, the process 250 assigns the current token value to the current field (step 260) and increments the current token value by one (step 262). The process 250 then sets the current field to the next static field in the list (step 264) before it loops back to step 258.
[00079] From step 258, in the event that the current field is null, indicating no more fields are left, the process 250 determines whether the current token is greater than a predetermined value such as 255 which is the maximum number of tokens that can be represented in 8-bits (step 266). If so, the process 250 fails (step 205). Alternatively, the process 250 records the token values in the export component table if the export component is to be generated (step 268). Finally, the process 250 publishes the token values in the export files (step 270).
[00080] Referring now to FIG. 8C-2 , a process 280 which optimizes the assignment of static field tokens in a public class or interface is shown. The optimization reduces memory consumption by eliminating compile-time constants and replacing references to the constants inline in the bytecode. The process 280 obtains a list of public and protected static fields in a public class or interface (step 282). The process 280 then sets the current token value to zero (step 284) and initializes the current field to the first static field in the list (step 286). The process 280 then checks whether the current field is null (no more fields) (step 288). If not, the process 280 determines whether the current field is a compile-time constant (step 290). If so, the process 280 assigns a value such as 0xFF as a token value of the current field (step 296). Alternatively, if the current field is not a compile-time constant, the process 280 assigns a current token value to the current field (step 292) and increments the current token value by one (step 294). From step 294 and 296, the process 280 then sets the current field to the next static field in the list (step 298) before looping back to step 288 to continue processing the tokens.
[00081] From step 288, in the event a current field is null (no more fields), the process then checks whether the current token exceeds a predetermined threshold such as 255 which is the maximum numbers that can be represented using 8-bits (step 300). If so, the process 280 fails (step 205). Alternatively, if exporting, the process 280 records the token values in the export component (step 302). The process then publishes the token values in the Export file with the compiled time constants (step 304) so referencing packages can inline the respective values, before exiting.
[00082] Turning now to FIG. 8D , a process 310 for assigning static method tokens in a public class is shown. The process 310 first obtains a list of public and protected static methods and constructors in a public class (step 312). The process 310 then checks whether the number of static methods exceed a predetermined value such as 256 (step 314). If not, the process sets the token value to zero (step 316) and initializes the current method to the first static method in the list (step 318). Next, the process 310 checks whether the current method is null (no more methods) (step 320). If not, the process 310 assigns a current token value to the current static method (step 322) and increments the current token value by one (step 324). The process 310 then sets the current method to the next static method in the list (step 326) before looping back to step 320.
[00083] From step 320, if the current method is null (no more methods) the process records the token value in the export component (step 328) and publishes the token values in the export file (step 330) before exiting.
[00084] FIGS. 8E-1 and 8E-2 relate to instance field token assignment schemes. FIG. 8E-1 shows a general process for assigning field tokens, while FIG. 8E-2 is one optimized process which extends token assignments to internal (or package-visible and private) fields, groups fields of type reference and allows tokens to be easily mapped to offsets within instances.
[00085] Turning now to FIG. 8E-1 , a process 340 for assigning instance field tokens in a public class is shown. First, the process 340 gets a list of public and protected instance fields in a public class (step 342). It then checks whether the number of instance fields exceeds a predetermined value such as 256 (step 344) and if so, fails (step 205). Alternatively, the process 340 sets the current token value to zero (step 346) and initializes a current field to the first field in the list (step 348). Next, the process 340 checks whether the current field is null (step 350). If not, the process 340 assigns a current token value to the current instance field (step 352) and increments the current token value by one (step 354). From step 354, the process sets the current field to the next instance field in the list (step 360) before looping back to step 350. From step 350, in the event that the current field is null, the process 340 publishes the token values in the export file (step 362) and exits.
[00086] Various factors may be considered in optimizing the general approach of FIG. 8E-1 . Generally, the ordering of the tokens remains flexible so that the token arrangement can be adapted to specific implementations. FIG. 8E-2 describes a constrained assignment scheme as shown in the example below:
[00002]
| Visibility | Category | Type | Token | |
|---|---|---|---|---|
| public and | primitive | boolean | 0 | |
| protected = | byte | 1 | ||
| public tokens | short | 2 | ||
| references | byte [] | 3 | ||
| Applet | 4 | |||
| package and | references | short [] | 5 | |
| private = | Object | 6 | ||
| private tokens | primitive | int | 7 | |
| short | 9 | |||
[00087] Referring now to FIG. 8E-2 , a process 370 for optimizing the above assignment of instance field tokens is shown. As before, the process 370 gets a list of all instance fields in a class (step 372). Next, the process 370 checks whether the numbered instance fields exceeds a predetermined value such as 256 (step 374). If so, the process 370 fails (step 205) and if not, the process 370 sorts the list into categories including public and protected primitive types first, public and protected reference types second, package and private reference types third, and package and private primitive types last (step 376). The token value is set to zero (step 378) and the current field is initialized to the first instance field in the list (step 380). Next, the process 370 checks whether the current field is null (step 382). If not, the process assigns a current token value to the current field (step 384) and increments the current token value by one (step 386). The process 370 then determines whether the current field is an integer type (step 388). The integer type takes two slots to allow tokens to be easily mapped to instances. If so, the current token value is incremented by one (step 390). From step 388 or step 390, the process 370 sets the current field to the next instance field in the list (step 392) before looping back to step 382.
[00088] From step 382, if the current field is null, the process 370 publishes the token values of the public and protected instance fields in the export file (step 394) before exiting.
[00089] FIGS. 8F-1 and 8F-2 assign tokens for virtual methods. FIG. 8F-1 shows a general scheme for virtual method token assignment, while FIG. 8F-2 extends token assignment to package visible virtual methods.
[00090] Referring now to FIGS. 8F-1 and 8F-2, processes for assigning virtual method tokens are shown. Generally, virtual methods defined in a package are assigned either exportable or internal tokens. Exportable tokens are assigned to public and protected virtual methods; in this case, the high bit of the token is zero. Internal tokens are assigned to package visible virtual methods; in this case the high bit of the token is one. Since the high bit is reserved, these tokens range from 0 to 127, inclusive.
[00091] Exportable tokens for the externally visible introduced virtual methods in a class are numbered consecutively starting at one greater than the highest numbered exportable virtual method token of the class's superclass. If a method overrides a method implemented in the class's superclass, that method uses the same token number as the corresponding method in the superclass so that overridden methods may be identified as being related to the method they override.
[00092] Internal virtual method tokens are assigned differently from exportable virtual method tokens. If a class and its superclass are defined in the same package, the tokens for the package-visible introduced virtual methods in that class are numbered consecutively starting at one greater than the highest numbered internal virtual method token of the class's superclass. If the class and its superclass are defined in different packages, the tokens for the package-visible introduced virtual methods in that class are numbered consecutively starting at zero. If a method overrides a method implemented in the class's superclass, that method uses the same token number as the corresponding method in the superclass. For background information, the definition of the Java programming language specifies that overriding a package-visible virtual method is only possible if both the class and its superclass are defined in the same package. The high bit of the byte containing a virtual method token is always set to one, to indicate it is an internal token. The ordering of introduced package virtual method tokens in a class is not specified.
[00093] In FIG. 8F-1 , the process 400 first gets a list of public and protected virtual methods in a class (step 402). The process 400 then checks whether the class has a superclass (step 404). If so, the process 400 further checks whether the superclass is in the same package (step 406). From step 406, in the event that the superclass is in the same package, the process finds the superclass (step 408) and obtains the virtual methods and tokens of the superclass (step 412). The set of virtual method includes those defined all of the superclasses of the superclass. From step 406, in the event of the superclass is not in the same package, the process 400 finds the superclass in the export file of the imported package (step 410) and then proceeds to step 412. From step 412, the process 400 initializes a current token value to the maximum superclass virtual method token and increments its value by one (step 414), ensuring that there will not be token collisions within the hierarchy.
[00094] From step 404, in the event that the class does not have a superclass, the process 400 initializes to zero the current token value (step 416). From step 414 or step 416, the process 400 initializes the current method to the first virtual method in the list (step 418). Next, the process 400 determines whether the current method is null (step 420). If not, the process then determines whether the current virtual method is defined by the superclass (step 422). If so, the method is an override method and the same token value is assigned to the current method as the one assigned to the overridden method in the superclass (step 424) before looping back to step 420.
[00095] From step 422, in the event that the current virtual method is not defined by the superclass, it is an introduced method. In that case, the process 400 assigns a current token value to the current method (step 426) and increments the current token value by one (step 428). The process 400 then sets the current method to the next method in the list (step 430) before looping back to step 420. From step 420, in the event that the current method is null, the process 400 checks whether the current token value exceeds a predetermined value such as 127 (step 432). If so, the process 400 fails (step 205). Alternatively, if the token value is not greater than 127, the process 400 publishes the token values in the export file along with the inherited methods and their token values (step 434) before exiting. The process of FIG. 8F-1 can also be used for assigning tokens to public and protected virtual methods in a package visible class as shown in FIG. 8F-2 .
[00096] In FIG. 8F-2 , a process 440 for extending token assignment to package visible virtual methods in a class is shown. The process 440 first gets a list of package visible virtual methods in the class (step 442). Next, it checks whether the class has a superclass (step 444). If so, the process then checks whether the superclass is in the same package (step 446). If so, the process 440 then finds a superclass in the same package (step 448), gets the package visible virtual methods and tokens of the superclass (step 450) and initializes the current token value to the maximum superclass virtual method token plus one (step 452) to avoid token collisions within the hierarchy that is scoped to the package. This ensures that token values previously assigned within superclasses are not reused for introduced methods. It is to be noted that step 450 may be recursive up to the superclasses in the same package.
[00097] From step 444, in the event a class does not have a superclass, or from step 446, in the event that the superclass is not in the same package, the process 440 sets the current token value to zero (step 454). Particularly, if the superclass is not in the same package, package visible virtual methods of that superclass are not accessible and thus not included in step 454. These potential methods are accounted for when resolving references to virtual methods as described above in FIGS. 9D-2 and 9D-3.
[00098] From step 452 or step 454, the process 440 initializes the current method to the first virtual method in a list (step 456). Next, the process 440 checks whether the current method is null (step 458). If not, the process 440 checks whether the current virtual method is defined by a superclass (step 460). In this case the method is an override method. If so, the process 440 then assigns the same token value to the current method as assigned to the overriden method in the superclass (step 462) before looping back to step 458.
[00099] From step 460, if the current virtual method is not defined by its superclass it is an introduced method. In this case, the process 440 assigns a current token value to the current method and sets the high bit to one (step 464). The high bit of the virtual method token is used to determine whether it is a public or private virtual method token. Next, the process 440 increments the current token value by one (step 466) and sets the current method to the next method in the list (step 468) before looping back to step 458.
[00100] In step 458, in the event that the current method is null, the process 440 determines whether the current token value exceeds a value such as 127 (which is the maximum number representable in 8-bits with the high bit reserved) in step 470. If so, the process 440 fails (step 205). Alternatively, in the event that the current token value is within range, the process 440 exits. Note that tokens for package visible virtual methods are used internally and are not exported.
[00101] Virtual method references can only be resolved during execution. The virtual method table allows the card to determine which method to invoke based on the token as well as instances of the method's class. The token value is used as an index to the virtual method table. FIG. 8G-1 shows a process 480 for constructing public virtual method tables in a class. First, a list of public and protected virtual methods in the class is obtained (step 482). Next, the process 480 gets virtual methods and tokens of a superclass (step 484). Step 484 is recursive, including all of the superclasses of the class. The process 480 then creates a table, ordering virtual methods by token values (step 486) and eliminates duplicate virtual methods. Duplicates are generated for overridden methods. In this case, the method defined in the current class is represented in the method table instead of the one defined in a superclass. The process 480 then sets a count to a maximum virtual method token class in step 488 and records a table and count in the class component (step 490) before exiting.
[00102] Turning now to FIG. 8G-2 , a process 500 which optimizes the construction of public virtual method tables in the class is shown. The process 500 decreases the size required for storing a virtual method table by removing overlapping elements in a superclass' virtual method table.
[00103] The process 500 first gets a list of public and protected virtual methods in a class (step 502). Next, the virtual methods and tokens of the superclass are obtained (step 504). Step 504 is recursive, including all of the superclasses of the class. Next, the process 500 initializes a table by ordering virtual methods obtained in steps 502 and 504 by token values (step 506). This process assumes the process has at least one entry. The process 500 then initializes a count to a maximum virtual method token plus one (step 508). The process 500 also sets the base count to zero (step 510). Next, process 500 checks whether the count is positive (step 512). If so, the process checks whether the first entry in the table is defined by the current class (step 514). If not, the process removes the method from the table and shifts the remaining methods up in the table (step 518). The process 500 then decrements the count by one (step 520) and increments the base count by one (step 522) before looping back to step 512.
[00104] From step 514, in the event that the first entry is defined in the current class, or in the event that the count is zero in step 512, the process 500 proceeds to record the table, count and base in the class component (step 516) before exiting.
[00105] FIGS. 8H-1 and 8H-2 show a process 524 for assigning interface method tokens in a public interface. Particularly, FIG. 8H-2 shows in more detail step 526 of FIG. 8H-1 .
[00106] Referring now to FIG. 8H-1 , the process 524 assigns interface method tokens in a public interface. The process 524 initially obtains a set of interface methods in the public interface (step 525). Next, the process 524 obtains a list of superinterfaces of the interface (step 526). This operation is defined in more detail in FIG. 8H-2 . The process 524 then merges the set of methods defined by the interface and by its superinterfaces (step 527). Next, the process 524 checks whether or not more than 256 methods exist (step 529). If so, the process 524 fails (step 205). Alternatively, if less than 256 methods exist, the process 524 sets the current token value to zero (step 530) and initializes the current method to the first method in the method of set of methods (step 532). Next, the process 524 checks whether the current method is null (step 533). If not, the process 524 assigns the current token value to the current interface method (step 534), increments the current token value by one (step 535), and sets the current method for the next method in the set (step 536) before looping back to step 533.
[00107] From step 533, if the current method is null, the process 524 publishes the superinterface list associated with the interface and the method token values in the export file (step 537) and exits.
[00108] Referring now to FIG. 8H-2 , step 526 of FIG. 8H-1 is shown in more detail. First, the process of FIG. 8H-2 selects an interface (step 682). Next, it obtains a list of interfaces inherited by the interface (step 684) and sets the current interface to the first interface in the list (step 686). Next, the process of 8H-2 initializes the results set to an empty set (step 688). From step 688, the process of FIG. 8H-2 iteratively adds interfaces to a result set. This is done by first checking whether the current interface is null, indicating that no other interfaces need to be processed (step 690). If not, the process obtains a set of superinterface of the current interface (step 692). Step 692 invokes the process 526, recursively.
[00109] Upon completing step 692, the process of FIG. 8H-2 adds the set of superinterfaces to a result set (step 694) and the current interface to the result set (step 696). The process then sets the current interface to the next interface (step 698) and loops back to step 690 to continue processing all interfaces. From step 690, in the event that the current interface is null, the process of FIG. 8H-2 exits by returning the result set.
[00110] An interface table contains an entry for each interface directly implemented by a class, and for all superinterfaces of the directly implemented interfaces. Each entry in the interface table contains an identification of the interface and an interface method table. The table maps interface method declarations to implementations in the class.
[00111] FIGS. 8I-1 and 8I-2 show a process 700 for constructing an interface table of a class. Particularly, a FIG. 8I-2 shows in more detail steps 708 of FIG. 8I-1 .
[00112] Referring now to FIG. 8I-1 , a process 700 for constructing interface tables is shown. First, the process 700 obtains a list of interfaces, including superinterfaces, (see process 526) that are implemented by the current class (step 702). Next, the process 700 sets the current interface to the first interface in this set (step 704). The process 700 then checks whether the current interface is null, indicating that it is finished (step 706). If not, the process 700 proceeds to construct an interface method table for the current interface for the class (step 708), as shown in more detail in FIG. 8I-2 . Next, the process 700 sets a current interface to the next interface (step 710) before it loops back to step 706.
[00113] From step 706, in the event that the current interface is null, the process 700 records the interfaces with their interface method tables in the class component (step 712) before exiting.
[00114] Referring now to FIG. 8I-2 , step 708 is shown in more detail. This process first gets the virtual method table for the class (step 722) and the interface methods and tokens for the interface, including inherited methods (step 724). Next, the process of FIG. 8I-2 initializes an interface method table by ordering the methods by their token value (step 726). Next, the process sets the current method to the first method of the interface method table (step 728). From step 728, the process checks whether the current method is null indicating that it is finished (step 730). If not, the process of FIG. 8I-2 finds an implementation of the interface method in the virtual method table (step 732). Next, the process records a token value of the virtual method in the interface method table at the location of the current method (step 734). It then sets the current method to the next method of the current interface (step 736) before looping back to step 730. From step 730, in the event that the current method is null, the process of FIG. 8I-2 exits.
[00115] The dynamic binding of elements during execution is discussed next in FIGS. 9A-9C which describe resolution of references to dynamic elements. During compilation, conversion and token assignment, references to instance fields, virtual methods and interfaces methods cannot be resolved to a particular implementation, but only to an abstract description of the item.
[00116] In the case of instance fields, tokens are assigned within the scope of the defining class. An instance of the class contains all of the fields defined not only by the class, but also by all of its superclasses. The tokens do not indicate the location of the field within the instance, since they cannot reflect a particular layout of the instance and cannot account for the location of private and package-visible fields defined by the superclass.
[00117] In the case of virtual methods, during compilation and conversion the name and type signature are known, as well as a class within a hierarchy that implements such a method. However, the exact implementation cannot be known until execution, when it is possible to determine the particular class of the instance on which the method is invoked. For example, both a class A and its superclass B implement a method definition M. It cannot be known until execution whether an invocation of the method M on an instance of compile-time type B will result in execution of the implementation of class A or of class B.
[00118] To provide a means for properly dispatching an invocation of a virtual method during execution, virtual method token assignment is scoped within a class hierarchy. That is, a method of a subclass that overrides a method previously introduced in a superclass inheritance chain must have the same token value as the method it overrides. Also, introduced methods (those methods that do not override methods defined in a superclass) must have token values that are unique within the inheritance chain. Virtual method tables are defined for each class to provide a means for mapping a virtual method token to a particular implementation.
[00119] Interface methods are similar to virtual methods in that the particular implementation cannot be known until execution time, but they differ in that interface methods can be inherited from multiple interfaces. Multiple inheritance of interface causes a problem with the way virtual method tokens are assigned. A method in a class which overrides a method introduced in more than one interface cannot necessarily have the same token value as the methods it overrides, as the multiple definitions may all have different values. Therefore each set of methods for a particular interface is assigned token values without regard to the token values of the methods of any other interface.
[00120] Because interfaces do not share token values, additional information is necessary to dispatch an interface method invocation to a particular method implementation. As interface method tokens are unique within the scope of an interface, both the interface method token and the identity of the interface are needed to determine the method implemented by the class of an instance at execution time. An interface table is defined for each class which maps an interface identity to an interface method table. The interface method table maps the interface method tokens for that interface to method implementations in that class.
[00121] FIGS. 9A-9C are flowcharts illustrating processes for resolving tokens during the execution. Referring now to FIG. 9A , a process 580 for resolving instance field references is shown. First, the process 580 obtains an instance containing the field from a run-time stack (step 582). Next, the process 580 determines a token associated with the field and maps the token to an index (step 584). The mapping of the token to the index may require examining instance field type information. Moreover, the operation may require adjusting the token value by the size of the superclass's instance. Finally, the process 580 finds the representation of the field in the instance using the index (step 586) before exiting.
[00122] In FIG. 9B-1 , a process 620 for resolving a reference to public or protected virtual method is shown. First, the process 620 obtains an instance of a class from the runtime stack (step 621) and determines the class of the instance (step 622). Next, the process 620 accesses the public virtual method table of the class (step 624) and obtains a method table entry using the method token as an index (step 626). Finally, the process 620 finds and executes the method based on the content of the entry in the virtual method table (step 628) and exits.
[00123] Turning now to FIG. 9B-2 , a process 600 for resolving a reference to any virtual method (including package-visible) is shown. First, the process 600 obtains an instance of a class from the runtime stack (step 601) and determines the class of the instance (step 602). Next, the process 600 determines whether the high bit of the method token is set to one (step 604). If not, the process 600 gets a public virtual method table (step 606) and uses the method token as an index into the virtual method table (step 608). From step 604, in the event that the high bit of the method token equals one, the process 600 then sets the high bit to zero (step 610) and gets the package virtual method table (step 612) before proceeding to step 608. Finally, the process 600 finds and executes the method based on the content of the entry in the virtual method table (step 614) and exits.
[00124] FIG. 9B-3 shows an optimized process 670 for resolving a reference to any virtual method, using optimized virtual method tables as described in FIG. 8G-2 . First, the process 670 obtains an instance of a class from the runtime stack (step 671) and sets the current class to be the class of the instance (step 672). A method table index is initialized to the method token value (step 674). The process 670 then determines whether the high bit of the method token equals one (step 676). If not, the process 670 sets a base value to the public method table's base of the current class (step 678). Next, the method table is set to the public virtual method table of the current class (step 680). The process 670 then checks whether the method table index is less than the base value (step 682) and if so, sets the current class to be the superclass of the current class (step 684). From step 684, the process 670 loops back to step 676 to continue processing.
[00125] In step 676, if the high bit equals one, the process 670 sets the high bit of the method table index to zero (step 690). It sets the base value to the package method table base of the current class (step 692) and sets the method table to the package virtual method table of the current class (step 694) before continuing to step 682.
[00126] From step 682, if the method table index is greater than the base, the process 670 obtains a method table entry using the method table index plus the base value (step 686). The process 670 then finds the method based on the content of the entry in the method table of the current class (step 688). Subsequently, the process 670 exits.
[00127] Referring now to FIG. 9C , a process 650 for resolving interface method reference is shown. First, the process 650 obtains an instance of a class from the runtime stack (step 651) and sets the current class to the class of the instance (step 652). Next, the process 650 searches for the specified interface in the interface table of the current class (step 654). The process then determines whether the interface has been found (step 656). If not, the process then sets current class to the superclass of the current class (step 660) before looping back to step 654.
[00128] From step 656, in the event that the specified interface is found, the process 650 obtains the corresponding interface method table in the current class (step 662). It then obtains the virtual method token from the entry in the table whose index is equal to the interface method token (step 664). The process 650 then obtains the public virtual method table of the class of the instance (step 666). The process 650 gets the virtual method location from the entry in the table associated with the virtual method token (step 668). The process 650 then locates the method based on the content of the entry in the virtual method table (step 669). Once this is done, the process 650 exits.
[00129] Although the invention has been illustrated with respect to a smart card implementation, the invention applies to other devices with a small footprint such as devices that are relatively restricted or limited in memory or in computing power or speed. Such resource constrained devices may include boundary scan devices, field programmable devices, pagers and cellular phones among many others. The invention may prove advantageous when using servlets if there is object sharing between them. Certain desktop systems may also utilize the techniques of the invention.
[00130] The present invention also relates to apparatus for performing these operations. This apparatus may be specially constructed for the required purpose or it may comprise a general purpose computer as selectively activated or reconfigured by a computer program stored in the computer. The procedures presented herein are not inherently related to a particular computer or other apparatus. Various general purpose machines may be used with programs written in accordance with the teachings herein, or it may prove more convenient to construct more specialized apparatus to perform the required method steps. The required structure for a variety of these machines will appear from the description given. Further, it will be appreciated that a virtual machine consistent with the invention can provide functionality beyond that of earlier virtual machines, such as the virtual machines described in the Java™ Virtual Machine Specification.
[00131] While the Java™ programming language and platform are suitable for the invention, any language or platform having certain characteristics would be well suited for implementing the invention. These characteristics include type safety, pointer safety, object-oriented, dynamically linked, and virtual-machine based. Not all of these characteristics need to be present in a particular implementation. In some embodiments, languages or platforms lacking one or more of these characteristics may be utilized. A “virtual machine” could be implemented either in bits (virtual machine) or in silicon (real/physical machines/application specific integrated circuits). Also, although the invention has been illustrated showing object by object security, other approaches, such as class by class security could be utilized.
[00132] The system of the present invention may be implemented in hardware or in computer program. Each such computer program can be stored on a storage medium or device (e.g., CD-ROM, hard disk or magnetic diskette) that is readable by a general or special purpose programmable computer for configuring and operating the computer when the storage medium or device is read by the computer to perform the procedures described. The system also may be implemented as a computer-readable storage medium, configured with a computer program, where the storage medium so configured causes a computer to operate in a specific and predefined manner.
[00133] The program is here, and generally, conceived to be a self-consistent sequence of steps leading to a desired result. These steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It proves convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like. It should be noted, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities.
[00134] While the invention has been shown and described with reference to an embodiment thereof, those skilled in the art will understand that the above and other changes in form and detail may be made without departing from the spirit and scope of the following claims.
[00135] Other embodiments are within the scope of the following claims.
Claims
1. A method for downloading code to a resource constrained computer, the code being separable into at least one package having at least one referenceable item, comprising:
forming the package;
forming a mapping of the referenceable item to a corresponding token having a token type, tokens belonging to the same token type representing the same kind of referenceable item, each kind of referenceable item in said package having its own independent scope of limited capacity for tokens of the corresponding token type; and
providing the package and the mapping.
2. A method for linking code downloaded to a resource constrained computer, the code being separable into at least one package having at least one referenceable item, comprising:
receiving the package;
receiving a mapping of the referenceable item to a corresponding token having a token type, tokens belonging to the same token type representing the same kind of referenceable item, each kind of referenceable item in said package having its own independent scope of limited capacity for tokens of the corresponding token type; and
linking the package using the mapping.
3. A method for linking code downloaded to a computer, the computer comprising a first package that includes a mapping of tokens to externally referenceable items, the method comprising:
receiving a second package comprising at least one reference to an item in said first package, wherein said reference is represented by one or more tokens having a token type, tokens belonging to the same token type representing the same kind of referenceable item, each kind of referenceable item in said package having its own independent scope of limited capacity for tokens of the corresponding token type; and
linking said second package to said first package by resolving said one or more tokens.
4. A method for constructing an image of a first package of code on a computer, the code being separable into at least one package having at least one reference to an item in a second package of code, the method comprising:
receiving a mapping of said item to at least one corresponding token having a token type, tokens belonging to the same token type representing the same kind of referenceable item, each kind of referenceable item in said package having its own independent scope of limited capacity for tokens of the corresponding token type;
replacing said at least one reference with said at least one corresponding token; and
forming said package.
5. A method for constructing an image of a first package of code comprising at least one internally referenceable item, the method comprising:
forming a mapping of said at least one internally referenceable item to an optimized numeric value having a type, optimized numeric values belonging to the same type representing the same kind of referenceable item, each kind of referenceable item in said package having its own independent scope of limited capacity for optimized numeric values of the corresponding type;
replacing references to said at least one internally referenceable item with the corresponding numeric value; and
forming the package.
6. The method of claim 1, further comprising recording in an image of said package a mapping between said token and said referenceable item.
7. The method of claim 1 wherein said referenceable item comprises a class and said reference comprises a package token and a class token.
8. The method of claim 1 wherein said referenceable item comprises a field and said reference comprises a package token, a class token, and a field token.
9. The method of claim 1 wherein said referenceable item comprises a method and said reference comprises a package token, a class token, and a method token.
10. The method of claim 3, further comprising recording in an image of said package a mapping between said token and said referenceable item.
11. The method of claim 3 wherein said referenceable item comprises a class and said reference comprises a package token and a class token.
12. The method of claim 3 wherein said referenceable item comprises a field and said reference comprises a package token, a class token, and a field token.
13. The method of claim 3 wherein said referenceable item comprises a method and said reference comprises a package token, a class token, and a method token.
14. The method of claim 1 wherein
said package further comprises interfaces and interface method definitions; and
said method further comprises constructing at least one interface method table for a class.
15. The method of claim 14 wherein said constructing comprises:
obtaining said interfaces;
constructing an ordered table of methods for each interface; and
recording an indication of the implementation of the interface method for each table entry.
16. The method of claim 15 wherein said ordered interface method table entries correspond to token values assigned to interface methods within the scope of said class.
17. The method of claim 16 wherein said indication of said implementation of said interface method comprises an index into a virtual method table.
18. The method of claim 3, further comprising resolving interface method references during execution using interface method tables, said resolving comprising:
obtaining an associated instance;
obtaining a class description of said instance;
locating an interface table of said interface method in said class description;
locating an interface method entry within an interface table of a referenced method; and
locating the implementation of said interface method based on the table entry content.
19. The method of claim 18 wherein an indication of said implementation of said interface method comprises an index into a virtual method table.
20. The method of claim 5 wherein said package further comprises at least one reference to an internal item.
21. The method of claim 20 wherein said internal item comprises a class and said reference comprises an offset within said package to a class record associated with said class.
22. The method of claim 20 wherein said internal item comprises a static field and said reference comprises an offset within said package to a value for said static field.
23. The method of claim 20 wherein said internal item comprises a static method and said reference comprises an offset within said package to code associated with said static method.
24. The method of claim 20 wherein said internal item comprises an instance field and said reference comprises an offset within said package to a class record of said instance field and a field token.
25. The method of claim 20 wherein said internal item comprises a virtual method and said reference comprises an offset within said package to a class record of said virtual method and a method token.
26. A program storage device readable by a machine, embodying a program of instructions executable by the machine to perform a method for downloading code to a resource-constrained computer, the code being separable into at least one package having at least one referenceable item, the method comprising:
forming the package;
forming a mapping of the referencable item to a corresponding token having a token type, tokens belonging to the same token type representing the same kind of referenceable item, each kind of referenceable item in said package having its own independent scope of limited capacity for tokens of the corresponding token type; and
providing the package and the mapping.
27. A program storage device readable by a machine, embodying a program of instructions executable by the machine to perform a method for linking code downloaded to a resource-constrained computer, the code being separable into at least one package having at least one referenceable item, the method comprising:
receiving the package;
receiving a mapping of the referenceable item to a corresponding token having a token type, tokens belonging to the same token type representing the same kind of referenceable item, each kind of referenceable item in said package having its own independent scope of limited capacity for tokens of the corresponding token type; and
linking the package using the mapping.
28. A program storage device readable by a machine, embodying a program of instructions executable by the machine to perform a method for linking code downloaded to a computer, the computer comprising a first package that includes a mapping of tokens to externally referenceable items, the method comprising:
receiving a second package comprising at least one reference to an item in said first package, wherein said reference is represented by one or more tokens having a token type, tokens belonging to the same token type representing the same kind of referenceable item, each kind of referenceable item in said package having its own independent scope of limited capacity for tokens of the corresponding token type; and
linking said second package to said first package by resolving said one or more tokens.
29. A program storage device readable by a machine, embodying a program of instructions executable by the machine to perform a method for constructing an image of a first package of code on a computer, the code being separable into at least one package having at least one reference to an item in a second package of code, the method comprising:
receiving a mapping of said item to at least one corresponding token having a token type, tokens belonging to the same token type representing the same kind of referenceable item, each kind of referenceable item in said package having its own independent scope of limited capacity for tokens of the corresponding token type;
replacing said at least one reference with said at least one corresponding token; and
forming said package.
30. A program storage device for constructing an image of a first package of code comprising at least one internally referenceable item, the method comprising:
forming a mapping of said at least one internally referenceable item to an optimized numeric value having a type, optimized numeric values belonging to the same type representing the same kind of referenceable item, each kind of referenceable item in said package having its own independent scope of limited capacity for optimized numeric values of the corresponding type;
replacing references to said at least one internally referenceable item with the corresponding numeric value; and
forming the package.
31. The program storage device of claim 26 wherein said method further comprises recording in an image of said package a mapping between said token and said referenceable item.
32. The program storage device of claim 26 wherein said referenceable item comprises a class and said reference comprises a package token and a class token.
33. The program storage device of claim 26 wherein said referenceable item comprises a field and said reference comprises a package token, a class token, and a field token.
34. The program storage device of claim 26 wherein said referenceable item comprises a method and said reference comprises a package token, a class token, and a method token.
35. The program storage device of claim 28 wherein said method further comprises recording in an image of said package a mapping between said token and said referenceable item.
36. The program storage device of claim 28 wherein said referenceable item comprises a class and said reference comprises a package token and a class token.
37. The program storage device of claim 28 wherein said referenceable item comprises a field and said reference comprises a package token, a class token, and a field token.
38. The program storage device of claim 28 wherein said referenceable item comprises a method and said reference comprises a package token, a class token, and a method token.
39. The program storage device of claim 26 wherein said package further comprises interfaces and interface method definitions; and said method further comprises constructing at least one interface method table for a class.
40. The program storage device of claim 39 wherein said constructing comprises:
obtaining said interfaces;
constructing an ordered table of methods for each interface; and
recording an indication of the implementation of the interface method for each table entry.
41. The program storage device of claim 40 wherein said ordered interface method table entries correspond to token values assigned to interface methods within the scope of said class.
42. The program storage device of claim 41 wherein said indication of said implementation of said interface method comprises an index into a virtual method table.
43. The program storage device of claim 28 wherein said method further comprises resolving interface method references during execution using interface method tables, said resolving comprising:
obtaining an associated instance;
obtaining a class description of said instance;
locating an interface table of said interface method in said class description;
locating an interface method entry within an interface table of a referenced method; and
locating the implementation of said interface method based on the table entry content.
44. The program storage device of claim 43 wherein an indication of said implementation of said interface method comprises an index into a virtual method table.
45. The program storage device of claim 30 wherein said package further comprises at least one reference to an internal item.
46. The program storage device of claim 45 wherein said internal item comprises a class and said reference comprises an offset within said package to a class record associated with said class.
47. The program storage device of claim 45 wherein said internal item comprises a static field and said reference comprises an offset within said package to a value for said static field.
48. The program storage device of claim 45 wherein said internal item comprises a static method and said reference comprises an offset within said package to code associated with said static method.
49. The program storage device of claim 45 wherein said internal item comprises an instance field and said reference comprises an offset within said package to a class record of said instance field and a field token.
50. The program storage device of claim 45 wherein said internal item comprises a virtual method and said reference comprises an offset within said package to a class record of said virtual method and a method token.
51. An apparatus for downloading code to a resource-constrained computer, the code being separable into at least one package having at least one referenceable item, the apparatus comprising:
means for forming the package;
means for forming a mapping of the referencable item to a corresponding token having a token type, tokens belonging to the same token type representing the same kind of referenceable item, each kind of referenceable item in said package having its own independent scope of limited capacity for tokens of the corresponding token type; and
means for providing the package and the mapping.
52. An apparatus for linking code downloaded to a resource-constrained computer, the code being separable into at least one package having at least one referenceable item, the apparatus comprising:
means for receiving the package;
means for receiving a mapping of the referenceable item to a corresponding token having a token type, tokens belonging to the same token type representing the same kind of referenceable item, each kind of referenceable item in said package having its own independent scope of limited capacity for tokens of the corresponding token type; and
means for linking the package using the mapping.
53. An apparatus for linking code downloaded to a computer, the computer comprising a first package that includes a mapping of tokens to externally referenceable items, the apparatus comprising:
means for receiving a second package comprising at least one reference to an item in said first package, wherein said reference is represented by one or more tokens having a token type, tokens belonging to the same token type representing the same kind of referenceable item, each kind of referenceable item in said package having its own independent scope of limited capacity for tokens of the corresponding token type; and
means for linking said second package to said first package by resolving said one or more tokens.
54. An apparatus for constructing an image of a first package of code on a computer, the code being separable into at least one package having at least one reference to an item in a second package of code, the apparatus comprising:
means for receiving a mapping of said item to at least one corresponding token having a token type, tokens belonging to the same token type representing the same kind of referenceable item, each kind of referenceable item in said package having its own independent scope of limited capacity for tokens of the corresponding token type;
means for replacing said at least one reference with said at least one corresponding token; and
means for forming said package.
55. An apparatus for constructing an image of a first package of code comprising at least one internally referenceable item, the apparatus comprising;
means for forming a mapping of said at least one internally referenceable item to an optimized numeric value having a type, optimized numeric values belonging to the same type representing the same kind of referenceable item, each kind of referenceable item in said package having its own independent scope of limited capacity for optimized numeric values of the corresponding type;
means for replacing references to said at least one internally referenceable item with the corresponding numeric value; and
means for forming the package.
56. The apparatus of claim 51, further means for comprising recording in an image of said package a mapping between said token and said referenceable item.
57. The apparatus of claim 51, wherein said referenceable item comprises a class and said reference comprises a package token and a class token.
58. The apparatus of claim 51, wherein said referenceable item comprises a field and said reference comprises a package token, a class token, and a field token.
59. The apparatus of claim 51, wherein said referenceable item comprises a method and said reference comprises a package token, a class token, and a method token.
60. The apparatus of claim 53, further comprising means for recording in an image of said package a mapping between said token and said referenceable item.
61. The apparatus of claim 53, wherein said referenceable item comprises a class and said reference comprises a package token and a class token.
62. The apparatus of claim 53 wherein said referenceable item comprises a field and said reference comprises a package token, a class token, and a field token.
63. The apparatus of claim 53 wherein said referenceable item comprises a method and said reference comprises a package token, a class token, and a method token.
64. The apparatus of claim 51 wherein
said package further comprises interfaces and interface method definitions; and
said apparatus further comprises means for constructing at least one interface method table for a class.
65. The apparatus of claim 64 wherein said constructing comprises:
means for obtaining said interfaces;
means for constructing an ordered table of methods for each interface; and
means for recording an indication of the implementation of the interface method for each table entry.
66. The apparatus of claim 65 wherein said ordered interface method table entries correspond to token values assigned to interface methods within the scope of said class.
67. The apparatus of claim 66 wherein said indication of said implementation of said interface method comprises an index into a virtual method table.
68. The apparatus of claim 53, further comprises means for resolving interface method references during execution using interface method tables, said means for resolving comprising:
means for obtaining an associated instance;
means for obtaining a class description of said instance;
means for locating an interface table of said interface method in said class description;
means for locating an interface method entry within an interface table of a referenced method; and
means for locating the implementation of said interface method based on the table entry content.
69. The apparatus of claim 68 wherein an indication of said implementation of said interface method comprises an index into a virtual method table.
70. The apparatus of claim 55 wherein said package further comprises at least one reference to an internal item.
71. The apparatus of claim 70 wherein said internal item comprises a class and said reference comprises an offset within said package to a class record associated with said class.
72. The apparatus of claim 70 wherein said internal item comprises a static field and said reference comprises an offset within said package to a value for said static field.
73. The apparatus of claim 70 wherein said internal item comprises a static method and said reference comprises an offset within said package to code associated with said static method.
74. The apparatus of claim 70 wherein said internal item comprises an instance field and said reference comprises an offset within said package to a class record of said instance field and a field token.
75. The apparatus of claim 70 wherein said internal item comprises a virtual method and said reference comprises an offset within said package to a class record of said virtual method and a method token.
Patent Citations (53)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5367685(A) | 1994-11-01 | Gosling | Applicant |
| US5613101(A) | 1997-03-01 | Lillich | Applicant |
| US5615137(A) | 1997-03-01 | Holzmann et al. | Applicant |
| US5619695(A) | 1997-04-01 | Arbabi et al. | Examiner |
| US5668999(A) | 1997-09-01 | Gosling | Applicant |
| US5701408(A) | 1997-12-01 | Cornell et al. | Applicant |
| US5734822(A) | 1998-03-01 | Houha et al. | Applicant |
| US5748964(A) | 1998-05-01 | Gosling | Applicant |
| US5778231(A) | 1998-07-01 | van Hoff et al. | Applicant |
| US5778234(A) | 1998-07-01 | Hecht et al. | Examiner |
| US5802519(A) | 1998-09-01 | De Jong | Applicant |
| US5841866(A) | 1998-11-01 | Bruwer et al. | Examiner |
| US5889992(A) | 1999-03-01 | Koerber | Applicant |
| US5905987(A) | 1999-05-01 | Shutt et al. | Applicant |
| US5937412(A) | 1999-08-01 | Kohli et al. | Examiner |
| US5966702(A) | 1999-10-01 | Fresko et al. | Examiner |
| US5974454(A) | 1999-10-01 | Apfel et al. | Examiner |
| US6005942(A) | 1999-12-01 | Chan et al. | Examiner |
| US6038551(A) | 2000-03-01 | Barlow et al. | Examiner |
| US6092147(A) | 2000-07-01 | Levy et al. | Applicant |
| US6131159(A) | 2000-10-01 | Hecht et al. | Examiner |
| US6141681(A) | 2000-10-01 | Kyle | Examiner |
| US6145021(A) | 2000-11-01 | Dawson et al. | Examiner |
| US6163811(A) | 2000-12-01 | Porter | Examiner |
| US6178546(B1) | 2001-01-01 | McIntyre | Examiner |
| US6226744(B1) | 2001-05-01 | Murphy et al. | Examiner |
| US6233683(B1) | 2001-05-01 | Chan et al. | Examiner |
| US6272674(B1) | 2001-08-01 | Holiday, Jr. | Applicant |
| US6308317(B1) | 2001-10-01 | Wilkinson et al. | Examiner |
| US6349344(B1) | 2002-02-01 | Sauntry et al. | Applicant |
| US6434561(B1) | 2002-08-01 | Durst et al. | Examiner |
| US6438550(B1) | 2002-08-01 | Doyle et al. | Examiner |
| US6470494(B1) | 2002-10-01 | Chan et al. | Applicant |
| US6477702(B1) | 2002-11-01 | Yellin et al. | Examiner |
| US6481632(B2) | 2002-11-01 | Wentker et al. | Examiner |
| US6519767(B1) | 2003-02-01 | Carter et al. | Applicant |
| US6557032(B1) | 2003-04-01 | Jones et al. | Examiner |
| US20020040936(A1) | 2002-04-01 | Wentker et al. | Examiner |
| EP292248 | 1988-05-01 | Applicant | |
| EP498130(A2) | 1991-12-01 | Applicant | |
| EP685792 | 1995-12-01 | Applicant | |
| EP778520 | 1996-11-01 | Applicant | |
| EP778520(A2) | 1996-11-01 | Applicant | |
| EP748135(B1) | 1996-12-01 | Applicant | |
| EP778522(A2) | 1997-06-01 | Applicant | |
| EP865217(A2) | 1998-09-01 | Applicant | |
| WO9430023 | 1994-12-01 | Applicant | |
| WO9819237 | 1998-05-01 | Applicant | |
| WO98521258 | 1998-05-01 | Applicant | |
| WO890 | 2000-01-01 | Applicant | |
| WO25278 | 2000-05-01 | Applicant | |
| WO25278 | 2000-05-01 | Applicant | |
| WO46666 | 2000-08-01 | Applicant |
Non-Patent Literature (15)
- Kermarrec et al., Introducing contrxtual objects . . . , Sep. 1998, p. 229-236.*Applicant
- Java Card 2.0 Language Subset and Virtual Machine Specification Revision 1.0 Final, Oct. 13, 1997, Sun Microsystems, Inc.Applicant
- Basin, D. et al. “Java Bytecode Verification by Model Checking”, CAV 99: 11th International Conference on Computer Aided Verification, vol. 1633 of LNCS, pp. 491-494 (1999).Applicant
- Bowles et al., “A Comparison of Commercial Reliability Prediction Programs”, Proceedings Annual Reliability and Maintainability Symposium, IEEE, pp. 450-455 (1990).Applicant
- Cooper, Richard, “Persistent Languages Facilitate the Implementation of Software Version Management”, IEEE, pp. 56-65 (1989).Applicant
- Lindsay et al., “A Generic Model for Fine Grained Configuration Management Including Version Control and Traceability”, Proceedings of the Australian Software Engineering Conference (ASWEC'97), IEEE Computer Society, pp. 27-36 (1997).Applicant
- Posegga, J. et al. “Byte Code Verification for Java Smart Cards Based on Model Checking”, Sep. 16-18, 1998, Computer Sercurity-ESORICS 98, Proceedings of the 5th European Symposium on Research in Computer Security.Applicant
- Cyberflex—Opening Page, printed from http://www.cyberflex.slb.com on Jan. 15, 1999.Applicant
- “Java Developer's Journal Names Cyberflex Smart Card As Editor's Choice Finalist”, Jan. 11, 1999, printed from http://www.slb.com/ir/news/sct-jdj0199.html on Jan. 15, 1999.Applicant
- “Schlumberger Announces Cyberflex Access; Java™-Based Smart Card Combines Multiple Application and Cryptographic Features for Information Security Market”, Dec. 8, 1998, printed from http://www.cyberflex.slb.com/Ac...ex13 Access/cyberflex13 access.html on Jan. 15, 1999.Applicant
- “What is the EmbeddedJava™ Application Environment” printed from http://java.sun.com/products/embeddedjava/overview.html on Jan. 27, 1999.Applicant
- International Preliminary Examination Report, PCT/US01/28687, International filing date Sep. 14, 2001, date Search Report mailed Jan. 5, 2004.Applicant
- Suresh Subramanian, “CRUISE: Using Interface Hierarchies to Support Software Evolution”, IEEE, 1988, pp. 132-142.Applicant
- International Search Report, PCT/US 01/28579, International filing date Sep. 12, 2001, date Search Report mailed- Jan. 5, 2004.Applicant
- International Search Report, PCT/US 01/28688, International filing date Sep. 14, 2001, date Search report mailed- Jan. 5, 2004.Applicant