US 6,986,132 B1Grant

Remote incremental program binary compatibility verification using API definitions

Issue Date:2006-01-10

•19 Claims

•32 Drawing Sheets

Abstract

A method of operating a computer system includes providing a first version of a program in memory and verifying the program prior to program execution. Program verification includes indicating a verification error when a first version of a first program unit implementation is not internally consistent, indicating a verification error when the first version of the first program unit implementation is inconsistent with the version of the program unit API definition file associated with the first version of the first program unit implementation, receiving a second version of the first program unit implementation and a second version of the first program unit implementation is binary compatible with the first version of the first program unit implementation by comparing the first version of the first program unit API definition file and the second version of the first program unit API definition unit.

Metadata

Assignee

Sun Microsytems, Inc.

Inventor

Judith E. Schwabe

Application Information

Application Number:US 09/661,684

Filing Date:2000-09-14

Priority Date:2000-04-28

Art Unit:2191

Classifications

IPC:

G06F9/44

Patent Drawings (32 sheets)

Description

Cross Reference to Related Applications

[0001] This application claims the benefit of provisional patent application Ser. No. 60-200,480, filed Apr. 28, 2000 in the name of Judith E. Schwabe, entitled “System and Method for Remote Incremental Program Verification Using API Definitions”.

[0002] This application is related to the following:

[0003] U.S. patent application Ser. No. 10/661,043, filed Sep. 12, 2003 in the name of inventor Judith E. Schwabe, entitled “Remote Incremental Program Verification Using API Definitions”, which is a continuation of U.S patent application Ser. No. 10/661,043, now U.S. Pat. No. 6,651,186, filed Sep. 14, 2000 in the name of inventor Judith E. Schwabe, entitled “Remote Incremental Program Verification Using API Definition”, commonly assigned herewith;

[0004] U.S. patent application Ser. No. 09/661,581, filed Sep. 14, 2000 in the name of inventor Judith E. Schwabe, entitled “Populating Resource-Constrained Devices With Content Verified Using API Definitions:”, commonly assigned herewith;

[0005] U.S. patent application Ser. No. 09/661,582, filed Sep. 14, 2000 in the name of inventor Judith E. Schwabe entitled “populating Binary Compatible Resource-Constrained Devices With Content Verified Using API Definitions”, commonly assigned herewith;

[0006] U.S. patent application Ser. No. 09/662,258, filed Sep. 14, 2000 in the name of inventor Judith E. Schwabe, entitled “API Representation Enabling Submerged Hierachy”, commonly assigned herewith; and

[0007] U.S. patent application Ser. No. 09/243, 108 filed Feb. 2, 1999 in the name of inventors Judith E. Schwabe and Joshua B. Susser, entitled “Token-based Linking”, commonly assigned herewith.

Background of the Invention

[0008] 1. Field Of the Invention

[0009] The present invention relates to computer systems. More particularly, the present invention relates to a system and method for remote distributed program verification using API definitions.

[0010] 2. Background

[0011] In general, computer programs are written as source code statements in a high level language that is easy for a human being to understand. As the computer programs are actually executed, a computer responds to machine code, which consists of instructions comprised of binary signals that directly control the operation of a central processing unit (CPU). A special program called a compiler is typically used to read the source code and to convert its statements into the machine code instructions of the specific CPU. The machine code instructions thus produced are platform dependent, that is, different computer devices have different CPUs with different instruction sets indicated by different machine codes.

[0012] More powerful programs are typically constructed by combining several simpler programs. This combination can be made by copying segments of source code together before compiling and then compiling the combined source. When a segment of source code statements is frequently used without changes, it is often preferable to compile it once, by itself, to produce a module, and to combine the module with other modules only when that functionality is actually needed. This combining of modules after compilation is called linking. When the decision on which modules to combine depends upon run time conditions and the combination of the modules happens at run time, just before execution, the linking is called dynamic linking.

Object Oriented Principles

[0013] Object oriented programming techniques such as those used by the Java™ platform are widely used. The basic unit of object oriented programs is an “object”. An object has methods (procedures) and fields (data). The term “members” is used herein to refer to methods and fields. A method declares executable code that can be invoked and that passes a fixed number of values as arguments. A class defines the shared members of the objects. Each object then is a particular instance of the class to which it belongs. In practice, a class is a template to create multiple objects (multiple instances) with similar features.

[0014] One property of classes is encapsulation. Encapsulation is used to describe a system wherein access to an object is provided through an interface, while keeping the details private. In other words, the actual implementation of the members within the class is hidden from an outside user and from other classes, except as exposed by an interface. This makes classes suitable for distributed development, for example by different developers at different sites on a network. A complete program can be formed by assembling the classes that are needed, linking them together, and executing the resulting program.

[0015] Classes enjoy the property of inheritance. Inheritance is a mechanism that enables one class to inherit all of the members of another class. The class that inherits from another class is called a subclass; the class that provides the attributes is the superclass. Symbolically, this can be written as subclass<=superclass, or superclass=>subclass. The subclass can extend the capabilities of the superclass by adding additional members. The subclass can override a virtual method of the superclass by providing a substitute method with the same name and type.

[0016] The members of a class type are fields and methods; these include members inherited from the superclass. The class file also names the superclass. A member can be public, which means that it can be accessed by members of the class that contains its declaration. A member can also be private. A private field of a class is visible only in methods defined within that class. Similarly, a private method may only be invoked by methods within the class. Private members are not visible within subclasses, and are not inherited by subclasses as other members are. A member can also be protected.

[0017] An interface type is a type whose members are constants and abstract methods. This type has no implementation, but otherwise unrelated classes can implement it by providing implementations for its abstract methods. Interfaces may have sub-interfaces, just as classes may have subclasses. A sub-interface inherits from its super-interface, and may define new methods and constants as well. Additionally, an interface can extend more than one interface at a time. An interface that extends more than one interface inherits all the abstract methods and constants from each of those interfaces, and may define its own additional methods and constants.

Java™ Programming Language

[0018] In the Java™ programming language, classes can be grouped and the group can be named; the named group of classes is a package. If a class member is not declared with any of the public, private or protected keywords, then it is visible only within the class that defines it and within classes that are part of the same package. A protected member may be accessed by members of declaring class or from anywhere in the package in which it is declared. The Java™ programming language is described in detail in Gosling, et al., “The Java™ Language Specification”, August 1996, Addison-Wesley Longman, Inc.

Java™ Virtual Machine

[0019] Programs written in the Java™ language execute on a Java™ virtual machine (JVM), which is an abstract computer architecture that can be implemented in hardware or software. Either implementation is intended to be included in the following description of a VM. For the purposes of this disclosure, the term “processor” may be used to refer to a physical computer or a virtual machine.

[0020] A virtual machine is an abstract computing machine generated by a software application or sequence of instructions that 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 implemented on a Windows™-based personal computer system will execute an application using the same set of instructions as a virtual machine implemented 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.

[0021] The Java™ Virtual Machine (JVM) is one example of a virtual machine. Compiled code to be executed by the Java™ Virtual Machine is represented using a hardware- and operating system-independent binary format, typically stored in a file, known as the class file format. The class file is designed to handle object oriented structures that can represent programs written in the Java™ programming language, but may also support several other programming languages. These other languages may include, by way of example, Smalltalk. The class file format precisely defines the representation of a class or interface, including details such as byte ordering that might be taken for granted in a platform-specific object file format. For the sake of security, the Java™ Virtual Machine imposes strong format and structural constraints on the instructions in a class file. In particular example, JVM instructions are type specific, intended to operate on operands that are of a given type as explained below. Any language with functionality that can be expressed in terms of a valid class file can be hosted by the Java™ Virtual Machine. The class file is designed to handle object oriented structures that can represent programs written in the Java™ programming language, but may also support several other programming languages. The Java™ Virtual Machine is described in detail in Lindholm, et al., “The Java™ Virtual Machine Specification”, April 1999, Addison-Wesley Longman, Inc., Second Edition.

[0022] The process of programming using such a VM then has two time periods associated with it; “compile time” refers to the steps which convert the high level language into VM instructions, and “run time” refers to the steps which, in a Java™ VM environment, interpret instructions to execute the module. Between compile time and run time, the modules of instructions compiled from statements can reside dormant for extended, arbitrary periods of time, or can be transferred from one storage device to another, including being transferred across a network.

[0023] Loading refers to the process of finding the binary form of a class or module with a particular name, typically by retrieving a binary representation previously compiled from source code. In the JVM, the loading step retrieves the class file representing the desired class. The loading process is implemented by the bootstrap loader or a user defined class loader. A user-defined class loader is itself defined by a class. A class loader may indicate a particular sequence of locations to search in order to find the class file representing a named class.

[0024] Linking in the JVM is the process of taking a binary form of a class in memory and combining it into the run time state of a VM, so that it can be executed. A class is loaded before it is linked.

Verification

[0025] For many reasons, particularly regarding the integrity of downloaded computer programs, the Internet and other insecure communication mediums are potentially “hostile” environments. A downloaded program may contain errors involving the data types of operands not matching the data type restrictions of the instructions using those operands, which may cause the program to fail during execution. Even worse, a program might attempt to create object references (e.g. by loading a computed number into the operand stack and then attempting to use the computed number as an object handle) and to thereby breach the security and/or integrity of the user's computer. Alternatively, one or more of the modules may have been updated since the others were prepared. It is therefore prudent, when assembling several modules that may have been written independently, to check both that (1) each module properly adheres to the language semantics and that (2) the set of modules properly adheres to the language semantics. These checks are typically performed on program modules containing instructions produced from compiled source code. By analogy with the terminology used by the designers of the Java™ programming language, this post-compilation module checking can be called verification. A verifier, therefore, performs an essential role in ensuring a secure runtime environment.

[0026] The binary classes of the JVM are examples of general program modules that contain instructions produced from compiled source statements. Context sensitivity of validity checks performed during verification means that those checks depend on information spread across more than one module, i.e., those checks are called inter-module checks herein. Validity checks that do not require information from another module are called intra-module checks herein. Intra-module checks include, for example, determining whether the downloaded program will underflow or overflow its stack, whether any instruction will process data of the wrong type and whether the downloaded program will violate files and other resources on the user's computer. See, for example, U.S. Pat. No. 5,668,999 to Gosling, U.S. Pat. No. 5,748,964 to Gosling and U.S. Pat. No. 5,740,441 to Yellin et al.

[0027] During normal execution of programs using languages that do not feature preexecution verification, the operand stack must be continuously monitored for overflows (i.e., adding more data to the stack than the stack can store) and underflows (i.e., attempting to pop data off the stack when the stack is empty). Such stack monitoring must normally be performed for all instructions that change the stack's status (which includes most all instructions). For many programs, stack monitoring instructions executed by the interpreter account for approximately 80% of the execution time of an interpreted computer program.

[0028] Turning now to FIG. 1, a high level flow diagram that illustrates verification is presented. At 10, intra-module checks are performed to determine whether a module is internally consistent. At 20, inter-module checks are performed to determine whether the module is consistent within the context of externally referenced modules. Verification is successful if both checks pass. Execution of a module is prevented if either checks fail.

