Patents by Inventor Dieter Kasper

Dieter Kasper 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: 20230367569
    Abstract: A decompilation apparatus includes a matcher that divides captured first program code for a processor of a first processor architecture into a sequence of code sections based on a predetermined set of at least partially parameterized code patterns, wherein the first program code implements a program logic and has been generated by compiling a computer program defined in a high-level language by a compiler, and the matcher captures for each code section specific parameter values for each parameter of a corresponding parameterized code pattern and assigns to each code section a terminal symbol of an intermediate language; and a parser that reduces a sequence of terminal symbols assigned to the sequence of code sections to non-terminal symbols of the intermediate language, wherein a totality of the non-terminal symbols generated by the parser by reduction describes the program logic of the computer program in the intermediate language.
    Type: Application
    Filed: July 12, 2023
    Publication date: November 16, 2023
    Inventors: Dieter Kasper, Raimund Mayer
  • Patent number: 11748076
    Abstract: A method of generating a representation of a program logic includes: capturing first program code in a low-level programming language, the program code having been generated by compiling program logic defined in a high-level language; dividing the captured first program code into a sequence of code sections based on a predetermined set of at least partially parameterized code patterns, wherein specific parameter values are captured for each code section and a terminal symbol of an intermediate language is assigned to each code section; assigning the assigned terminal symbols to non-terminal symbols of the intermediate language based on a context-free grammar, wherein a totality of the assigned non-terminal symbols describes the program logic of the first program code in the intermediate language; and generating a representation of the program logic independent of the first processor architecture based on the associated non-terminal symbols of the intermediate language and the detected parameter values.
    Type: Grant
    Filed: February 12, 2020
    Date of Patent: September 5, 2023
    Assignee: Fujitsu Technology Solutions GmbH
    Inventors: Dieter Kasper, Raimund Mayer
  • Publication number: 20220147329
    Abstract: A method of generating a representation of a program logic includes: capturing first program code in a low-level programming language, the program code having been generated by compiling program logic defined in a high-level language; dividing the captured first program code into a sequence of code sections based on a predetermined set of at least partially parameterized code patterns, wherein specific parameter values are captured for each code section and a terminal symbol of an intermediate language is assigned to each code section; assigning the assigned terminal symbols to non-terminal symbols of the intermediate language based on a context-free grammar, wherein a totality of the assigned non-terminal symbols describes the program logic of the first program code in the intermediate language; and generating a representation of the program logic independent of the first processor architecture based on the associated non-terminal symbols of the intermediate language and the detected parameter values.
    Type: Application
    Filed: February 12, 2020
    Publication date: May 12, 2022
    Inventors: Dieter Kasper, Raimund Mayer
  • Patent number: 10055157
    Abstract: A working method for a mass storage system includes providing a virtual file system for at least one user of the mass storage system; determining an access probability for files stored logically in the virtual file system, storing distributed files whose access probability lies above a predetermined limit value in a plurality of first physical mass storage devices which are independent of one another and have read/write units independent of one another and storing combined files whose access probability lies below the predetermined limit value in at least one contiguous storage region of at least one second physical mass storage device.
    Type: Grant
    Filed: August 5, 2013
    Date of Patent: August 21, 2018
    Assignee: FUJITSU LIMITED
    Inventor: Dieter Kasper
  • Publication number: 20150212754
    Abstract: A working method for a mass storage system includes providing a virtual file system for at least one user of the mass storage system; determining an access probability for files stored logically in the virtual file system, storing distributed files whose access probability lies above a predetermined limit value in a plurality of first physical mass storage devices which are independent of one another and have read/write units independent of one another and storing combined files whose access probability lies below the predetermined limit value in at least one contiguous storage region of at least one second physical mass storage device.
    Type: Application
    Filed: August 5, 2013
    Publication date: July 30, 2015
    Applicant: Fujitsu Technology Solutions Intellectual Property GmbH
    Inventor: Dieter Kasper