Patents by Inventor Sakunthala Harshavardhana

Sakunthala Harshavardhana 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).

  • Patent number: 10956151
    Abstract: An example method for determining a software classification is provided. The example method may include determining a plurality of substream boundaries including a first substream boundary within a representation of a software binary, and segmenting the representation of the software binary into a plurality of substreams. The example method may further include generating a first count string for a first substream based on operational class token counts in a tokenization of the first substream, where the tokenization of the first substream may be based on a mapping of commands within the first substream to operational classes. The example method may further include performing a first count string comparison with a reference database to determine a first count string match, where the first count string comparison being based on the first count string, and classifying the software binary based on the first count string match.
    Type: Grant
    Filed: February 12, 2019
    Date of Patent: March 23, 2021
    Assignee: The Johns Hopkins University
    Inventors: Margaret F. Lospinuso, Sakunthala Harshavardhana, Laura J. Glendenning, Kathleen N. McGill, Robert M. Seng, Tzuhsiu Chiou, Sterling E. Vinson
  • Publication number: 20190250911
    Abstract: An example method for determining a software classification is provided. The example method may include determining a plurality of substream boundaries including a first substream boundary within a representation of a software binary, and segmenting the representation of the software binary into a plurality of substreams. The example method may further include generating a first count string for a first substream based on operational class token counts in a tokenization of the first substream, where the tokenization of the first substream may be based on a mapping of commands within the first substream to operational classes. The example method may further include performing a first count string comparison with a reference database to determine a first count string match, where the first count string comparison being based on the first count string, and classifying the software binary based on the first count string match.
    Type: Application
    Filed: February 12, 2019
    Publication date: August 15, 2019
    Inventors: Margaret F. Lospinuso, Sakunthala Harshavardhana, Laura J. Glendenning, Kathleen N. McGill, Robert M. Seng, Tzuhsiu Chiou, Sterling E. Vinson
  • Patent number: 9003529
    Abstract: An apparatus for identifying related code variants may include processing circuitry configured to execute instructions for receiving query binary code, processing the query binary code to generate one or more query code fingerprints comprising compressed representations of respective functional components of the query binary code, comparing the one or more query code fingerprints to at least some reference code fingerprints stored in a database to determine a similarity measure between the one or more query code fingerprints and at least some of the reference code fingerprints, and preparing at least one report based on the similarity measure.
    Type: Grant
    Filed: March 4, 2013
    Date of Patent: April 7, 2015
    Assignee: The Johns Hopkins University
    Inventors: Margaret F. Lospinuso, David M. Patrone, David P. Silberberg, Jonathan D. Cohen, Ryan W. Gardner, Laura J. Glendenning, Sakunthala Harshavardhana, Robert T. Hider, C. Durward McDonell, III, Dennis S. Patrone, Nathan S. Reller, Benjamin R. Salazar
  • Publication number: 20140068768
    Abstract: An apparatus for identifying related code variants may include processing circuitry configured to execute instructions for receiving query binary code, processing the query binary code to generate one or more query code fingerprints comprising compressed representations of respective functional components of the query binary code, comparing the one or more query code fingerprints to at least some reference code fingerprints stored in a database to determine a similarity measure between the one or more query code fingerprints and at least some of the reference code fingerprints, and preparing at least one report based on the similarity measure.
    Type: Application
    Filed: March 4, 2013
    Publication date: March 6, 2014
    Applicant: THE JOHNS HOPKINS UNIVERSITY
    Inventors: Margaret F. Lospinuso, David M. Patrone, David P. Silberberg, Jonathan D. Cohen, Ryan W. Gardner, Laura J. Glendenning, Sakunthala Harshavardhana, Robert T. Hider, C. Durward McDonell, III, Dennis S. Patrone, Nathan S. Reller, Benjamin R. Salazar