[0029] Verification typically follows an execution path. Verification starts at a program's main entry point and proceeds in a “top down” fashion, one instruction at a time. During this process, the verifier may encounter a reference to an external library that includes at least one program unit. At this point, the verifier obtains the binary file for the external library and continues verification along an execution path.

[0030] Turning now to FIG. 2, a high level flow diagram that illustrates verification of an application to be executed on a resource-rich device 62 is presented. Verification is typically performed on a relatively resource-rich device 62 such as a desktop computer. A compiler 50 compiles a source file 55. During compilation, the compiler 50 verifies the correct use of data and instructions. These checks include intra-module checks and inter-module checks. The output of the source code compiler 50 is a binary file 60 containing the executable instructions corresponding to the source file 55. When the binary file 60 is referenced by an application executing on a virtual machine 65, a loader 70 loads the binary file 60. A verifier 75 verifies the binary file 60 at some point prior to execution by an interpreter 80. If the binary file 60 references any items that are external to the binary file 60, the verifier 75 verifies the binary file 60 against the referenced binary file(s) 60 containing the externally referenced item(s).

[0031] Turning now to FIG. 3, a block diagram that illustrates the need for verification is presented. FIG. 3 is the same as FIG. 2, except that binary file 110 and/or referenced binary file 107 are potentially modified at some point after source file 105 is compiled. The modification may be the result of an update of a binary file 110 or referenced binary file 107. Alternatively, modification of the binary file 110 or referenced binary file 107 may be the result of file corruption. As mentioned previously, such program modifications could potentially cause the program to violate Java™ semantics and thus breach the security and/or integrity of the host computer 155.

[0032] Note that some updates in FIG. 3 are allowed. Some changes made when revising a binary file result in the new version being backward compatible with the previous version. When a newer version is backward compatible with an older version, the versions are said to be binary compatible. Binary compatibility is discussed in greater detail below. A verification error should be indicated when versions are not binary compatible. Thus, some updates may pass verification, but corrupted binary files must not pass verification.

[0033] Verification coupled with execution time has some disadvantages. For example, in an object oriented programming language system like the Java™ platforms (but not Java Card™ platforms), it leads to a verifier initiating class loading when the verifier needs to check subtype relations among classes not already loaded. Such loading can occur even if the code referencing other classes is never executed. Because of this, loading can consume memory and slow execution at run time as compared to a process that does not load the classes unless they are referenced by the instructions that are actually executed.

[0034] Methods for verification coupled with execution time typically do not verify one class or module at a time before run time. This is a disadvantage because classes cannot be verified ahead of time, e.g. before run time, so verification must incur a run time cost. Thus, there is a need for module-by module, also called module-at-a-time, verification before run time. Such verification is also called pre-verification because technically it is distinct from the verification which occurs during run time linking by the Java Card™ Virtual Machine (JCVM).

[0035] Also, since verification is typically performed at run time, a class that has been run once, and passed verification, is subjected to verification again each time the class is loaded—even when reverification is not required. Reverification may not be required, for example, when the class is being used in the same application on the same processor, or in an environment that prevents changes that would affect verification. This can lead to redundant verification, thereby requiring more memory and executing more slowly during run time than ought to be necessary. Thus, there is a need for an option to use verified modules without further, or with minimum verification at run time.

Resource-Constrained Devices

[0036] Resource-constrained devices are generally considered to be those that are relatively restricted in memory and/or computing power or speed, as compared to typical desktop computers and the like. Other resource-constrained devices include, by way of example, smart cards, cellular telephones, boundary scan devices, field programmable devices, personal digital assistants (PDAs) and pagers and other miniature or small footprint devices.

[0037] Smart cards, also known as intelligent portable data-carrying cards, are a type of resource-constrained device. Smart cards are typically made of plastic or metal and have an electronic chip that includes an embedded microprocessor or microcontroller to. execute programs and memory to store programs and data. Such devices, which can be about the size of a credit card, typically have computer chips with 8-bit or 16-bit architectures. Additionally, these devices typically have limited memory capacity. For example, some smart cards have less than one kilobyte (1 K) 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).

[0038] A Java™ virtual machine executes programs written in the Java™ programming language and is designed for use on desktop computers, which are relatively rich in memory. It would be desirable to write programs that use the full implementation of the Java™ virtual machine for execution on resource-constrained devices such as smart cards. However, due to the limited architecture and memory of resource-constrained devices such as smart cards, the full Java™ virtual machine platform cannot be implemented on such devices. Accordingly, a separate Java Card™ (the smart card that supports the Java™ programming language) technology supports a subset of the Java™ programming language for resource-constrained devices.

[0039] Referring to FIG. 4, development of an applet for a resource-constrained device, such as a smart card 160, 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 165. The applet can be run, tested and debugged, for example, on a workstation using simulation tools to emulate the environment on the card 160. When the applet is ready to be downloaded to the card 160, the class files 165 are converted to a converted applet (CAP) file 175 by a converter 180. The converter 180 can be a Java™ application being executed by a desktop computer. The converter 180 can accept as its input one or more export files 185 in addition to the class files 165 to be converted. An export file 185 contains naming or linking information for the contents of other packages that are imported by the classes being converted.

[0040] Referring to FIG. 5, the CAP format is parallel to the class file information. Each CAP 250 contains all of the classes and interfaces defined in one Java™ package. A CAP file 250 has a compact and optimized format, so that a Java™ package can be efficiently stored and executed on resource-constrained devices. Among other things, the CAP file 250 includes a constant pool component (or “constant pool”) 255 that is packaged separately from a methods component 260. The constant pool 255 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 or at the time of execution by the smart card. The methods component 260 specifies the application instructions to be downloaded to the smart card and subsequently executed by the smart card. Also included in a CAP file 250, among other things, are class definitions 265, field definitions 275, and descriptive type definitions 275.

[0041] Referring again to FIG. 4, after conversion, the CAP file 175 can be stored on a computer-readable medium 170 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.

[0042] The CAP file 175 then can be copied or transferred to a terminal 190 such as a desktop computer with a peripheral card acceptance device (CAD) 195. The CAD 195 allows information to be written to and retrieved from the smart card 160. The CAD 195 includes a card port (not shown) into which the smart card 160 can be inserted. Once inserted, contacts from a connector press against the surface connection area on the smart card 160 to provide power and to permit communications with the smart card 160, although, in other implementations, contactless communications can be used. The terminal 190 also includes an installation tool 200 that loads the CAP file 175 for transmission to the card 160.

[0043] The smart card 160 has an input/output (I/O) port 205 which can include a set of contacts through which programs, data and other communications are provided. The card 160 also includes a loader 210 for receiving the contents of the CAP file 175 and preparing the applet for execution on the card 160. The installation tool 210 can be implemented, for example, as a Java™ program and can be executed on the card 160. The card 160 also has memory, including volatile memory such as RAM 240. The card 160 also has ROM 230 and non-volatile memory, such as EEPROM 235. The applet prepared by the loader 210 can be stored in the EEPROM 235.

[0044] As mentioned regarding FIG. 2, verification is typically performed on a resource-rich device. Verification programs are typically large programs that require a relatively large amount of runtime memory when executing. Also, verifier programs typically require large amounts of detailed descriptive information in the verification process. This descriptive information includes information regarding field types, signature types and access flags (private, protected, etc). This type information is typically maintained in secondary storage. Such memory requirements are typically not an issue on relatively resource rich devices such as a desktop computer. However, these same characteristics make verification ill-suited for resource-constrained devices such as smart cards. Providing verification of program modules to execute on a resource-constrained device is critical to ensure the integrity of program modules executed such a device. Accordingly, a need exists in the prior art for a system and method for remote verification of programs to be executed by a resource-constrained device.

[0045] As mentioned previously, a Java™ verifier proceeds along an applet's execution path, verifying all external references in the process. This means that the verifier must have access to the full binary file of not only the module to be verified, but also all modules in the execution path of the module to be verified. However, some of the libraries may contain proprietary implementations that must not be revealed to consumers. For example, a vendor may install a library that contains proprietary implementation algorithms (such as an encryption algorithm) that must not be revealed to another vendor. Since typical verification methods require revealing the binary files of to the modules to be verified, such methods could reveal proprietary information. Accordingly, there is a need in the prior art for a system and method for program verification that does not reveal proprietary details.

[0046] Moreover, a library may have multiple implementations. Verification with a particular implementation does not guarantee verification with another implementation. Accordingly, there is a need in the prior art for a system and method for specifying when verification with a first implementation guarantees verification with a second implementation.

Program Module Hierarchical Dependencies

[0047] FIG. 6 shows a diagram illustrating typical hierarchical dependencies among a group of program packages (including both libraries and program applets) loaded onto a smart card. Applications may be loaded onto smart card incrementally and linked on-card for execution so that the functionality of the smart card may be updated with additional capabilities in addition to factory-programmed functionalities. In the diagram, a Java™ language framework 285 and a Java Card™ framework 280 exist at a Java Card™ API level. Above the Java Card™ API level is a custom API level with one or more custom frameworks 290. The custom framework 290 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 295, 300 and 305 reside.

[0048] Each of the boxes shown in FIG. 6 represents a Java™ package. A package is called a library package if it exports items and is therefore referenced by other packages. A package is called an applet package if it contains a program entry point. Some packages are both library and applet packages.

[0049] As shown in FIG. 6, a package may depend on other packages at the same API level or from those packages in lower API levels. The Java Card™ framework 280 may have dependencies from the Java™ language framework 285. Moreover, the custom framework 290 at the custom API level and the applets 300 and 305 may have references that depend from the Java Card™ framework 280. In turn, the applet 295 may have references that depend on the custom framework 290. The applet 295 and the custom framework 290 may also depend on the Java™ language framework 285. Applets may also depend on one another as shown by the line from Applet 305 to Applet 300. In this case, Applet 300 is both an applet and library package.

[0050] Although the example of FIG. 6 shows linear dependencies, non-linear dependencies such as circular dependencies may be supported using a suitable converter and installation tool.

Post-issuance Install

[0051] The Java Card™ CAP file format provides for the post issuance installation of applications. In other words, the CAP file allows the content of a resource-constrained device to be updated after the device has been issued to an end user. The capability to is install applications after the card has been issued provides card issuers with the ability to respond dynamically to their customer's changing needs. For example, if a customer decides to enroll in the frequent flyer program associated with the card, the card issuer can add this functionality, without having to issue a new card.

[0052] The Java Card™ CAP file format thus provides more flexibility for application issuers. Application issuers may implement transactional services as applets, and then host these applets, either in their own cards or in the cards of other issuers with whom they do business. For example, an issuer may provide a core service to clients in the form of Java™ applets for the issuer's cards. The clients will then combine these applets with other applets designed to provide a variety of value added services. These applet combinations can be updated through the dynamic applet loading process to meet the changing needs of individual customers.

