Abstract: The classification of data stored on a storage medium is dynamically modified without the data being relocated to another storage medium. Data stored on a plurality of storage mediums is classified independent of the physical location at which the data resides. Rather than moving data to storage media that possess different classifications, the data itself receives a classification apart from the storage medium. Data which is considered high priority would be afforded maximum use of the storage medium resources and bandwidth availability. Data that is of lower interest is classified with a lower classification resulting in differing levels of resources authorized to access that data. Throughout this reclassification process the data remains resident on the same storage medium.

Abstract: In a response based messaging system in which the reliability of the message transmission is supplemented by storing at both the source and destination a copy of the message, storage space is bounded. By including in the response to a message acknowledgement from the destination that the message has been received, the copy of the message stored at the source can be deleted. Furthermore, by including in the message an identifier of what message acknowledgement the source is expecting, the destination can delete from its storage medium any previously stored messages.

Abstract: A modularized computing system includes a plurality of modular components that are coupled together forming a network. Each modular component includes a standard network interface. The system further includes an initialization module, a monitor module, a storage medium, and a management module. As a module unit is coupled to the network, the initialization module automatically configures the component to an operable state. The monitor module monitors network operations including performance parameters of each modular component based on a plurality of system policies. Based on information gathered by the monitor module, the management module actively modifies network structure and resource allocation to optimize network performance.

Abstract: One or more fingerprints may be utilized in each class in order to allow for faster subtype checking. A subclass fingerprint may be utilized to track the superclasses of a class, and an interface fingerprint may be utilized to track the locally declared interfaces of the class and any interfaces which it inherits. This allows for subtype checking that is extremely fast and efficient by utilizing comparison and other logical operations during the checking.

Abstract: A card device for communication with an electronic device comprises a memory for storing a capabilities list associated with an application program. The capabilities list comprises information regarding access to one or more resources for use by the application program. The memory is also for storing the application program and a security manager. The card device comprises a processing unit for executing the application program and the security manager, for selectively granting access to the one or more resources for use by the application program based at least in part on the capabilities list.

Abstract: A distributed make command is used when compiling a computer program in order to allow non-dependent processes in the compiling be performed in parallel, such as with different resources, in order to speed compile time. The distributed make command is typically executed by a user who also specifies a maximum number of resources to allocate to the compiling. The present invention dynamically adjusts this maximum number of resources to allocate if the resources become overloaded during the compiling, which has the effect of optimizing the efficiency of the compiling, either by reducing the number of resources utilized or by reducing the amount of time the compiling takes (or both).

Abstract: A method for automating web access captures web requests submitted by a user on a client to a web server. The web requests are filtered and stored on the web server. The filtered web requests are recorded in a log file on the web server. The log file is sent to the client. The client submits the filtered web requests from the log file to the web server. The web responses in response to the submitted filtered web requests are received and stored on the client as a reference file.

Abstract: A method for automating web applications on a web server uses a script file. The script file is generated on a proxy server. Web requests from a web browser to a web server and web responses in response to the web requests are intercepted and recorded onto a script file maintained on the proxy server. Web requests are submitted to the web server based on the script file. The script file may also be formatted pursuant to a specified data structure.

Abstract: Committing data loaded on a device includes computing a program unit storage commitment fingerprint over a program unit if the program unit is finally loaded in a non-volatile memory on the device, associating the program unit storage commitment fingerprint with the program unit and storing the program unit storage commitment fingerprint.

Abstract: A method of operating a computer system includes providing a program in memory, verifying the program prior to an installation of the program and generating a program fault signal when the verification fails. The program includes at least one program unit, and 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. Verification includes determining whether a first program unit implementation is internally consistent, determining whether the first program unit implementation is consistent with a first program unit API definition file associated with the first program unit implementation and generating a program fault signal when the verifying fails.

Abstract: A hierarchical multi-level logical architecture for a test suite may be provided along with a harness that supports such architecture. At each level in the hierarchy, instructions at the level may be run. A subset of test cases corresponding to the test case currently being examined may then be obtained (which may have been passed by a parent). Then a loop may be entered wherein for each test case in the list of test cases, the test case is executed and the result put into a special data structure, which may then be labeled and returned to the parent. This iterative process allows for multi-level test cases without suffering the drawbacks of the prior art.

