Invention Grant
US08381199B2 Modular and/or demand-driven string analysis of a computer program
失效
计算机程序的模块化和/或需求驱动的字符串分析
- Patent Title: Modular and/or demand-driven string analysis of a computer program
- Patent Title (中): 计算机程序的模块化和/或需求驱动的字符串分析
-
Application No.: US12907974Application Date: 2010-10-19
-
Publication No.: US08381199B2Publication Date: 2013-02-19
- Inventor: Takaaki Tateishi , Omer Tripp , Marco Pistoia
- Applicant: Takaaki Tateishi , Omer Tripp , Marco Pistoia
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agent Vazken Alexanian
- Main IPC: G06F9/44
- IPC: G06F9/44 ; G06F9/45

Abstract:
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.
Public/Granted literature
- US20120096440A1 Modular and/or demand-driven string analysis of a computer program Public/Granted day:2012-04-19
Information query