[0053] Turning now to FIG. 7, a block diagram that illustrates preparation of a resource-constrained device without post-issuance installation is presented. A manufacturer typically prepares the resource-constrained device by loading it with some initial content (310). This initial content typically includes the native OS, Java Card™ VM and some or all of the Java Card™ API packages (320). Some initial applets and/or libraries may be provided by an applet or library provider (315). The initial content is burned into ROM. This process of writing the permanent components into the non-mutable memory of a chip for carrying out incoming commands is called masking. The manufacturer may also load general data onto the card's non-volatile memory. This data is identical across a large number of cards and is not specific to an individual. An example of this general data is the name of a card manufacturer.

[0054] Typically, the manufacturer also personalizes the content of a card by assigning the card to a person. This may occur through physical personalization or through electronic personalization. Physical personalization refers to permanently marking by, for example, embossing or laser engraving the person's name and card number on the physical surface of a card. Electronic personalization refers to loading personal data into a card's non-volatile memory. Examples of personal data include a person's name, personal ID or PIN number, and personal key.

[0055] Next, an issuer 320 obtains an initialized device from the manufacturer. The issuer may obtain additional applets or libraries from a provider and load the additional content onto the device. This further customization of the cards is performed by installing the applets or libraries in the form of CAP files. The issuer may also load general data, such as the issuer name, into the card's non-volatile memory.

[0056] After preparing the cards (320), the issuer disables subsequent installation of libraries or applets on the device and distributes the device to an end user 325. At this point, the card is ready for use having its complete content. Since installation has been disabled, no further content will be added after the card has been issued. The card may be obtained from an issuer, or it can be bought from a retailer. Cards sold by a retailer can be general-purpose, in which case personalization is often omitted.

[0057] Turning now to FIG. 8, a block diagram that illustrates preparation of a resource-constrained device with post-issuance installation is presented. The diagram illustrates the case where a “trusted” installer 330 installs additional content on the device after the device has been issued to the end user 335. The post-issuance installer 330 is “trusted” because of a preexisting agreement between the post-issuance installer 330 and the issuer 340. In this case, the issuer 340 distributes the device to the end user 335 without disabling subsequent installations. The end user may update the content of the resource-constrained device by presenting it to a “trusted” post-issuance installer 330. The “trusted” post-issuance installer 330 installs additional content on the resource-constrained device and returns it to the end user 335. The installation is performed by transmitting a CAP file to the device.

[0058] In the scenario illustrated in FIGS. 7 and 8, the roles of the manufacturer, issuer, services provider and applet provider are described. These roles can be filled by one or more entities.

[0059] Typically, each of the roles described in FIGS. 7 and 8 entail testing the applets and packages before they are installed on the device. Testing checks the functional behavior of these modules, confirming that given a particular input a required output is produced. Testing examines a different domain than verification, described above.

[0060] A Java Card™ system may be constructed incrementally and at each stage, it is desirable to ensure program integrity. For example, the manufacturer may populate a resource-constrained device with one or more libraries. Before shipping, it would be desirable for the manufacturer to guarantee the content integrity. At this stage, there are only libraries on the device, and no applets. Without an applet, there is no applet entry point and therefore no execution path for a verifier to follow. If an issuer then adds an applet, it would be desirable continue to ensure the content integrity. Accordingly, a need exists in the prior art for a system and method for remote program verification that accounts for iterative installation. There is a further need for a system and method for resource-constrained device program verification that protects against untrusted post-issuance installers.

Binary Compatibility

[0061] In Java Card™ technology, a change to a type in a Java™ package results in a new CAP file. A new CAP file is binary compatible with a preexisting CAP file if another CAP file converted using the export file of the preexisting CAP file can link with the new CAP file without errors.

[0062] The Java™ Language Specification includes several examples of binary compatible changes for the Java™ language. These examples include adding a class and adding a field to a class. Examples of binary incompatible changes include deleting a class and changing the parameters to a method.

[0063] The Java Card™ Virtual Machine specification defines binary compatible changes to be a strict subset of those defined for the Java™ programming language. An example of a binary compatible change in the Java™ programming language that is not binary compatible in the Java Card™ platform is adding a public virtual method to a class that can be extended by a referencing binary file.

[0064] Turning now to FIG. 9, a block diagram that illustrates binary compatibility is presented. FIG. 9 shows an example of binary compatible CAP files, P1 (360) and P1′ (365). The preconditions for the example are: The package P1 is converted to create the P1 CAP file (360) and P1 export file (370), and package P1 is modified and converted to create the P1′ CAP file (365). Package P2 imports package P1, and therefore when the P2 CAP file (375) is created, the export file of P1 (370) is used. In the example, P2 is converted using the original P1 export file (370). Because P1′ is binary compatible with P1, P2 may be linked with either the P1 CAP file (360) or the P1′ CAP file (365).

[0065] The Java Card™ Virtual Machine further specifies that major and minor version numbers be assigned to each revision of a binary file. These version numbers are record in both CAP and export files. When the major version numbers of two revisions are not equal, the two revisions are not binary compatible. When the major version numbers of the two revisions are equal, the revision with the larger minor version number is binary (backward) compatible with the revision with the smaller minor version number.

[0066] The major and minor versions of a package are assigned by the package provider, A major version is changed when a new implementation of a package is not binary compatible with the previous implementation. The value of the new major version is greater than the version of the previous implementation. When a major version is changed, the associated minor version is assigned the value of 0.

[0067] When a new implementation of a package is binary compatible with the previous implementation, it is assigned a major version equal to the major version of the previous implementation. The minor version assigned to the new implementation is greater than the minor version of the previous implementation.

[0068] Both an export file and a CAP file contain the major and minor version numbers of the package described. When a CAP file is installed on a Java Card™ enabled device, a resident image of the package is created, and the major and minor version numbers are recorded as a part of that image. When an export file is used during preparation of a CAP file, the version numbers indicated in the export file are recorded in the CAP file.

[0069] During installation, references from the package of the CAP file being installed to an imported package can be resolved only when the version numbers indicated in the export file used during preparation of the CAP file are compatible with the version numbers of the resident image. They are compatible when the major version numbers are equal and the minor version of the export file is less than or equal to the minor version of the resident image.

[0070] Any modification that causes binary incompatibility in Java Card™ systems may cause an error at run time. Accordingly, an additional need exists in the prior art for a system and method for program verification that ensures binary compatibility.

Summary of the Invention

[0071] A method of operating a computer system includes providing a first version of a program in memory and verifying the program prior to program execution. The first version of a program includes at least one program unit. Each program unit includes an Application Programming Interface (API) definition file and an implementation, each API definition file defines items in its associated program unit that are made accessible to one or more other program units and each implementation includes executable code corresponding to the API definition file. The executable code includes type specific instructions and data. Program verification includes indicating a verification error when a first version of a first program unit implementation is not internally consistent, indicating a verification error when the first version of the first program unit implementation is inconsistent with the version of the program unit API definition file associated with the first version of the first program unit implementation, receiving a second version of the first program unit implementation and a second version of the first program unit API definition file, verifying the second version of the first program unit implementation and verifying that the second version of the first program unit implementation is binary compatible with the first version of the first program unit implementation by comparing the first version of the first program unit API definition file and the second version of the first program unit API definition file.

Brief Description of the Drawings

[0072] FIG. 1 is a high level flow diagram that illustrates program verification.

[0073] FIG. 2 is a high level flow diagram that illustrates verification of an application to be executed on a resource-rich device.

[0074] FIG. 3 is a block diagram that illustrates the need for program verification.

[0075] FIG. 4 is a block diagram that illustrates development of an applet for a resource-constrained device.

[0076] FIG. 5 is a block diagram that illustrates a Converted Applet (CAP) file format.

[0077] FIG. 6 is a block diagram that illustrates hierarchical dependencies between application packages.

[0078] FIG. 7 is a block diagram that illustrates preparation of a resource-constrained device without post-issuance install.

[0079] FIG. 8 is a block diagram that illustrates preparation of a resource-constrained device with post-issuance install.

[0080] FIG. 9 is a block diagram that illustrates binary compatibility.

[0081] FIG. 10A is a flow diagram that illustrates verification that follows an execution path.

[0082] FIG. 10B is a code sample that illustrates verification that follows an execution path.

[0083] FIG. 10C is a flow diagram that illustrates verification that follows an execution path to an API in accordance with one embodiment of the present invention.

[0084] FIG. 10D is a code sample that illustrates verification that follows an execution path to an API in accordance with one embodiment of the present invention.

[0085] FIG. 11A is a block diagram that illustrates one embodiment of the present invention.

[0086] FIG. 11B is a block diagram that illustrates verification on a resource rich device in accordance with one embodiment of the present invention.

[0087] FIG. 11C is a block diagram that illustrates verification on a terminal device in accordance with one embodiment of the present invention.

[0088] FIG. 12 is a high level flow diagram that illustrates a verification method in accordance with one embodiment of the present invention.

[0089] FIG. 13A is a block diagram that illustrates verification relationships using Application Programming Interface (API) definitions in accordance with one embodiment of the present invention.

[0090] FIG. 13B is a block diagram that illustrates implementation-independent verification using an API definition file with multiple implementations in accordance with one embodiment of the present invention.

[0091] FIG. 14 is a flow diagram that illustrates incrementally constructing a verified system in accordance with one embodiment of the present invention.

[0092] FIG. 15A is a block diagram that illustrates verification and installation of an initial library in accordance with one embodiment of the present invention.

[0093] FIG. 15B is a block diagram that illustrates verification and installation of an applet that references a library in accordance with one embodiment of the present invention.

[0094] FIG. 16 is a flow diagram that illustrates verifying a library or applet in accordance with one embodiment of the present invention.

[0095] FIG. 17 is a flow diagram that illustrates verifying external references using an API definition file in accordance with one embodiment of the present invention.

[0096] FIG. 18 is a flow diagram that illustrates verifying a package with its corresponding API definition file in accordance with one embodiment of the present invention.

[0097] FIG. 19 is a flow diagram that illustrates loading a library or applet onto a resource-constrained device in accordance with one embodiment of the present invention.

[0098] FIG. 20A is a block diagram that illustrates verification using API definition files of backward compatible revisions in accordance with one embodiment of the present invention.

[0099] FIG. 20B is a block diagram that illustrates verification using API definition files of backward compatible revisions in accordance with one embodiment of the present invention.

[0100] FIG. 20C is a flow diagram that illustrates verifying versions using API definition files in accordance with one embodiment of the present invention.

[0101] FIG. 20D is a flow diagram that illustrates verifying that the content of a new API definition file is backward compatible with the content of an old API definition file in accordance with one embodiment of the present invention.

[0102] FIG. 21A is a block diagram that illustrates verification without post-issuance installation in accordance with one embodiment of the present invention.

[0103] FIG. 21B is a block diagram that illustrates verification with trusted post-issuance installation in accordance with one embodiment of the present invention.

[0104] FIG. 21C is a block diagram that illustrates verification with untrusted post-issuance installation in accordance with one embodiment of the present invention.

