首页> 外国专利> System and method for matching a plurality of ordered sequences with applications to call stack analysis to identify known software problems

System and method for matching a plurality of ordered sequences with applications to call stack analysis to identify known software problems

机译:用于将多个有序序列与应用程序进行匹配以调用堆栈分析以识别已知软件问题的系统和方法

摘要

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.
机译:本发明以例如序列的有序序列找到匹配。来自异常软件程序执行的程序函数调用堆栈,用于发现相关或相同的软件缺陷以及可能的已知解决方案。删除递归和无信息的子模式(例如常见错误处理例程的名称,以查看它们是否是由于相同的已知问题而生成的。从搜索中删除在统计上不太可能匹配的序列。在序列中较早发现的匹配可以被不同地加权,例如。在呼叫堆栈中比其他匹配更重要。对序列进行索引,以便自动识别与查询相关的序列,而无需详细的详尽搜索。通过基于加权序列相似性优化成本函数来找到最大匹配项。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号