Patents by Inventor Daniel J. Heidinga

Daniel J. Heidinga has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20130243175
    Abstract: A method for obtaining accurate call path information in a mixed-mode environment where interpreted methods and non-interpreted methods can call one another is disclosed. In one embodiment, such a method includes generating an event and recording it in a buffer when an interpreted method calls an interpreted method. The method also generates an event and records it in the buffer when an interpreted method calls a non-interpreted method. The method further generates an event and records it in the buffer when a non-interpreted method calls an interpreted method. The method refrains from generating an event when a non-interpreted method calls a non-interpreted method. A corresponding apparatus and computer program product are also disclosed.
    Type: Application
    Filed: March 15, 2012
    Publication date: September 19, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Graham A. Chapman, James I. Gartley, Daniel J. Heidinga, Vijay Sundaresan
  • Publication number: 20130139134
    Abstract: An illustrative embodiment for serialization of pre-initialized objects receives a source code definition of a class, identifies a set of constants associated with the class in the source code to form a set of identified constants, creates a result object corresponding to each constant in the set of identified constants, and compiles the source code into a compiled form of the class. The illustrative embodiment further serializes each result object into a resource file associated with the class to form a set of serialized objects and replaces, in the compiled form of the class, each reference to a respective constant associated with the class from the set of identified constants with a corresponding dynamic instruction using a respective serialized object in the set of serialized objects.
    Type: Application
    Filed: August 20, 2012
    Publication date: May 30, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Peter W. Burka, Daniel J. Heidinga, Karl M. Taylor, Olivier P. Thomann
  • Publication number: 20130042235
    Abstract: At least one literal value data structure within a literal pool data structure that is capable of being resolved by run-time initialization within a virtual runtime environment is defined by a processor within a memory storage area. A run-time reference to one of the at least one literal value data structure within the literal pool data structure is detected. A determination is made as to whether a literal value at the one of the at least one literal value data structure is resolved and run-time accessible. The literal value at the one of the at least one literal value data structure within the literal pool data structure is resolved during run-time in response to determining that the literal value is not resolved. The resolved literal value is returned.
    Type: Application
    Filed: August 10, 2011
    Publication date: February 14, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Peter W. Burka, Daniel J. Heidinga, Karl M. Taylor