[0105] FIG. 21D is a block diagram that illustrates verification including binary compatibility with untrusted post-issuance installation in accordance with one embodiment of the present invention.

Detailed Description of the Preferred Embodiments

[0106] Those of ordinary skill in the art will realize that the following description of the present invention is illustrative only. Other embodiments of the invention will readily suggest themselves to such skilled persons having the benefit of this disclosure.

[0107] This invention relates to computer systems. More particularly, the present invention relates to a system and method for remote distributed program verification using API definition files. The invention further relates to machine-readable media on which are stored (1) the layout parameters of the present invention and/or (2) program instructions for using the present invention in performing operations on a computer. Such media includes by way of example magnetic tape, magnetic disks, optically readable media such as CD ROMs and semiconductor memory such as PCMCIA cards. The medium may also take the form of a portable item such as a small disk, diskette or cassette. The medium may also take the form of a larger or immobile item such as a hard disk drive or a computer RAM.

[0108] According to embodiments of the present invention, a verifier uses API definition files of program modules to perform inter-module consistency checks. Each program has an associated verification status value that is True if the program's integrity is verified by the verifier, and it is otherwise set to False. Use of the verifier in accordance with the present invention enables verification of a program's integrity and allows the use of an interpreter that does not execute the usual stack monitoring instructions during program execution, thereby greatly accelerating the program interpretation process.

[0109] According to embodiments of the present invention, verification does not continue beyond an API definition file. This differs from typical verification methods that continue the verification process into an implementation of the API definition file. An API definition file defines the context of a binary file in relationship to other referenced binary files. Once it is shown that binary files are implemented in accordance with their API definition files, binary files that reference items in other binary files need only look to the API definition files of whatever binary files implement those items to determine whether two binary files are compatible. Verifying that a binary file is implemented in accordance with its API thus obviates the need for other binary files that reference the verified binary file to continue the verification process into the verified binary file because it has already been verified. Using API definition files in accordance with the present invention therefore provides a mechanism for making conclusions regarding whether a referencing program passes verification, without the disadvantages of typical known verification methods.

[0110] FIGS. 10A to 10D illustrate the two approaches for verification discussed above. FIGS. 10A and 10B illustrate typical verification methods that continue the verification process into an implementation that includes externally referenced items. FIGS. 10C and 10D illustrate verification that uses API definition files to verify a program unit that includes external references in accordance with the present invention.

[0111] The examples in FIGS. 10A and 10B illustrate analysis which is typically performed during verification using a virtual stack. The virtual stack is validated and updated during verification based on the operations defined for instructions in a method. (For examples of virtual stack usage during verification, See U.S. Pat. No. 5,668,999 to Gosling, U.S. Pat. No. 5,748,964 to Gosling and U.S. Pat. No. 5,740,441 to Yellin et al.)

[0112] Turning now to FIG. 10A, a flow diagram that illustrates verification that follows an execution path is presented. At 400, a bytecode program is loaded into a verifier and the verifier is initialized. At 405, the instruction pointer is set to the first instruction in the program. At 410, a determination is made regarding whether the instruction is a method invocation instruction. If the instruction is not a method invocation instruction, the instruction is verified at 435. If the instruction is a method invocation instruction, at 415, a determination is made regarding whether the current virtual stack matches the list of expected parameter and result types, also referred to as the method signature, found in the binary file that contains the referenced method. If there is no match, a verification error is indicated at 430. If there is a match, at 420, the invoked method is verified. At 425 a determination is made regarding whether the invoked method was successfully verified. If the invoked method was not successfully verified, a verification error is indicated at 430. At 440, a determination is made regarding whether the current instruction is the last instruction. If the current instruction is not the last instruction, verification continues with the next instruction at 445. Verification terminates at 450 when the last instruction has been examined.

[0113] With respect to reference numerals 415-425 of FIG. 10A, when a method invocation instruction is encountered during verification that is coupled with execution, a typical verifier performs the following operations pertaining to the content of the referencing binary file.

[0114] 1. The calling context is verified to determine whether it has appropriate permission to reference the method found in the referenced binary file. For example, a protected method can only be invoked by a method in a subclass of or a member of the class in which the method is declared.
[0115] 2. The arguments found on the virtual stack at the point of invocation in the referencing binary file are verified to determine whether they are appropriate given the declaration of the invoked method found in the referenced binary file.
[0116] 3. The virtual stack is updated by removing the arguments to the invoked method and adding the return type, if any, of the invoked method. The return type is defined in the referenced binary file.
[0117] 4. Verification of the referencing binary file continues at the instruction after the method invocation using the updated virtual stack.

[0118] Typically, either before step 1 or between steps 2 and 3, the referenced binary file is verified. Regardless of the exact timing, when verification is coupled with execution, a referenced binary file is verified before it is executed.

[0119] The example shown in FIG. 10A does illustrate verification of references to non-methods such as classes, interfaces and fields. Typically, verification of such non-method references also entails examining the referenced items. Furthermore, when examining such referenced items, the referenced binary file that contains the referenced item is also typically verified.

[0120] Turning now to FIG. 10B, a code sample that illustrates verification that follows an execution path is presented. Figure 10B includes code samples for a library package L0500 and applet A1505. Applet A1505 includes references to items in package L0500. FIG. 10A also illustrates a virtual stack before (510) and after (515) verification of method invocation instructions in L0500 and A1505. Method A10520 references method A1525 at reference numeral 530. Method A1525 references method L01535 at reference numeral 540. Method L01535 references method L02545 at reference numeral 550.

[0121] Verification of applet A1505 begins with method A10520. At 530, method A10520 invokes method A11525 with the short integer parameter S 555 and assigns the result to byte array ba 560. In preparation for the method A11525 invocation, the method A11525 parameter types are put on the stack. In Java™ technology, values of type byte, short and integer are represented as integer types on the stack. Thus, before invoking method A11525, the virtual stack 560 contains type int, the type for S 555. This matches the declaration of method A11525 found in the A1 binary file 505.

[0122] At 540, method A1525 invokes method L01535 and assigns the result to byte array type ba 565. Before invoking method L01535, the virtual stack 570 contains a reference to class A1. The expected type is type Object 575. A1570 is assignment-compatible with Object 575 because A1570 extends Object (580). This matches the declaration of method L01535 found in the L0 binary file 500.

[0123] At 575, method L01535 invokes method L02545 and assigns the result to float value f 585. Before invoking method L02550, the virtual stack 590 contains a reference to class Object. The virtual stack 590 also contains an integer type corresponding to integer I 595. This matches the declaration of method L02545 found in the L0 binary file 500.

[0124] Next, the virtual stack is updated by removing the arguments to the invoked method and adding the return type, if any, of the invoked method. The return type is defined in the referenced binary file. In the above example, method L02545 returns float type f 600, which matches the method L02 return type of float f 605. Method L01535 returns an integer type. At 565, the returned integer type is explicitly cast to type byte, which matches the type of ba[0] 610. Method A11525 returns a byte array, which corresponds to the type of byte array ba 560.

[0125] Thus, method A10520 has been verified by examining the content of method A10520 and the binaries of all compilation units referenced by method A10520.

[0126] Verification using an API definition file according to embodiments of the present invention follows the same four steps shown above with reference to FIG. 10A, except that information about the invoked method is obtained from an API definition file instead of a binary file. The conclusions drawn regarding verification of the referencing binary file are the same in both cases. In addition, at some point during verification, the API definition file is verified for internal consistency. This step is parallel to verifying a referenced binary file. Furthermore, during verification using an API definition file according to embodiments of the present invention, the assumption is made that an implementation of the API definition file has been verified in a previous operation and that the implementation is complainant with the API definition file. This is described in more detail with reference to FIGS. 10C and 10D.

[0127] Turning now to FIG. 10C, a flow diagram that illustrates verification that follows an execution path to an API definition file in accordance with one embodiment of the present invention is presented. At 700, a verifier receives a bytecode program and the verifier is initialized. At 705, the instruction pointer is set to the first instruction in the program. At 710, a determination is made regarding whether the current instruction is a method invocation to an external method. If the current instruction is not a method invocation to an external method, the instruction is verified at 730. If the instruction is a method invocation instruction, at 715, a determination is made regarding whether the virtual stack matches the method signature found in an API definition file that corresponds to the binary file of the invoked method. If the virtual stack does not match the method signature, a verification error is indicated at 725. If the virtual stack matches the method signature, the virtual stack is updated at 720. At 735, a determination is made regarding whether the current instruction is the last instruction. If there is another instruction, the next instruction is pointed to at 740 and verification continues at 710. Verification ends at 745 when the last instruction has been examined. A detailed example that illustrates this process is described with reference to FIG. 10D.

[0128] Turning now to FIG. 10D, a code sample that illustrates verification that follows an execution path to an API in accordance with one embodiment of the present invention is presented. FIG. 10D includes code samples for a library package L0800 and applet A1805. Applet A1805 includes references to items in package L0800. FIG. 10D also illustrates a virtual stack before (810) and after (815) execution of source code statements in L0800 and A1805. Method A10820 references method A11825 at reference numeral 830. Method A11825 references method L01835 at reference numeral 840.

[0129] Verification of applet A1805 begins with method A10820. At 830, method A10820 invokes method A11825 with the short integer parameter S 845 and assigns the result to byte array ba 850. In preparation for the method A11 invocation (830), the method A11825 parameter types are put on the stack 850. As mentioned above, in Java™ technology, values of type byte, short and integer are represented as integer types on the stack. Thus, before invoking method A11825, the virtual stack 850 contains type int, the type for S 845. This matches the declaration of method A11825 found in the A1 binary file 805.

[0130] At 840, method A11825 invokes method L01835 and assigns the result to byte array type ba 855. Before invoking method L01835, the virtual stack 860 contains a reference to class A1. The expected type is type Object 865. A1860 is assignment-compaitble with Object 865 because A1860 extends Object (870). This matches the declaration of method L01835 found in the L0 API definition file 800.

[0131] Next, the virtual stack is updated by removing the arguments to the invoked method and adding the return type, if any, of the invoked method. The return type is defined in the referenced API definition file. In the above example, method L01875 returns an integer type. At 855, the returned integer type is explicitly cast to type byte, which matches the type of ba[0] 880. Method A11825 returns a byte array, which corresponds to the type of byte array ba 850.

[0132] Thus, method A10820 has been verified without reference to the binary files containing compilation units referenced by method A10820. Instead, method A10820 has been verified by examining the content of method A10820 and the API definition files of all compilation units referenced by method A10820.

[0133] The description regarding verification in FIGS. 10C and 10D illustrated verification with respect to a method. This example is intended for illustrative purposes only. Those of ordinary skill in the art will recognize that verification of other references may be performed in a similar manner using an API definition file. These references include by way of example, references to fields, classes and interfaces.

[0134] Referring now to FIG. 11A, there is shown a distributed computer system having multiple client computers 980, 1090 and multiple server computers 985. In one embodiment, each client computer 980, 1090 is connected to the servers 985 via the Internet 1055, although other types of communication connections could be used. While most client computers are desktop computers, such as Sun workstations, IBM compatible computers and Macintosh computers, virtually any type of computer can be a client computer. In one embodiment, each client computer includes a CPU 990, a user interface 995, a memory 1000, Internet access processor 1035 and a communications interface 1005. Client memory 1000 stores:

