Abstract: A computer-implemented method for bytecode class verification includes: encountering a class requiring verification of its bytecode during a run of an application; determining whether class relationship data for the class exists in a shared classes cache; in response to a determination that the class relationship data for the class does not exist in the shared classes cache: performing a linear bytecode walk of the bytecode to identify relationship data for the class and verify that the bytecode is well-formed; and storing the identified relationship data as the class relationship data for the class in the shared classes cache; in response to a determination that the class relationship data for the class does exist in the shared classes cache: retrieving the class relationship data for the class from the shared classes cache; and processing the class relationship data.

Abstract: A computer-implemented method for bytecode class verification includes: encountering a class requiring verification of its bytecode during a run of an application; determining whether class relationship data for the class exists in a shared classes cache; in response to a determination that the class relationship data for the class does not exist in the shared classes cache: performing a linear bytecode walk of the bytecode to identify relationship data for the class and verify that the bytecode is well-formed; and storing the identified relationship data as the class relationship data for the class in the shared classes cache; in response to a determination that the class relationship data for the class does exist in the shared classes cache: retrieving the class relationship data for the class from the shared classes cache; and processing the class relationship data.

Abstract: A computer-implemented method for bytecode class verification includes: encountering a class requiring verification of its bytecode during a run of an application; determining whether class relationship data for the class exists in a shared classes cache; in response to a determination that the class relationship data for the class does not exist in the shared classes cache: performing a linear bytecode walk of the bytecode to identify relationship data for the class and verify that the bytecode is well-formed; and storing the identified relationship data as the class relationship data for the class in the shared classes cache; in response to a determination that the class relationship data for the class does exist in the shared classes cache: retrieving the class relationship data for the class from the shared classes cache; and processing the class relationship data.

Abstract: A degradable polymer composition comprising: (a) a polyolefin; (b) two or more transition metal compounds in a total amount of from 0.15 to 0.6 wt %, (c) a mono- or poly-unsaturated C14-C24 carboxylic acid, or an ester, anhydride or amide thereof, in an amount of from 0.04 to 0.08 wt %; (d) a synthetic rubber in an amount of from 0.04 to 0.2 wt %; and, optionally: (e) dry starch in an amount of from 0 to 20 wt %; and/or (f) calcium oxide in an amount of from 0 to 1 wt %; and/or (g) a phenolic antioxidant stabilizer in an amount of from 0 to 0.2 wt %; wherein the two or more transition metal compounds are selected from iron, manganese, copper, cobalt and cerium compounds and wherein the transition metals in the two or more transition metal compounds are different.

Abstract: A method of maintaining correctness of pointers from a managed heap to off-heap memory includes storing in a cache a first heap object in a managed heap that holds at least one off-heap pointer pointing to a first off-heap data structure and creating a weak reference node linked to the first heap object such that the first heap object is not kept alive by the weak reference node during garbage collection. Further disclosed are systems for maintaining correctness of pointers from a managed heap to off-heap memory.

Abstract: A computer-implemented method for bytecode class verification includes: encountering a class requiring verification of its bytecode during a run of an application; determining whether class relationship data for the class exists in a shared classes cache; in response to a determination that the class relationship data for the class does not exist in the shared classes cache: performing a linear bytecode walk of the bytecode to identify relationship data for the class and verify that the bytecode is well-formed; and storing the identified relationship data as the class relationship data for the class in the shared classes cache; in response to a determination that the class relationship data for the class does exist in the shared classes cache: retrieving the class relationship data for the class from the shared classes cache; and processing the class relationship data.

Abstract: Aspects of the present invention provide devices that count for an application thread levels of critical sections of program code, and in response to a program exception in the application thread that is deferrable and a non-zero count of the levels of critical sections, execute a remainder of program code within the critical sections of program code.

Abstract: Aspects of the present invention provide devices that count for an application thread levels of critical sections of program code, and in response to a program exception in the application thread that is deferrable and a non-zero count of the levels of critical sections, execute a remainder of program code within the critical sections of program code.

Abstract: A method of maintaining correctness of pointers from a managed heap to off-heap memory includes storing in a cache a first heap object in a managed heap that holds at least one off-heap pointer pointing to a first off-heap data structure and creating a weak reference node linked to the first heap object such that the first heap object is not kept alive by the weak reference node during garbage collection. Further disclosed are systems for maintaining correctness of pointers from a managed heap to off-heap memory.

Abstract: A sheet material formed of a degradeable composition comprising 30 to 80 wt % calcium carbonate, an additive, and the balance a polymer selected from polyethylene, polypropylene and copolymers and blends thereof. The additive comprises (a) two or more transition metal compounds, (b) a mono- or poly-unsaturated C14-C24 carboxylic acid, or an ester, anhydride or amide thereof, (c) a synthetic rubber. The addition optionally comprises (d) dry starch, and/or (e) calcium oxide, and/or (f) a phenolic antioxidant stabilizer. The two or more transition metal compounds are selected from iron, manganese, copper, zinc, titanium, cobalt and cerium compounds and the transition metals in the two or more transition metal compounds are different.

