发明申请
US20120096440A1 Modular and/or demand-driven string analysis of a computer program
失效
计算机程序的模块化和/或需求驱动的字符串分析
- 专利标题: Modular and/or demand-driven string analysis of a computer program
- 专利标题(中): 计算机程序的模块化和/或需求驱动的字符串分析
-
申请号: US12907974申请日: 2010-10-19
-
公开(公告)号: US20120096440A1公开(公告)日: 2012-04-19
- 发明人: Takaaki Tateishi , Omer Tripp , Marco Pistoia
- 申请人: Takaaki Tateishi , Omer Tripp , Marco Pistoia
- 主分类号: G06F9/44
- IPC分类号: G06F9/44 ; G06F9/45
摘要:
Modular and/or demand-driven string analysis of a computer program is performed. Each method of the program is encoded into monadic second-order logic (M2L) to yield a set of predicate declarations and a set of constraints. The two sets for each method are composed to yield a union set of predicate declarations and a union set of constraints for the program. The union set of constraints includes a particular set of constraints corresponding to call relationships among the methods. An M2L formula including a free variable corresponding to a program variable is added to the union set of constraints. The two union sets are processed to verify a satisfiability of the constraints in relation to an illegal pattern. Where the constraints are satisfiable, the program can generate a string containing the illegal pattern. Where the constraints are not satisfiable, the program never generates a string containing the illegal pattern.
公开/授权文献
信息查询