- [0135] an operating system 1010;
- [0136] a program converter 1015, which converts binary file and related API definition files into optimized binary files and API definition files;
- [0137] a program verifier 1020 for verifying whether or not a specified program satisfies certain predefined integrity criteria;
- [0138] at least one optimized binary file repository 1025, for locally storing optimized binary files in use and/or available for use by users of the computer 1000;
- [0139] at least one API definition file repository 1030 for storing export files.

[0140] The converter 1015 converts a binary file into an optimized binary file and an API definition file of the optimized binary file. If the binary file includes external reference, the converter 1015 uses the API definition file stored in 1030 of the module including the external reference to verify the external reference.

[0141] According to one embodiment of the present invention, the resource-constrained device is a Java Card™ enabled device. In this embodiment, the API definition file is Java Card™ export file, the binary file is a class file and the optimized binary file is a CAP file. Also, the methods in a class to be loaded are bytecode programs, which when interpreted will result in a series of executable instructions. According to this embodiment, the bytecode program verifier 1020 verifies the integrity of the bytecode programs in a CAP file with reference to the CAP file, the export file corresponding to the CAP file, and the export file containing externally referenced items. If all the methods are successfully verified, the CAP file is sent to the resource-constrained device 1040 via a terminal device 1045.

[0142] As shown in FIG. 11A, a terminal 1045 is equipped with a card acceptance device (CAD) 1050 for receiving a card. The terminal 1045 may be connected to a network 1055 that communicates with a plurality of other computing devices, such as a server 985. It is possible to load data and software onto a smart card over the network 1055 using card equipped devices. Downloads of this nature include applets or libraries 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 verified 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 1055 can be a LAN or WAN such as the Internet or other network.

[0143] The third computer node 1040, assumed here to be configured as smart card or other resource-constrained device, includes a microprocessor 1060, a memory 1065, and an I/O port 1070 that connects the second computer node to the terminal device 1045. Resource-constrained device memory 1065 stores programs for execution by the processor 1060.

Resource-constrained device memory 1065 stores:

[0144] an operating system 1080;
- [0145] a loader 1085 for loading a verified optimized binary file via I/O port 1070;
- [0146] an interpreter 1050 for executing a module within an optimized binary file;
- [0147] at least one program 1075 for execution by microprocessor 1060.

[0148] The first, second and third computer nodes 980, 1045 and 1040 may utilize different computer platforms and operating systems 1010, 1080 such that object code program executed on either one of the two computer nodes cannot be executed on the other. For instance, the server node 985 might be a Sun Microsystems computer using a Unix operating system while the user workstation node 980 may be an IBM compatible computer system using a Pentium III microprocessor and a Windows 98 operating system. Furthermore, other user workstations coupled to the same network and utilizing the same server 985 might use a variety of operating systems.

[0149] According to embodiments of the present invention, verification is performed before the module is loaded on a resource-constrained device, herein referred as remote verification. According to one embodiment of the present invention, verification is performed on a resource-rich device such as a desktop PC, as illustrated in FIG. 11A. According to another embodiment of the present invention, remote verification is performed on a terminal device, as illustrated in FIG. 11B.

[0150] Turning now to FIG. 11B, a block diagram that illustrates verification on a resource-rich device before installation in accordance with one embodiment of the present invention is presented. A verifier 1110 resident on the resource-rich device 1100 verifies the optimized binary file 1105. The optimized binary file 1105 is transferred to a terminal device 1115 having an installer 1120. The installer 1120 communicates with a loader 1130 on a resource-constrained device 1125 to load the verified optimized binary file.

[0151] According to one embodiment of the present invention the loader confirms that the context in which the binary file will be linked and executed is compatible with the context of the API definition files used during verification. Additionally, the context of a verified and loaded binary file must not be allowed to change in to an incompatible state. In a Java Card™ compliant system, this requirement is fulfilled by ensuring that a referenced binary file is never deleted or updated.

[0152] Turning now to FIG. 11C, a block diagram that illustrates verification on a terminal device before installation in accordance with one embodiment of the present invention is presented. The optimized binary file 1155 is transferred to a terminal device 1165 having an off-device installer 1170. A verifier 1160 resident on the terminal device 1165 verifies the optimized binary file 1155. The installer 1170 communicates with a loader 1180 on a resource-constrained device 1175 to load the verified optimized binary file.

[0153] Turning now to FIG. 12, a flow diagram that illustrates verification in accordance with one embodiment of the present invention is presented. At 1200, a library or applet is received. At 1205, the library or applet is verified using the applet binary file, the API definition file of the library or applet if it exports items, and the API definition file of any binary files containing items referenced by the applet binary file. At 1210, the library or applet is stored in a secure state to protect against unauthorized modification. At 1215, the library or applet is loaded for subsequent linking and execution on a resource-constrained device.

[0154] Turning now to FIG. 13A, a block diagram that illustrates verification relationships using Application Programming Interface (API) definitions in accordance with one embodiment of the present invention is presented. FIG. 13A illustrates the process of verifying applet A1. In this example, A1 is an applet that references the library L1. Library L1 includes a reference to Library L0. Verification proceeds as follows: First, the L0 API definition file 1230 is verified with the L0 binary file 1235. Next, the L1 binary file 1240 is verified with the L0 API definition file 1230. Next, the L1 API definition file 1245 is verified with the L1 binary file 1240. Verification of the L1 binary file 1240 with the L0 API definition file 1230 thus indicates the L1 binary file 1240 is verified with the L0 binary file 1235. Next, the A1 binary file 1250 is verified with the L1 API definition file 1245. Verification of the A1 binary file 1250 with the L1 API definition file 1245 thus indicates the A1 binary file 1250 is verified with the L1 binary file 1240. Thus, a fully verified collection of binary files (A11250, L11245 and LO 1230) has been constructed.

[0155] As mentioned previously, an API specifies how one program module may interact with another. Different vendors may implement an API in different ways, as long as they adhere to the API definition file. For example, one vendor may choose to implement a method that sorts a set of values using an algorithm optimized for speed, while another vendor may choose to implement an algorithm optimized for low memory usage. In both cases, the implementations would be compliant with an API definition file containing a method that performs a sort, and vary in implementation details.

[0156] According to embodiments of the present invention, verification does not depend upon a particular implementation. More specifically, if a referencing binary file references an API and there is more than one implementation for that AP1, the referencing binary file is said to be verified with each implementation if the referencing binary file verifies with the referenced API and if each implementation of the API verifies with the referenced API definition file. This example is illustrated in FIG. 13B.

[0157] Turning now to FIG. 13B, a block diagram that illustrates implementation-independent verification using an API definition file with multiple implementations in accordance with one embodiment of the present invention is presented. In the example, L1 is a library that references library L0. Library L0 has two implementations from two different vendors, vendor 1 implemented 1270 and vendor 2 implemented 1275. Both the L0 binary file from vendor 1 (1270) and the L0 binary file from vendor 2 (1275) are verified with the L0 API definition file 1265. Next, the L1 binary file 1260 is verified with the L0 API definition file 1265. Since both L0 binary files 1270 and 1275 are verified against the L0 API definition file 1265 and since the L1 binary file 1260 is so verified against the L0 API definition file 1265, the L1 binary file 1260 is verified against both particular implementations of L0, that is binary files 1270 and 1275. Thus, two fully verified collections of binary files have been constructed: 1) L1 binary file 1260 and L0 binary file provided by vendor 1 (1270); and 2) L1 binary file and L0 binary file provided by vendor 2 (1275).

[0158] As shown in FIG. 13B, verification applies to all permutations of linking. Thus, when binary file L1 (1260) is installed on one resource-constrained device, it may be linked with the L0 binary file from vendor 1 (1270). It may also be installed on another resource-constrained device and linked with the L0 binary file from vendor 2 (1275).

[0159] The number of implementations illustrated in FIG. 13B is not intended to be limiting in any way. Those of ordinary skill in the art will recognize that the invention is applicable when more that two implementations are provided.

[0160] According to one embodiment of the present invention, program verification is performed iteratively, one program module at a time. This is also called distributed verification. Referring to FIG. 14, a flow diagram that illustrates incrementally constructing a verified system in accordance with one embodiment of the present invention is presented. An initial library is verified (1280), stored in a secure state (1285) and loaded (1290). At 1295, the API definition file of the initial verified library is provided for use by client libraries or applets that reference library. Each client library or applet is verified (1300), stored in a secure state (1305) and loaded (1310). At 1315, a check is made to determine whether the client exports any items. If the client exports any items, the API definition file of the client library is provided for use by other libraries or applets that reference the client library (1295).

[0161] According to another embodiment of the present invention, the loading of verified libraries and applets is delayed until all the libraries and applets required for an update have been verified. In both this case and the embodiment described immediately above, the process of performing verification using API definition files is the same.

[0162] Turning now to FIG. 15A, a block diagram that illustrates verification and installation of an initial library in accordance with one embodiment of the present invention is presented. In this example, the resource-constrained device 1320 contains a loader 1325, an interpreter and I/O services 1330. No libraries or applets have been installed at this point. This initial content provides the foundation for installing and executing libraries and applets. First, a verifier 1335 on a resource-rich device 1340 verifies the L0 binary file 1345, the library to be added. The resource-rich device may be by way of example, a desktop PC or a terminal device. Verification of the L0 binary file 1345 includes verifying the L0 binary file 1345 and verifying the L0 API definition file 1350 with the L0 binary file 1345. Next, the verified L0 binary file 1345 is installed on a resource-constrained device 1320. After installation, the content of the resource-constrained device 1320 is said to be verified.

[0163] Turning now to FIG. 15B, a block diagram that illustrates verification and installation of an applet that references a library in accordance with one embodiment of the present invention is presented. In this example, resource-constrained device 1360 has been initialized with library L0 (see FIG. 15A) and applet A1 is to be added to the resource-constrained device 1360. Applet A1 binary file 1365 references library L0. Since the L0 binary file 1370 has already been verified with its corresponding L0 API definition file 1375 and installed, the verified API definition file for L01375 is resident on the resource-rich device 1380. The A1 binary file 1365 is verified using the API definition file of the referenced library, L01375. After verification, the A1 binary file 1365 is installed on the resource-constrained device. After installation, the content of the resource-constrained device (A1 binary file 1365 and L0 binary file 1370) is said to be verified.

[0164] Those of ordinary skill in the art will recognize that the scenarios illustrated in FIGS. 15A and 15B can be combined to verify and install a module that both references a library and exports an API. The module's exported API definition file will be available to be referenced by succeeding binary files.

[0165] Turning now to FIG. 16, a flow diagram that illustrates verifying a library or applet in accordance with one embodiment of the present invention is presented. At 1400, a library or applet package is received. At 1405, intra-module checks are performed to determine whether the package is internally consistent. At 1410, inter-module checks are performed to determine whether the external references of the package are consistent within the context of the API definition file of each external reference. At 1415, a check is made to determine whether the package exports any items. If the package exports items, the current package is verified against its API definition file (1420).

