The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Nov. 23, 2010
Filed:
Jun. 02, 2006
Rajeev Gupta, New Delhi, IN;
Guy Maring Lohman, San Jose, CA (US);
Tanveer Fathima Mahmood, Cupertino, CA (US);
Laurent Sebastien Mignet, New Delhi, IN;
Natwar Modani, New Delhi, IN;
Mark Francis Wilding, Barrie, CA;
Rajeev Gupta, New Delhi, IN;
Guy Maring Lohman, San Jose, CA (US);
Tanveer Fathima Mahmood, Cupertino, CA (US);
Laurent Sebastien Mignet, New Delhi, IN;
Natwar Modani, New Delhi, IN;
Mark Francis Wilding, Barrie, CA;
International Business Machines Corporation, Armonk, NY (US);
Abstract
The invention finds matches in ordered sequences, e.g. program function call stacks from anomalous software program executions for discovering related or identical software flaws and possible known solutions. Call stacks are matched after removing recursive and uninformative subpatterns, e.g. names of common error handling routines, to see if they were generated due to the same possibly known problem. Sequences statistically unlikely to be matches are pruned from the search. Matches found earlier in the sequences may be weighted differently, e.g. to be more important in call stacks, than other matches. Sequences are indexed so that those relevant to a query are identified automatically without detailed exhaustive search. Maximum matches are found by optimizing a cost function based on weighted sequence similarity.