Abstract: A sheet material formed of a degradeable composition comprising 30 to 80 wt % calcium carbonate, an additive, and the balance a polymer selected from polyethylene, polypropylene and copolymers and blends thereof. The additive comprises (a) two or more transition metal compounds, (b) a mono- or poly-unsaturated C14-C24 carboxylic acid, or an ester, anhydride or amide thereof, (c) a synthetic rubber. The addition optionally comprises (d) dry starch, and/or (e) calcium oxide, and/or (f) a phenolic antioxidant stabilizer. The two or more transition metal compounds are selected from iron, manganese, copper, zinc, titanium, cobalt and cerium compounds and the transition metals in the two or more transition metal compounds are different.

Abstract: A degradable polymer composition comprising: (a) a polyolefin; (b) two or more transition metal compounds in a total amount of from 0.15 to 0.6 wt %, (c) a mono- or poly-unsaturated C14-C24 carboxylic acid, or an ester, anhydride or amide thereof, in an amount of from 0.04 to 0.08 wt %; (d) a synthetic rubber in an amount of from 0.04 to 0.2 wt %; and, optionally: (e) dry starch in an amount of from 0 to 20 wt %; and/or (f) calcium oxide in an amount of from 0 to 1 wt %; and/or (g) a phenolic antioxidant stabilizer in an amount of from 0 to 0.2 wt %; wherein the two or more transition metal compounds are selected from iron, manganese, copper, cobalt and cerium compounds and wherein the transition metals in the two or more transition metal compounds are different.

Abstract: In an approach for removing tenant initialization check per tenant for compiled code, a processor receives a request to create a tenant. A processor creates the tenant. A processor marks a current thread of the tenant as not eligible to run just-in-time (JIT) code, wherein the marking indicates that when a method is invoked, a non-JIT version of the method is executed. A processor executes initialization of a first class from an optimization list, wherein the optimization list is a configurable list of classes to be initialized prior to running JIT code. A processor determines that class initialization has been executed for all classes on the optimization list. A processor adjusts the marking to indicate that the current thread is eligible to run JIT code and that the tenant may run JIT code that assumes, without checking, that classes on the optimization list are initialized.

Abstract: Embodiments of the present invention disclose a method, system, and computer program product for a JNI object access system. A computer receives a JNI reference and obtains the pointer data and call site of the referenced object. The computer determines whether a record of the object and call site exist and, if not, the respective records are created. The computer applies a heuristic analysis of the object and call site in which it determines whether the object is larger than a threshold size, whether the object is part of a particular region of the heap, whether the call site is associated with a read-only or a read-write function, and whether the object or call site has caused more non-moving garbage collections than a threshold number. Based on the heuristic, the computer either copies the object data or pins the object and any non-moving garbage collections are recorded.

Abstract: In an approach for removing tenant initialization check per tenant for compiled code, a processor receives a request to create a tenant. A processor creates the tenant. A processor marks a current thread of the tenant as not eligible to run just-in-time (JIT) code, wherein the marking indicates that when a method is invoked, a non-JIT version of the method is executed. A processor executes initialization of a first class from an optimization list, wherein the optimization list is a configurable list of classes to be initialized prior to running JIT code. A processor determines that class initialization has been executed for all classes on the optimization list. A processor adjusts the marking to indicate that the current thread is eligible to run JIT code and that the tenant may run JIT code that assumes, without checking, that classes on the optimization list are initialized.

Abstract: Embodiments of the present invention disclose a method, system, and computer program product for a JNI object access system. A computer receives a JNI reference and obtains the pointer data and call site of the referenced object. The computer determines whether a record of the object and call site exist and, if not, the respective records are created. The computer applies a heuristic analysis of the object and call site in which it determines whether the object is larger than a threshold size, whether the object is part of a particular region of the heap, whether the call site is associated with a read-only or a read-write function, and whether the object or call site has caused more non-moving garbage collections than a threshold number. Based on the heuristic, the computer either copies the object data or pins the object and any non-moving garbage collections are recorded.

Abstract: In an approach for removing tenant initialization check per tenant for compiled code, a processor receives a request to create a tenant. A processor creates the tenant. A processor marks a current thread of the tenant as not eligible to run just-in-time (JIT) code, wherein the marking indicates that when a method is invoked, a non-JIT version of the method is executed. A processor executes initialization of a first class from an optimization list, wherein the optimization list is a configurable list of classes to be initialized prior to running JIT code. A processor determines that class initialization has been executed for all classes on the optimization list. A processor adjusts the marking to indicate that the current thread is eligible to run JIT code and that the tenant may run JIT code that assumes, without checking, that classes on the optimization list are initialized.

Abstract: In an approach for removing tenant initialization check per tenant for compiled code, a processor receives a request to create a tenant. A processor creates the tenant. A processor marks a current thread of the tenant as not eligible to run just-in-time (JIT) code, wherein the marking indicates that when a method is invoked, a non-JIT version of the method is executed. A processor executes initialization of a first class from an optimization list, wherein the optimization list is a configurable list of classes to be initialized prior to running JIT code. A processor determines that class initialization has been executed for all classes on the optimization list. A processor adjusts the marking to indicate that the current thread is eligible to run JIT code and that the tenant may run JIT code that assumes, without checking, that classes on the optimization list are initialized.