[0166] The order of the intra-module checks and the inter-module checks shown in FIG. 16 is not intended to indicate a required order of operations. During program verification that follows an execution path, those of ordinary skill in the art will recognize that when intra-module checks or inter-module checks are performed can depend on the context of the element being verified. When performing intra-module checks, if an element is encountered that references an external item, an inter-module check can be performed immediately. Alternatively, all inter-module checks can be postponed and performed in one step as shown in FIG. 16.

[0167] The intra-module checks may include by way of example, verifying binary file format and verifying that:

- [0168] a class is not a subclass of a “final” class,
- [0169] no method in the class overrides a “final” method in a superclass,
- [0170] each class, other than “Object” has a superclass,
- [0171] class reference, field reference and method reference in the constant pool has a legal name, class and type signature.

[0172] See, for example, U.S. Pat. No. 5,668,999 to Gosling, U.S. Pat. No. 5,748,964 to Gosling and U.S. Pat. No. 5,740,441 to Yellin et al.

[0173] Turning now to FIG. 17, a flow diagram that illustrates verifying external references using an API definition file in accordance with one embodiment of the present invention is presented. FIG. 17 provides more detail for reference numeral 1410 in FIG. 16. At 1430, a program unit such as a library or applet package is received. If the API definition file of the referenced package is not found, a verification error is indicated. At 1435, the API definition file of the referenced package is loaded. At 1440, the package attributes are compared. The package attributes may include by way of example, the package name and version. If the package attributes are not compatible, a verification error is indicated.

[0174] At 1445, for each referenced class and interface, the usage of the class or interface in the binary file is compared to the corresponding usage in the API definition file. If the class or interface is not found in the API definition file, a verification error is indicated. If usage of the class or interface is not compatible, a verification error is indicated. An example of an incompatibility is an attempt to create an instance of an abstract class or interface.

[0175] At 1450, for each referenced field, the field is located in the API definition file, and the usage of the field in the binary file is compared to the corresponding definition in the API. If the field is not found in the API definition file, a verification error is indicated. If the usage of the field is not compatible, a verification error is indicated. An example of an incompatibility is an attempt to store a floating-point value into a field that is declared as an integer (int)-type in the API definition file.

[0176] At 1455, for each referenced method, the method is located in the API definition file, and the usage of the method in the binary file is compared to the definition in the API. If the method is not found in the API definition file, a verification error is indicated. If the usage of the method is not compatible, a verification error is indicated. An example of an incompatibility is an attempt to invoke a method without passing in any parameters when the method is declared in the API definition file to require one parameter of the specified type (int).

[0177] Those of ordinary skill in the art will recognize that locating and verifying usage against definitions in an API definition file can be performed sequentially in one step as shown in FIG. 16. Alternatively, locating and verifying usage against definition can be performed as the usage is encountered.

[0178] Turning now to FIG. 18, a flow diagram that illustrates verifying a package with its corresponding API definition file in accordance with one embodiment of the present invention is presented. FIG. 18 provides more detail for reference numeral 1420 in FIG. 16. FIG. 18 is not intended to indicate the order in which the various checks are performed. A library or applet package (herein referred to as a binary file) is received (1460) and the API definition file of the package is received (1465). If the API definition file of the package is not found, and the binary file exports elements, a verification error is indicated.

[0179] At 1470, the package attributes are compared. The attributes may include by way of example, the package name, version and number of classes and interfaces. Continuing this example, this step detects whether an extra class or interface is defined in the API definition file that is not present in the binary file. If the attributes are incompatible, a verification error is indicated.

[0180] Several checks are performed to verify each exported class and interface in the binary file. At 1475, the class or interface is located in the API definition file and the attributes of the class or interface as defined in the API definition file are compared to the definition of the class or interface in the binary file. If the class or interface is not found in the API definition file, a verification error is indicated. The attributes may include by way of example, the class name, flags, number of fields and number of methods. Continuing this example, this step detects whether an extra field or method is defined in, the API definition file that is not present in the binary file. Additionally, this step will detect whether an extra field or method is present in the binary file but not defined in the API definition file. If the attributes are incompatible, an error is indicated.

[0181] At 1480, the superclasses and superinterfaces are compared. See, for example, U.S. Provisional Patent Application filed Nov. 12, 1999 in the name of inventor Judith E. Schwabe, entitled “API Representation Enabling Submerged Hierarchy”, Ser. No. 60/165,298 and U.S. Provisional Patent Application filed Nov. 15, 1999 in the name of inventor Judith E. Schwabe, entitled “API Representation Enabling Submerged Hierarchy”, Ser. No. 60/165,533. If the set of public superclasses or superinterfaces of a class or interfaces, respectively, defined in the binary file do not correspond to the set in the API definition file, a verification error is indicated.

[0182] At 1485, the set of public implemented interfaces of a class in the binary file is compared to the set in the API definition file. If the sets of implemented interfaces do not correspond, a verification error is indicated.

[0183] At 1490, for each exported field in the binary file, the field is located in the API definition file and the attributes of the field in the API definition file are compared to the definition in the binary file. If the field is not located, a verification error is indicated. The attributes may include by way of example, the name, flags and type. If the attributes are incompatible, a verification error is indicated.

[0184] At 1495, for each exported method in the binary file, the method is located in the API definition file and the attributes of the method in the API definition file are compared to the definition in the binary file. If the method is not found in the API definition file, a verification error is indicated. The attributes may include by way of example, the name, flags and signature. If the attributes are incompatible, a verification error is indicated.

[0185] Turning now to FIG. 19, a flow diagram that illustrates loading a library or applet onto a resource-constrained device in accordance with one embodiment of the present invention is presented. At 1500, a program unit such as a library or applet package is received. At 1505, the program unit is authenticated. At 1510, a determination is made regarding whether the program unit references one or more other program units. If the program unit references one or more other program units, at 1515, the version of the API definition file used during verification is checked to determine whether it is compatible with the version of the referenced binary file resident on the resource-constrained device. If the versions are not compatible, an error is indicated. At 1520, the program unit is loaded or otherwise prepared for execution when the version of the API definition file used during verification is compatible with the version of the referenced binary resident on the resource-constrained device.

[0186] The invention as described thus far has pertained to scenarios where the version of a referenced binary file is the same version as its corresponding API definition file. As discussed previously, both the Java™ specification and the Java Card™ specification define behavior where the version of a referenced binary file is a newer version than the one used during preparation of the referencing binary file. Furthermore, these specifications define changes that can be made when revising a binary file that result in the new version being backward compatible with the previous version. When a newer version is backward compatible with an older version it is said to be binary compatible.

[0187] Binary compatible changes to a referenced binary file are undetectable to a referencing binary file. The updated referenced binary file is required to contain all of the elements of the API definition file of the original binary file. Accordingly, a referencing binary file is provided with a superset of the element in original API of the referenced binary file, and therefore all of the elements it references are guaranteed to be present. A referencing binary file may be successfully linked with, verified with and executed with any binary compatible revision of the original target referenced binary file. Thus, it is valid in both Java™ and Java Card™ technology to prepare a binary file using an old version of a referenced binary file and then later link, verify and execute with a new, binary compatible version of the referenced binary file.

[0188] According to one embodiment of the present invention, an additional verification step is performed on a resource-rich device to confirm whether or not a revision of a binary file is binary (backward) compatible with an earlier version. This additional step provides the functionality required to assert that a referencing binary file and a binary compatible revision of a referenced binary file constitute a verified set. The details of this verification step are described in FIGS. 20A through 20D.

[0189] Those of ordinary skill in the art will recognize that other versioning schemes can also be used to provide binary compatibility information as well.

[0190] Turning now to FIG. 20A, a block diagram that illustrates verification using API definition files of backward compatible revisions in accordance with one embodiment of the present invention is presented. The example illustrated in FIG. 20A includes an applet A1 that references library L0. Library L0 has two versions, 1.0 and 1.1. Each version of library L0 has been previously converted to a binary file and an API definition file. The A1 binary file 1530 was initially verified against L0 version 1.0. The precondition for this verification is verifying the L0 API definition file version 1.0 (1535) with the L0 binary file version 1.0 (1540). As described in FIG. 13A, these verification steps indicate that A1 binary file (1530) is verified with L0 binary file version 1.0 (1540).

[0191] Library L0 version 1.0 was subsequently changed to create L0 version 1.1. According to one embodiment of the present invention verification of the A1 binary file (1530) with the L0 version 1.1 binary file (1550) is established by verifying that L0 API definition file version 1.1 (1545) is backward compatible with L0 API definition file version 1.0 (1535) and by verifying that L0 API definition file version 1.1 (1545) verifies with L0 binary file version 1.1 (1550). Hence, a modified referenced library does not require verification of a referencing applet with the API definition file of the modified referenced library when it can be shown that the API definition file of the modified referenced library is backward compatible with the original referenced library and when the APT definition file of the modified referenced library verifies with the binary file of the modified referenced library.

[0192] The verification steps shown in FIG. 20A indicate that A1 binary file (1530) is verified with L0 binary file version 1.1 (1540).

[0193] Turning now to FIG. 20B, a block diagram that illustrates verification using API definition files of backward compatible revisions in accordance with one embodiment of the present invention is presented. FIG. 20B illustrates the case where a binary compatible version of a library has been previously installed on a resource-constrained device. The referencing binary file, A1 (1550), is prepared and verified using an earlier version of the referenced API definition file. The L0 binary file version 1.1 (1560) was previously verified with the L0 API definition file version 1.1 (1555). Next, the previously verified API (L0 API definition file version 1.1 (1555)) is verified to be backward compatible with the earlier version (L0 API definition file version 1.0 (1560))). Next, the A1 binary file (1550) is verified using the API definition files of the referenced library (L0 API definition file version 1.0 (1560)) and the A1 binary file (1550) is installed on the resource-constrained device 1565. A loader 1570 on the resource-constrained device 1565 verifies that the API definition file used during verification is compatible with the referenced binary file. The resulting content of the resource-constrained device 1565 is a verified set of binary files: A1 binary file (1550) and L0 binary file version 1.1 (1560).

[0194] Turning now to FIG. 20C, a flow diagram that illustrates verifying versions using API definition files in accordance with one embodiment of the present invention is presented. At 1600, the old version of the package API definition file is received. At 1605, the new version of the package API definition file is received. At 1610, a determination is made regarding whether the version of the new package indicates backward compatibility with the version of the old package. In Java Card™ technology, for example, this determination is made by comparing major and minor version numbers. If the new version is backward compatible, at 1615, the content of the new API definition file is verified for backward compatibility with the content of the old API definition file.

[0195] Turning now to FIG. 20D, a flow diagram that illustrates verifying that the content of a new API definition file is backward compatible with the content of an old API definition file in accordance with one embodiment of the present invention is presented. At 1620 and 1625, the old package API definition file and the new API package definition are received.

