Patents by Inventor Yanni A. Kouskoulas

Yanni A. Kouskoulas 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).

  • Method and apparatus for automated vulnerability detection
    Patent number: 9507945
    Abstract: A method executable via operation of configured processing circuitry to identify vulnerabilities in program code may include receiving a program and employing a disassembler to disassemble the program, generating a function call tree for the program based on disassembly of the program, receiving an indication of a post condition for which analysis of the program is desired, transforming program statements into logical equations, simplifying the logical equations, propagating post conditions backwards via Dijkstra's weakest precondition variant, analyzing aliases and processing loops to generate a precondition, and using an automated solver to determine whether the precondition is realizable and, if so, providing program inputs required to realize the precondition.
    Type: Grant
    Filed: April 1, 2014
    Date of Patent: November 29, 2016
    Assignee: The Johns Hopkins University
    Inventors: Yanni A. Kouskoulas, Douglas C. Schmidt, C. Durward McDonell, III, Laura J. Glendenning, Ryan W. Gardner, David J. Heine, Margaret F. Lospinuso, Forest C. Deal, Jr., David R. Zaret, Vina H. Nguyen
  • Method and Apparatus for Automated Vulnerability Detection
    Publication number: 20140298472
    Abstract: A method executable via operation of configured processing circuitry to identify vulnerabilities in program code may include receiving a program and employing a disassembler to disassemble the program, generating a function call tree for the program based on disassembly of the program, receiving an indication of a post condition for which analysis of the program is desired, transforming program statements into logical equations, simplifying the logical equations, propagating post conditions backwards via Dijkstra's weakest precondition variant, analyzing aliases and processing loops to generate a precondition, and using an automated solver to determine whether the precondition is realizable and, if so, providing program inputs required to realize the precondition.
    Type: Application
    Filed: April 1, 2014
    Publication date: October 2, 2014
    Inventors: Yanni A. Kouskoulas, C. Durward McDonell, III, Laura J. Glendenning, Ryan W. Gardner, David J. Heine, Margaret F. Lospinuso