Abstract: Described is a system and method for the trusted gathering, accounting, recording, tracking, displaying, and transferring of embodied CO2e or greenhouse gas (GHG) associated with a product or service over the cradle to gate life cycle of the product or service, as an assignable certificate. The system provides an interface and architecture for adding environmental attributes such as carbon credits, offsets, and others mitigation instruments to reduce the declared GHG associated with goods and services to create new higher value add goods and services. The system provides a number of interconnected carbon object library modules and interfaces to instantiate, process and store extensible carbon objects that encodes trackable carbon data.

Abstract: Described is a system for trusted gathering, accounting, recording, tracking, and displaying of embodied CO2e or greenhouse (GHG) associated with producing a product or service, over the cradle to gate life cycle of the product or service, as a report or transferrable certificate recorded in a registry. The system provides an interface and architecture for adding environmental attributes such as carbon credits, offsets, and others mitigation instruments to reduce the embodied CO2e or GHG associated with goods and services to create new higher value add goods and services. The system includes a public certificate registry and an interface to a registry system for tracking carbon instrument related data. The carbon platform can include a ledger such as a distributed immutable ledger, or blockchain, configured for tracking, assigning and retiring extensible carbon objects for carbon offsets, the trading platform comprising: an interface tool for transacting for carbon instruments or verified carbon declarations.

Abstract: Described is a system configured to generate extensible carbon objects and public assignable certificates that encode carbon dioxide equivalent (CO2e) emissions data using an extensible Carbon Reporting Markup Language (<CarML>) format. <CarML> can be configured on a flexible application programming interface (API) gateway server between a logical layer and a representational layer, to interface software with the logical layer. <CarML> comprises a core set of common data schema and message types including interface objects, taxonomies, and contexts for describing extensible carbon object message types.

Abstract: A method (and system) includes providing a memory including a plurality of named locations each holding a value and introducing at least one freshener. The at least one freshener chooses one of the plurality of named locations and re-computes its value.

Abstract: A method (and system) includes providing a memory including a plurality of named locations each holding a value and introducing at least one freshener. The at least one freshener chooses one of the plurality of named locations and re-computes its value.

Abstract: A method and apparatus for resource allocation tracking by virtual machine compilers are described. The method may be used to track the allocation of any limited computer resource needed by a program. One embodiment tracks the allocation of temporary registers by a virtual machine compiler. This tracking mode allows easy testing of the compiler for resource allocation errors. In the referenced embodiment, for each possible temporary register usage in a stream of execution, the invention provides a method for a virtual machine compiler to provide an allocation indicator to track the use of temporary registers.

Abstract: A method and apparatus for testing processes in a computer system are described. In a software process, there exist many test points in the execution of the process where stress testing may be applied. The process is executed with stress testing applied at selected test points and test intervals. The selected test points are based on prime numbers and varied for successive execution iterations. An efficient distribution of evaluated test points is achieved, and all possible test points are ultimately evaluated within a small number of execution iterations. In one embodiment, the total number of test points is first determined. A first execution run is evaluated at selected test points that correspond to prime numbers greater than the square root of the total number of test points.

Abstract: A method and apparatus for finding bugs related to garbage collection in a virtual machine. For each possible garbage collection point in a stream of execution, a compiler in the virtual machine provides a map that specifies live pointer locations in the stack. In addition, the map identifies those locations in the stack that contain other forms of live data, such as integers. All other locations are considered “dead,” i.e., no longer in use or never used. At each garbage collection point, “dead” locations in the stack are overwritten with an invalid pointer value. Because of the overwriting process, any bug in the compiler that causes a live pointer to be omitted from the map also causes the omitted pointer to be overwritten with the invalid pointer value.

Abstract: A method and apparatus of translating and executing native code in a virtual machine environment. Debugging of a virtual machine implementation is made easier through binary translation of native code, which permits greater platform independence and greater control over thread management and scheduling, and provides for identification of memory access errors in the native code. When native code is to be executed within a virtual machine environment, the native code is translated into an intermediate form. This intermediate form is processed to determine where memory access and blocking system calls occur. Validity checks are inserted into memory access calls to determine whether the portion of memory to be accessed by each call is within a permitted range. Wild pointers and other resources of memory access errors associated with the native code may thus be identified. Blocking system calls are replaced with non-blocking variants, and “yield” operations may be inserted into system calls and loops.

Abstract: A method and apparatus for finding bugs related to garbage collection in a virtual machine. For each possible garbage collection point in a stream of execution, a compiler in the virtual machine provides a map that specifies live pointer locations in the stack. In addition, the map identifies those locations in the stack that contain other forms of live data, such as integers. All other locations are considered “dead,” i.e., no longer in use or never used. At each garbage collection point, “dead” locations in the stack are overwritten with an invalid pointer value. Because of the overwriting process, any bug in the compiler that causes a live pointer to be omitted from the map also causes the omitted pointer to be overwritten with the invalid pointer value.

Abstract: A system optimizes representation of associations in an object-oriented programming environment. The system includes a memory and a memory manager. The memory stores a table and a plurality of objects. Each of the objects includes a header that stores a flag. The table stores a plurality of entries. Each of the table entries stores an association and a reference identifying one of the objects in the memory. The memory manager periodically determines the state of the flags in the object headers. When the flag of an object is determined to be in a predetermined state, the memory manager selects the table entry having a reference identifying the object and stores the association from the selected table entry into the object.

Abstract: Live pointer information for a stream of bytecodes is precomputed for each bytecode. The precomputed full live pointer information is stored only for bytecodes at predetermined intervals in the stream. Between the bytecodes for which full live pointer information is stored, changes in the live pointer information produced by each bytecode are encoded using a suitable compressive coding and stored. Later, when a program which needs the live pointer information, such as garbage collection, is initiated, the full live pointer information for the nearest bytecode preceding the desired bytecode boundary is retrieved along with the intervening coded changes. The changes are decoded and applied to the retrieved live pointer information to generate the live pointer information at the desired bytecode boundary.

Abstract: The primary purpose of an automatic storage-reclamation system for digital computers is to reclaim the memory occupied by memory objects that are no longer necessary for the correct operation of the computer programs that are clients of the reclamation system. Those objects that are unnecessary in this respect are commonly called garbage objects or, more simply, garbage, and the act of reclaiming such objects is commonly called garbage collection. Frequently, however, some final action or sequence of actions needs to be taken when a memory object becomes a garbage object, beyond simply reclaiming the memory occupied by such objects. An automated finalization mechanism performs such a pre-specified set of actions when it has determined that a memory object has become garbage. A postmortem finalization mechanism performs these finalization actions only after the garbage object has actually been reclaimed by the system's garbage collector.