[0196] At 1630, the package attributes are compared. The attributes may include the package name and the number of classes and interfaces. If the set of classes and interfaces defined in the old API definition file is not found in the new API definition file, a verification error is indicated.

[0197] Several checks are performed for each class and interface in the old package. At 1635, the class and interface attributes are compared to the attributes of the same class or interface in the new package. The attributes may include the name, flags, number of fields and number of methods. If the sets of fields and methods defined in a class or interface in the old API definition file are not found in the corresponding class or interface in the new API definition file, a verification error is indicated. If any other the attributes of a class or interface are not binary compatible, a verification error is indicated.

[0198] At 1640, the superclasses and superinterfaces of the class or interface are compared to the same in the new package. If the sets of superclasses or superinterfaces of a class or interface, respectively, are not binary compatible, a verification error is indicated.

[0199] At 1645, the implemented interfaces of a class are compared to the same in the new package. If the sets of implemented interfaces of a class are not binary compatible, a verification error is indicated.

[0200] At 1650, for each field in the old package, the attributes are compared to the same field in the new package. The attributes may include the name, flags and type. If the attributes of a field are not binary compatible, a verification error is indicated.

[0201] At 1655, for each method in the old package, the attributes are compared to the same method in the new package. The attributes may include the name, flags and signature. If the attributes of a method are not binary compatible, a verification error is indicated.

[0202] The list of binary compatibility checks performed is not intended to be an exhaustive list. Further details regarding binary compatibility may be found in the Java™ Language Specification and the Java Card™ Virtual Machine Specification.

[0203] According to embodiments of the present invention, program modules are verified on a resource-rich device prior to an installation on a resource-constrained device such as a smart card. FIGS. 21A to 21D illustrate different embodiments in which verification is performed.

[0204] According to one embodiment of the present invention, program modules are optionally verified by a card manufacturer, a card issuer and an applet or library provider. Verification may performed by any combination of the above parties. Referring to FIG. 21A, a manufacturer ensures that the initial content is verified and prepares a device with that initial content (1660) before shipping the device to an issuer. The initial modules may be verified either by the manufacturer, the applet or library provider (1675), or both. The issuer receives the device from the manufacturer, optionally installs additional modules, disables further installations and distributes the device (1665) to an end user 1670. If additional modules are installed, the issuer ensures that they are verified before installation. The issuer, applet or library provider, or both may perform verification.

[0205] Turning now to FIG. 21B, according to another embodiment of the present invention, program modules are optionally verified by a card manufacturer (1690), a card issuer (1705), an applet provider (1700) and a trusted post-issuance installer (1695). Verification may be performed by any combination of the above parties, but must result in each module being verified before it is installed on a device. Referring to FIG. 21B, post-issuance installations by a trusted installer (1695) are allowed. Verification is optionally performed by the applet or library provider (1700) before shipping. Verification is also optionally performed by the manufacturer (1690), the issuer (1705) and the post-issuance installer (1695) before the additional content is installed on the device.

[0206] In FIG. 21B, the post-issuance installer is a trusted installer (1695). A trusted installer (1695) is an installer that has an agreement with the issuer, governing the post-issuance updates of cards. In contrast, an untrusted installer has no such agreement with the installer. When an issuer issues cards without disabling subsequent installations, an untrusted and possibly malevolent post-issuance installer could potentially add program modules to a card. Such unauthorized additions may corrupt the existing program modules or compromise them in other ways, causing the program to either execute erroneously or not execute at all.

[0207] According to another embodiment of the present invention, verification of program modules is performed in a system that allows post-issuance installations by an untrusted installer. Referring to FIG. 21C, note that FIG. 21C is the same as FIG. 21B, except that the post-issuance installer (1725) is untrusted. Preferably, the verifier in this case resides on a terminal device or another device not under the control of the untrusted installer (1725).

[0208] According to another embodiment of the present invention, verification of program modules is performed in a system that allows post-issuance installations by an untrusted installer. Furthermore, this embodiment performs binary compatibility checks as part of the verification. Referring to FIG. 21D, note that FIG. 21D is the same as FIG. 21C, except that each party that performs verification includes binary compatibility checks in the verification process. Those of ordinary skill in the art will recognize that verification that entails binary compatibility checks can also be applied to the scenarios shown in FIGS. 21A and 21B.

[0209] The above embodiments differ in the entities that are involved in the preparation of a card for an individual user. The above embodiments also differ regarding whether post-issuance installation is enabled. However, the details of verification process are equivalent, regardless of the entity performing the verification.

[0210] According to one embodiment of the present invention, the manufacturer, issuer and trusted post-issuance installer consider the applet or library to have been received from a potentially hostile environment. The verifier is run with the applet or library before installation. The manufacturer, issuer and trusted post-issuance installer make a determination regarding whether their environments are secure. If the environments are secure, the scenario depicted in either FIG. 11A (verifier on resource-rich device) or FIG. 11B (verifier on terminal) is used. If the environments are not secure, the scenario depicted in FIG. 11B (verifier on terminal) is used.

[0211] Preferably, the untrusted post-issuance installation operates in the scenario depicted in FIG. 11B (verifier on terminal).

[0212] In the scenario depicted by FIG. 11A (verifier on resource-rich device), the content provider preferably runs the verifier before shipping (using FIG. 11A), thus confirming that the binary file was not corrupted when it was prepared or stored in the applet/package provider's environment, and ensuring that the applet/package provider is not shipping a hostile binary file to the manufacture, issuer, trusted post-issuance installer, or untrusted post-issuance installer.

[0213] According to one embodiment of the present invention, verification includes binary compatibility checks. Preferably, the manufacturer and issuer confirm that the updated resource-constrained device is binary compatible with the previous version(s). This prevents an older program unit from being placed into an invalid context when installed.

[0214] According to a preferred embodiment, programmatic content is installed in a secure environment. Once a verified binary file has been installed, the smart card's programmatic content is not altered by an unauthorized entity. Therefore, once a verified binary file is installed in this secure environment, the binary file's verification status is unchanged between subsequent executions. In other words, the binary file need not be reverified before each execution.

[0215] Although the present 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.

[0216] 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 process. The required structure for a variety of these machines will appear from the description given.

[0217] 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. Also, although the invention has been illustrated showing object-by-object security, other approaches, such as class-by-class security, could be utilized.

[0218] Additionally, while embodiments of the present invention have been illustrated using applets, those of ordinary skill in the art will recognize that the invention may be applied to stand-alone application programs.

[0219] The system of the-present invention may be implemented in hardware or in a 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 device is read by the computer to perform the procedures is described. The system may also 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.

[0220] 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.

[0221] Thus, a novel system and method for program verification using API definition files has been described. While embodiments and applications of this invention have been shown and described, it would be apparent to those skilled in the art having the benefit of this disclosure that many more modifications than mentioned above are possible without departing from the inventive concepts herein. The invention, therefore, is not to be restricted except in the spirit of the appended claims.

Claims

What is claimed is:

1. A method of operating a computer system, said method comprising:

providing a first version of a program in memory, said first version of a program including at least one program unit, each program unit comprising an Application Programing Interface (API) definition file and an implementation, each API definition file defining items in its associated program unit that are made accessible to one or more other program units, each implementation including executable code corresponding to said API definition file, said executable code including type specific instructions and data; and

performing a first verification including verifying said program prior to execution of said program, said first verification including

indicating a verification error when a first version of a first program unit implementation is not internally consistent;

indicating a verification error when said first version of said first program unit implementation is inconsistent with a first version of said first program unit API definition file associated with said first version of said first program unit implementation;

receiving a second version of said first program unit implementation and a second version of said first program unit API definition file, said second version being a revised version of said first version;

performing a second verification including verifying said second version of said first program unit implementation, including

indicating a verification error when said second version of said first program unit implementation is not internally consistent; and

indicating a verification error when said second version of said fist program unit implementation is inconsistent with said second version of said first program unit API definition file; and

performing a third verification including verifying said second version of said first program unit implementation is binary compatible with said first version of said first program unit implementation by comparing said first version of said first program unit API definition file and said second version of said first program unit API definition file.

2. The method of claim 1, further comprising:

indicating a verification error when a second program unit implementation that references said first program unit is inconsistent with said first version of said first program unit API definition file; and

indicating said second program unit implementation is verified with said second version of said first program unit API definition file when said second version of said first program unit binary is compatible with said first version of said first program unit implementation.

3. The method of claim 2, further comprising:

indicating said second program unit implementation is verified with said second version of said fist program unit implementation when said second program unit implementation is verified with said second version of said first program unit API definition file.

4. The method of claim 1 wherein said first version of said first program unit API definition file is binary compatible with said second version of said first program unit API definition file when said second version of said first program unit API definition file includes a superset of each element in said first version of said first program unit API definition file.

5. The method of claim 1 wherein

said first program unit references items in at least one other program unit; and

said second verification includes indicating a verification error when said second version of said first program unit implementation is inconsistent with API definition files of each referenced program unit.

6. A program storage device readable by a machine, embodying a program of instructions executable by the machine to perform program verification, comprising:

providing a first version of a program in memory, said first version of a program including at least one program unit, each program unit comprising an Application Programming Interface (API) definition file and an implementation, each API definition file defining items in its associated program unit that are made accessible to one or more other program units, each implementation including execute code corresponding to said API definition file, said executable code including type specific instructions and data; and

performing a first verification including verifying said program prior to execution of said program said first verification including

indicating a verification error when a first version of a first program unit implementation is not internally consistent;

performing a second verification including verifying said second version of said first program unit implementation, including

indicating a verification error when said second version of said first program unit implementation is not internally consistent; and

indicating a verification error when said second version of said first program unit implementation is inconsistent with said second version of said first program unit API definition file; and

7. The program storage device of claim 6, further comprising:

8. The program storage device of claim 7, further comprising:

indicating said second program unit implementation is verified with said second version of said first progrmn unit implementation when said second program unit implementation is verified with said second version of said first program unit API definition file.

9. The program storage device of claim 6 wherein said first version of said first program unit API definition file is binary compatible with said second version of said first program unit API definition file when said second version of said first program unit API definition file includes a superset of each element in said first on of said first program unit API definition file.

10. The program storage device of claim 6 wherein

said first program unit references items in at least one other program unit; and

11. A system for executing a software application, the system comprising:

a computing system that generates executable code, comprising means for providing a first version of a program in memory, said first version of a program including at least one program unit, each program unit comprising an Application Programming Interface (API) definition file and an implementation, each API definition file defining items in its associated program unit that are made accessible to one or more other program units, each implementation including executable code corresponding to said API definition file, said executable code including type specific instructions and data; and

means for performing a first verification including verifying said program prior to execution of said program, said first verification including

means for indicating a verification error when a first version of a first program unit implementation is not internally consistent;

means for indicating a verification error when said first version of said first program unit implementation is inconsistent with a first version of said first program unit API definition file associated with said first version of said fist program unit implementation;

means for receiving a second version of said first program unit implementation and a second version of said first program unit API definition file, said second version being a revised version of said first version;