Abstract: A system for communicating program data between devices includes a first device configured to disassemble a program file comprising program data into at least one logical data unit, partition each logical data unit into at least one protocol data unit and compute a first fingerprint over the payload portion of the protocol data units. The first device is also configured to send the protocol data units and at least one member of the group comprising the first fingerprint and a first authentication code based on the first fingerprint to a second device. The second device is configured to compute a second fingerprint over the payload portion of the protocol data units and to commit the program to a memory based on whether the at least one member matches the second fingerprint or a second authentication code based on the second fingerprint.

Abstract: A method generates and verifies a design-for-test (DFT) library for an automatic test pattern generator (ATPG) tool. The method includes (a) creating a synthesis library including primitives to be used to create the modules, the primitives being the same as primitives used by the ATPG tool, (b) creating a register transfer level (RTL) description for each module, (c) performing synthesis using the synthesis library and the RTL description to create a gate level description for each module, and (d) generating the DFT library by converting a hardware description language (HDL) of the gate level description into a script language for the ATPG tool to create a DFT file for each module. The method may further include (e) converting the DFT files into a RTL description to create a pseudo-RTL description for each module, and (f) comparing the RTL description and the pseudo-RTL description for verification of the DFT library.

Abstract: Optimized loading of program data on a device comprises receiving a program including multiple program units, at least one of which is a main program unit. A use graph of the program is obtained, where the root node of the use graph represents the joining of the root node to one or more nodes representing the at least one main program unit. The multiple program units are ordered based at least in part on a depth-first traversal of the use graph and the ordered program is communicated to the device.

Abstract: A method for program verification comprises receiving a program unit, determining data types used by the program unit, creating a first mapping for the data types and using the first mapping to represent type information in verification information for the program unit. The verification information comprises the data type of entries on an operand stack or in a register file during simulated execution of the program unit.

Abstract: Communicating program data between a first device and a second device comprises disassembling a first program file comprising program data into at least one logical data unit, partitioning each of the at least one logical data unit into at least one protocol data unit and computing a first fingerprint over the payload portion of the at least one protocol data unit of the at least one logical data unit. The format of the at least one protocol data unit is defined by a communication protocol and includes a payload portion.

Abstract: Verification of a software program may be automated by receiving a program source file comprising program source code and at least one formal specification annotation, extracting the at least one formal specification annotation from the program source file, compiling the program source code and linking the compiled program and the at least one extracted formal specification annotation to create an executable program that includes at least one reference to an executable formal specification module. According to one aspect, a virtual machine includes a target virtual machine for executing one or more program implementation instructions, and a formal virtual machine for executing one or more formal specification modules corresponding to one or more program implementation instructions and configured to call a formal specification module, and to compare a first result obtained by executing the program implementation instructions with a second result obtained by the call to the formal specification module.

Abstract: A method generates a test pattern for an integrated circuit (IC) design using a functional verification program. The functional verification program includes a stimulus generator, an expected-response generator, and an interface defining ports of the IC design. The method includes (a) converting input ports in the interface into bi-directional in/out ports, (b) supplying stimuli to the converted in/out ports and original in/out ports in the interface by executing the stimulus generator, (c) sampling the stimuli supplied to the converted in/out ports and the original in/out ports, and (d) recording the sampled stimuli. The method may further include (e) creating bi-directional shadow ports in the interface, the shadow ports corresponding to the in/out ports and output ports of the IC design, (f) supplying expected responses to the shadow ports by executing the expected-response generator, (g) sampling the expected responses from the shadow ports, and (h) recording the sampled expected response.

Abstract: Access to digital content may be controlled by determining digital content to be made accessible via a rights locker describing a user's access rights for digital content associated with the rights locker, determining enrollment authentication data, and sending a rights locker enrollment request to a rights locker provider, where the rights locker enrollment request comprises a digital content request and the enrollment authentication data. An authenticated rights locker access request is received in response to the sending, where the authenticated rights locker access request is for subsequent use in accessing digital content associated with the rights locker.

Abstract: A stream-based cipher may be used to bitstream a data file into multiple files. Each file is incomplete and therefore unreadable without knowing the other files that must be used to reconstruct the original file. A central registry may be maintained which indicates which files are together. Files may be reconstructed by brute force computing once all the files are retrieved, eliminating the need for any indication of how to reassemble the files to be transmitted. By using such a system, authorities (either governmental or corporate) are prevented from casually examining a file for content or even for file format. The files will simply appear as random data.