means for performing a second verification including verifying said second version of said first program unit implementation, including

means for indicating a verification error when said second version of said first program unit implementation is not internally consist; and

means for indicating a verification error when said second version of said first program unit implementation is inconsistent with said second version of said first program unit API definition file; and

means for performing a third verification including verifying said second version of said first program unit implementation is binary compatible with said first version of said first program unit implementation by comparing said first version of said first program unit API definition file and said second version of said first program unit API definition file.

12. The system of claim 11, further comprising:

means for indicating a verification error when a second program unit implementation that references said first program unit is inconsistent with said first version of said first program unit API definition file; and

means for indicating said second program unit implementation is verified with said second version of said first program unit API definition file when said second version of said first program unit binary is compatible with said first version of said first program unit implementation.

13. The system of claim 12, further comprising:

means for indicating said second program unit implementation is verified with said second version of said first program unit implementation when said second program unit implementation is verified with said second version of said first program unit API definition file.

14. The system of claim 11 wherein said fit version of said first program unit API definition file is binary compatible with said second version of said first program unit API definition file when said second version of said first program unit API definition file includes a superset of each element in said first version of said first program unit API definition file.

15. The system of claim 11 wherein

said first program unit references items in at least one other program unit; and

said second verification includes means for indicating a verification error when said second version of said first program unit implementation is inconsistent with API definition files of each referenced program unit.

16. A resource-constrained device, comprising:

memory for providing a remotely verified application software program including at least one program unit, each program unit comprising an Application Programming Interface (API) definition file and an implementation, each API definition file defining items in its associated program unit that arc made accesible to one or more other program units, each implementation including executable code corresponding to said API definition file, said executable code including type specific instructions and data, said remote verification including verifying a second version of a first program unit implementation is binary compatible with a first version of said first program unit implementation by comparing said first version of said first program unit API definition file and said second version of said first program unit API definition file; and

a virtual machine that is capable of executing instructions included within said application software program.

17. The resource-constrained device of claim 16 wherein said resource-constrained device comprises a smart card.

18. The resource-constrained device of claim 17 wherein said virtual machine is Java Card™-compliant.

19. A program storage device readable by a machine, embodying a program of instructions executable by the machine to perform program verification, comprising:

providing a first version of a program in memory, said first version of a program including at least one program unit, each program unit comprising an Application Programming Interface (API) definition file and an implementation, each API definition file defining items in its associated program unit that are made accessible to one or more other program units, each implementation including executable code corresponding to said API definition file, said executable code including type specific instructions and data; and

performing a first verification including verifying said program prior to execution of said program, said first verification including

indicating a verification error when a first version of a first program unit implementation is not internally consistent;

performing a second verification including verifying said second version of said first program unit implementation, including

indicating a verification error when said second version of said first program unit implementation is not internally consistent; and

indicating a verification error when said second version of said first program unit implementation is inconsistent with said second version of said first program unit API definition file; and

performing a third verification including verifying said second version of said first program unit implementation is binary compatible with said first version of said fist program unit implementation by comparing said first version of said first program unit API definition file and said second version of said first program unit API definition file;

indicating said second program unit implementation is verified with said second version of said first program unit implementation when said second program unit implementation is verified with said second version of said first program unit API definition file.

Patent Citations (72)

Patent	Date	Inventor	Cited By
US5022028(A)	1991-06-01	Edmonds et al.	Applicant
US5313616(A)	1994-05-01	Cline et al.	Applicant
US5408665(A)	1995-04-01	Fitzgerald	Applicant
US5446901(A)	1995-08-01	Owicki et al.	Applicant
US5490249(A)	1996-02-01	Miller	Applicant
US5565316(A)	1996-10-01	Kershaw et al.	Applicant
US5613101(A)	1997-03-01	Lillich	Applicant
US5615137(A)	1997-03-01	Holzmann et al.	Applicant
US5652835(A)	1997-07-01	Miller	Applicant
US5668999(A)	1997-09-01	Gosling	Applicant
US5701408(A)	1997-12-01	Cornell et al.	Examiner
US5748964(A)	1998-05-01	Gosling	Applicant
US5761510(A)	1998-06-01	Smith, Jr. et al.	Applicant
US5884316(A)	1999-03-01	Bernstein et al.	Applicant
US5925140(A)	1999-07-01	Hudson	Applicant
US5966702(A)	1999-10-01	Fresko et al.	Applicant
US5974255(A)	1999-10-01	Gossain et al.	Applicant
US5999731(A)	1999-12-01	Yellin et al.	Applicant
US6002871(A)	1999-12-01	Duggan et al.	Applicant
US6005942(A)	1999-12-01	Chan et al.	Applicant
US6011918(A)	2000-01-01	Cohen et al.	Applicant
US6038378(A)	2000-03-01	Kita et al.	Applicant
US6052732(A)	2000-04-01	Gosling	Applicant
US6058393(A)	2000-05-01	Meier et al.	Applicant
US6067639(A)	2000-05-01	Rodrigues et al.	Applicant
US6075940(A)	2000-06-01	Gosling	Applicant
US6092147(A)	2000-07-01	Levy et al.	Applicant
US6125442(A)	2000-09-01	Maves et al.	Applicant
US6138112(A)	2000-10-01	Slutz	Applicant
US6178504(B1)	2001-01-01	Fieres et al.	Applicant
US6182158(B1)	2001-01-01	Kougiouris et al.	Applicant
US6202070(B1)	2001-03-01	Nguyen et al.	Applicant
US6205579(B1)	2001-03-01	Southgate	Applicant
US6212633(B1)	2001-04-01	Levy et al.	Applicant
US6230312(B1)	2001-05-01	Hunt	Applicant
US6230314(B1)	2001-05-01	Sweeney et al.	Applicant
US6230318(B1)	2001-05-01	Halstead et al.	Applicant
US6243859(B1)	2001-06-01	Chen-Kuang	Applicant
US6247171(B1)	2001-06-01	Yellin et al.	Applicant
US6262492(B1)	2001-07-01	Sheng	Applicant
US6272674(B1)	2001-08-01	Holiday, Jr.	Applicant
US6347398(B1)	2002-02-01	Parthasarathy et al.	Applicant
US6349344(B1)	2002-02-01	Sauntry et al.	Applicant
US6360334(B1)	2002-03-01	Kavanagh et al.	Applicant
US6370686(B1)	2002-04-01	Delo et al.	Applicant
USRE37722(E)	2002-05-01	Burnard et al.	Applicant
US6389467(B1)	2002-05-01	Eyal	Applicant
US6405309(B1)	2002-06-01	Cheng et al.	Applicant
US6418554(B1)	2002-07-01	Delo et al.	Applicant
US6425118(B1)	2002-07-01	Molloy et al.	Applicant
US6477666(B1)	2002-11-01	Sanchez et al.	Applicant
US6477702(B1)	2002-11-01	Yellin et al.	Applicant
US6519767(B1)	2003-02-01	Carter et al.	Examiner
US6526571(B1)	2003-02-01	Aizikowitz et al.	Applicant
US6539539(B1)	2003-03-01	Larsen et al.	Applicant
US6549930(B1)	2003-04-01	Chrysos et al.	Applicant
US6668289(B2)	2003-12-01	Cheng et al.	Applicant
US2002/0040936(A1)	2002-04-01	Wentker et al.	Applicant
EP292248	1988-05-01		Applicant
EP498130(A2)	1991-12-01		Applicant
EP718761	1995-12-01		Applicant
EP778520(A2)	1996-11-01		Applicant
EP778520	1996-11-01		Applicant
EP685792(A1)	1998-05-01		Applicant
EPWO00/00890	2000-01-01		Applicant
FRWO01/14958	2001-03-01		Applicant
WO98/37526	1998-02-01		Applicant
WO98/19237	1998-05-01		Applicant
WO98/521258	1998-05-01		Applicant
WO98/43212	1998-10-01		Applicant
WO/25278	2000-05-01		Applicant
WO/46666	2000-08-01		Applicant

Non-Patent Literature (26)

Lindsay et al. A generic model for fine grained configuration management including version control and traceability. IEEE. 1997. pp. 27-36.Examiner
Bowles et al. A Comparison of Commercial Reliability Prediction Programs. IEEE. 1990. pp. 450-455.Examiner
Cooper. Persistent Languages Facilitate the Implementation of Software Version Management. IEEE. 1989. pp. 56-65.Examiner
Zhao, Jianjun, “Applying Program Dependence Analysis To Java Software”, Department of Computer Science and Engineering, pp. 1-8.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
International Preliminary Examination Report, PCT/US01/28687, International filing date Sep. 14, 2001, date Search Report mailed Jan. 5, 2004.Applicant
Bergin et al., “Java Resources for Computer Science Instruction”, Report of the ITiCSE'98/ACTC'98 Working Group on Curricular Opportunities of Java Based Software Development, ITiCSE, pp. 14-34 (1998).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”, EEE, pp. 56-65 (1989).Applicant
Ferscha et al., “Java Based Conservative Distributed Simulation”, Proceedings of the 1997 Winter Simulation Conference, pp. 381-388 (1997).Applicant
Foster et al., “A Security Architecture for Computational Grids”, Fifth ACM Conference on Computer & Communications Security, pp. 83-92 (1998).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
Daniels, John et al., “Strategies For Sharing Objects In Distributed Systems”, JOOP, Object Designers Ltd., UK, pp. 27-36.Applicant
Chan, “Infrastructure of Multi-Application Smart Card”, http.//home.hkstar.com/˜alanchan/papers/multiApplicationsSmartCard/, Jul. 25, 2002.Applicant
Chen, Zhiqun, “Java Card™ Technology for Smart Cards”, Sun Microsystems, pp. 11-16, Jun. 2000.Applicant
Ritchey, Tim, “Advanced Topics: The Java Virtual Machine”, Java!, Chapter 14, pp. 25-346, Sep. 22, 1995.Applicant
Sun Microsystems, Inc., “Java Card™ 2.0 Language Subset and Virtual Machine Specification”, Oct. 13, 1997, Revision 1.0 Final.Applicant
Sun Microsystems, Inc., “Java Card™ 2.0 Programming Concepts”, Oct. 15, 1997, Revision 1.0 Final.Applicant
“Sun Delivers On Vision to Bring JAVA Technology to the Consumer and Embedded Market”, Business Wire, Sep. 28, 1999.Applicant
“Sun Microsystems Announces JAVACARD API”, Business Wire, Oct. 1996.Applicant
Sun Microsystems: “Sun's JAVA Technology Leads Open Worldwide Market for Smart Cards”, M2, Presswire, May 1999.Applicant
David Basin “Java Bytecode Verification by Model Checking” System Abstract, pp. 492-495 IT-Research Security (TZ/FE34).Applicant
George E. Necula, et al., “Proof-Carrying Code”, Nov. 1996, pp. 1-60.Applicant
Joachim Posegga, et al., “Byte Code Verification for Java Smart Cards Based on Model Checking”, Sep. 16-18, 1998, pp. 176-190.Applicant

Abstract