专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07650595B2 Sound transaction-based reduction without cycle detection 有权
标题翻译：基于声音的基于事务的减少，无周期检测
公开(公告)号：US07650595B2
公开(公告)日：2010-01-19
申请号：US11119530
申请日：2005-04-29
申请人： Shaz Qadeer , Sriram K. Rajamani , Vladimir A. Levin , Robert Palmer
发明人： Shaz Qadeer , Sriram K. Rajamani , Vladimir A. Levin , Robert Palmer
IPC分类号： G06F9/44
CPC分类号： G06F8/433 , G06F8/456 , G06F11/3608
摘要： Described techniques and tools help model checking scale to large programs while reducing missed errors. In particular, described techniques and tools help reduce the state space of concurrent programs without depending on cycle detection and without scheduling execution of postponed threads at all cycles. For example, described techniques and tools use a type of partial-order reduction called transaction-based reduction to reduce program state space. Analysis is performed at commit points to determine whether to schedule delayed threads.
摘要翻译：描述的技术和工具可帮助模型检查大型程序的规模，同时减少错误的错误。特别地，所描述的技术和工具有助于减少并发程序的状态空间，而不依赖于周期检测，并且在所有周期内不执行延迟的线程。例如，所描述的技术和工具使用一种称为基于事务的减少的部分顺序减少来减少程序状态空间。分析在提交点执行，以确定是否计划延迟的线程。

2. 发明申请

US20100275186A1 SEGMENTATION FOR STATIC ANALYSIS 审中-公开
标题翻译：静态分析分段
公开(公告)号：US20100275186A1
公开(公告)日：2010-10-28
申请号：US12431187
申请日：2009-04-28
申请人： Conal McGarvey , Vladimir A. Levin , Jakob F. Lichtenberg
发明人： Conal McGarvey , Vladimir A. Levin , Jakob F. Lichtenberg
IPC分类号： G06F9/44
CPC分类号： G06F11/3604 , G06F9/44589
摘要： Various embodiments provide techniques to segment program code that may be the subject of static analysis. In one or more embodiments, an algorithm is applied to an abstract representation of the program code to derive segments for the program code. In at least some embodiments, multiple segments can be derived based at least in part upon of one or more “boxed” portions of the program code that are designated to remain intact within the segments. Each segment can then be subjected individually to static analysis to verify compliance with one or more prescribed behaviors. Verification results can be output for each individual segment and the individual results can be combined to obtain results for the program code overall.
摘要翻译：各种实施例提供了分割可能是静态分析主题的程序代码的技术。在一个或多个实施例中，将算法应用于程序代码的抽象表示以导出程序代码的段。在至少一些实施例中，可以至少部分地基于指定为在段内保持完整的程序代码的一个或多个“盒装”部分来导出多个段。然后可以将每个片段单独进行静态分析，以验证是否符合一个或多个规定的行为。可以为每个单独的段输出验证结果，并且可以组合各个结果以获得整个程序代码的结果。

3. 发明授权

US08595707B2 Processing predicates including pointer information 有权
标题翻译：处理谓词包括指针信息
公开(公告)号：US08595707B2
公开(公告)日：2013-11-26
申请号：US12649335
申请日：2009-12-30
申请人： Eleonora O. Bounimova , Vladimir A. Levin , Leonardo M. de Moura , Thomas J. Ball
发明人： Eleonora O. Bounimova , Vladimir A. Levin , Leonardo M. de Moura , Thomas J. Ball
IPC分类号： G06F17/24
CPC分类号： G06F8/313 , G06F8/434 , G06F11/3608
摘要： A system is described for processing predicates in the course of analyzing a program, based on a general-purpose theory of pointers. The system converts location expressions in the predicates into logical formulae that are interpretable by a theorem prover module, producing converted predicates. This conversion associates the location expressions with location objects. More specifically, the conversion represents variables as explicitly-specified location objects, and location terms (such as a field-type access terms and dereference-type terms) as constructor-specified location objects. The theory of pointers is also expressed by a set of axioms which constrain the operation of the theorem prover module.
摘要翻译：描述了一种基于指针的通用理论在分析程序过程中处理谓词的系统。系统将谓词中的位置表达式转换为可由定理证明器模块解释的逻辑公式，从而产生转换的谓词。此转换将位置表达式与位置对象相关联。更具体地说，转换表示作为显式指定的位置对象的变量，以及作为构造器指定的位置对象的位置术语（诸如字段类型访问术语和解引用类型术语）。指针理论也由限定定理证明器模块操作的一组公理表示。

4. 发明授权

US08074205B2 Binary verification service 有权
标题翻译：二进制验证服务
公开(公告)号：US08074205B2
公开(公告)日：2011-12-06
申请号：US11736935
申请日：2007-04-18
申请人： Shankara M. C. Shastry , Perraju Bendapudi , Narayanan Ganapathy , Vladimir A. Levin
发明人： Shankara M. C. Shastry , Perraju Bendapudi , Narayanan Ganapathy , Vladimir A. Levin
IPC分类号： G06F9/44
CPC分类号： G06F21/577 , G06F21/51
摘要： A binary is received at a binary verification service from a binary verification client agent. The binary verification service performs binary verification of the binary, wherein binary verification includes determining whether the binary is complicit with a set of usage rules. The binary verification service sends a binary verification result to the binary verification client agent.
摘要翻译：二进制验证服务从二进制验证客户端代理接收二进制文件。二进制验证服务对二进制进行二进制验证，其中二进制验证包括确定二进制是否与一组使用规则相同。二进制验证服务将二进制验证结果发送给二进制验证客户端代理。

5. 发明申请

US20090319997A1 PRECONDITION RULES FOR STATIC VERIFICATION OF CODE 审中-公开
标题翻译：用于静态验证代码的预编规则
公开(公告)号：US20090319997A1
公开(公告)日：2009-12-24
申请号：US12142775
申请日：2008-06-20
申请人： Jakob Frederik Lichtenberg , Conal McGarvey , Eleonora O. Bounimova , Vladimir A. Levin
发明人： Jakob Frederik Lichtenberg , Conal McGarvey , Eleonora O. Bounimova , Vladimir A. Levin
IPC分类号： G06F9/44
CPC分类号： G06F11/3636
摘要： A verification engine for verifying compliance of a module of computer-executable instructions to various specifications or guidelines can utilize precondition rules to obtain information about the module so as to select appropriate rules with which the module will be verified. The precondition rules can inform an evaluation tool, which can obtain the specified information about the module. A preprocessor can then evaluate conditional statements and select one or more rules or environment modules based on the results of the evaluation of the precondition rules. Multiple levels of dependent precondition rules can be evaluated with a drill-down approach, where each dependency chain is evaluated until a terminal level, or with a layered approach, where all terminal level precondition rules are evaluated followed by precondition rules of increasingly higher levels.
摘要翻译：用于验证计算机可执行指令的模块对各种规范或指南的符合性的验证引擎可以利用前提条件来获得关于模块的信息，以便选择将被验证模块的适当规则。前提条件可以通知评估工具，可以获取有关模块的指定信息。然后，预处理器可以基于前提条件规则的评估结果来评估条件语句并选择一个或多个规则或环境模块。依赖前提条件的多个级别可以通过深入法进行评估，其中每个依赖关系链被评估直到终端级别或分层方法，其中所有终端级前提条件被评估，之后是越来越高级别的前提条件。

6. 发明授权

US08402444B2 Program analysis through predicate abstraction and refinement 有权
标题翻译：通过谓词抽象和细化进行程序分析
公开(公告)号：US08402444B2
公开(公告)日：2013-03-19
申请号：US12576253
申请日：2009-10-09
申请人： Thomas J. Ball , Eleonora O. Bounimova , Vladimir A. Levin , Rahul Kumar
发明人： Thomas J. Ball , Eleonora O. Bounimova , Vladimir A. Levin , Rahul Kumar
IPC分类号： G06F9/44
CPC分类号： G06F8/43
摘要： An analysis engine is described for performing static analysis using CEGAR loop functionality, using a combination of forward and backward validation-phase trace analyses. The analysis engine includes a number of features. For example: (1) the analysis engine can operate on blocks of program statements of different adjustable sizes; (2) the analysis engine can identify a subtrace of the trace and perform analysis on that subtrace (rather than the full trace); (3) the analysis engine can form a pyramid of state conditions and extract predicates based on the pyramid and/or from auxiliary source(s); (4) the analysis engine can generate predicates using an increasingly-aggressive series of available discovery techniques; (5) the analysis engine can selectively concretize procedure calls associated with the trace on an as-needed basis and perform other refinements; and (6) the analysis engine can add additional verification targets in the course of its analysis, etc.
摘要翻译：描述了使用CEGAR环路功能执行静态分析的分析引擎，使用正向和反向验证相位跟踪分析的组合。分析引擎包括许多功能。例如：（1）分析引擎可以对不同可调整大小的程序语句块进行操作; （2）分析引擎可以识别跟踪的子跟踪，并对该子跟踪执行分析（而不是完整跟踪）; （3）分析引擎可以形成状态条件的金字塔，并且基于金字塔和/或辅助来源提取谓词; （4）分析引擎可以使用越来越多的可用发现技术来生成谓词; （5）分析引擎可以根据需要选择性地实现与跟踪关联的过程调用，并执行其他改进; 和（6）分析引擎可以在其分析过程中添加额外的验证目标等。

7. 发明申请

US20080258865A1 BINARY VERIFICATION SERVICE 有权
标题翻译：二进制验证服务
公开(公告)号：US20080258865A1
公开(公告)日：2008-10-23
申请号：US11736935
申请日：2007-04-18
申请人： Shankara M. C. Shastry , Perraju Bendapudi , Narayanan Ganapathy , Vladimir A. Levin
发明人： Shankara M. C. Shastry , Perraju Bendapudi , Narayanan Ganapathy , Vladimir A. Levin
IPC分类号： G06F7/08
CPC分类号： G06F21/577 , G06F21/51
摘要： A binary is received at a binary verification service from a binary verification client agent. The binary verification service performs binary verification of the binary, wherein binary verification includes determining whether the binary is complicit with a set of usage rules. The binary verification service sends a binary verification result to the binary verification client agent.
摘要翻译：二进制验证服务从二进制验证客户端代理接收二进制文件。二进制验证服务对二进制进行二进制验证，其中二进制验证包括确定二进制是否与一组使用规则相同。二进制验证服务将二进制验证结果发送给二进制验证客户端代理。

8. 发明授权

US08826238B2 Per group verification 有权
标题翻译：每组验证
公开(公告)号：US08826238B2
公开(公告)日：2014-09-02
申请号：US12357583
申请日：2009-01-22
申请人： Adam Shapiro , Conal McGarvey , Vladimir A. Levin , Jakob F. Lichtenberg
发明人： Adam Shapiro , Conal McGarvey , Vladimir A. Levin , Jakob F. Lichtenberg
IPC分类号： G06F9/44 , G06F9/445 , G06F11/36
CPC分类号： G06F9/44589 , G06F11/3604 , G06F11/3608 , G06F11/3612
摘要： Various embodiments provide per group verification techniques in which code may be verified against one or more rules on a group by group basis. In one or more embodiments relationships between portions of a module to be verified can be defined. By being aware of relationships between various code portions, various embodiments can divide a module into related groups and perform verification on the basis of the groups. Multiple groups can be derived based at least in part upon the relationships. Each group can then be verified separately for compliance with one or more rules. Verification results can be output for each of the groups.
摘要翻译：各种实施例提供每组验证技术，其中可以逐组地对一个或多个规则验证代码。在一个或多个实施例中，可以定义要验证的模块的部分之间的关系。通过了解各种代码部分之间的关系，各种实施例可以将模块划分成相关的组，并且基于组进行验证。可以至少部分地基于关系导出多个组。然后可以单独验证每个组，以符合一个或多个规则。可以为每个组输出验证结果。

9. 发明申请

US20110161937A1 PROCESSING PREDICATES INCLUDING POINTER INFORMATION 有权
标题翻译：处理预测包括指针信息
公开(公告)号：US20110161937A1
公开(公告)日：2011-06-30
申请号：US12649335
申请日：2009-12-30
申请人： Eleonora O. Bounimova , Vladimir A. Levin , Leonardo M. de Moura , Thomas J. Ball
发明人： Eleonora O. Bounimova , Vladimir A. Levin , Leonardo M. de Moura , Thomas J. Ball
IPC分类号： G06F9/44
CPC分类号： G06F8/313 , G06F8/434 , G06F11/3608
摘要： A system is described for processing predicates in the course of analyzing a program, based on a general-purpose theory of pointers. The system converts location expressions in the predicates into logical formulae that are interpretable by a theorem prover module, producing converted predicates. This conversion associates the location expressions with location objects. More specifically, the conversion represents variables as explicitly-specified location objects, and location terms (such as a field-type access terms and dereference-type terms) as constructor-specified location objects. The theory of pointers is also expressed by a set of axioms which constrain the operation of the theorem prover module.
摘要翻译：描述了一种基于指针的通用理论在分析程序过程中处理谓词的系统。系统将谓词中的位置表达式转换为可由定理证明器模块解释的逻辑公式，从而产生转换的谓词。此转换将位置表达式与位置对象相关联。更具体地说，转换表示作为显式指定的位置对象的变量，以及作为构造器指定的位置对象的位置术语（诸如字段类型访问术语和解引用类型术语）。指针理论也由限定定理证明器模块操作的一组公理表示。

10. 发明申请

US20110088016A1 PROGRAM ANALYSIS THROUGH PREDICATE ABSTRACTION AND REFINEMENT 有权
标题翻译：通过预测性抽象和精炼进行程序分析
公开(公告)号：US20110088016A1
公开(公告)日：2011-04-14
申请号：US12576253
申请日：2009-10-09
申请人： Thomas J. Ball , Eleonora O. Bounimova , Vladimir A. Levin , Rahul Kumar
发明人： Thomas J. Ball , Eleonora O. Bounimova , Vladimir A. Levin , Rahul Kumar
IPC分类号： G06F9/44
CPC分类号： G06F8/43
摘要： An analysis engine is described for performing static analysis using CEGAR loop functionality, using a combination of forward and backward validation-phase trace analyses. The analysis engine includes a number of features. For example: (1) the analysis engine can operate on blocks of program statements of different adjustable sizes; (2) the analysis engine can identify a subtrace of the trace and perform analysis on that subtrace (rather than the full trace); (3) the analysis engine can form a pyramid of state conditions and extract predicates based on the pyramid and/or from auxiliary source(s); (4) the analysis engine can generate predicates using an increasingly-aggressive series of available discovery techniques; (5) the analysis engine can selectively concretize procedure calls associated with the trace on an as-needed basis and perform other refinements; and (6) the analysis engine can add additional verification targets in the course of its analysis, etc.
摘要翻译：描述了使用CEGAR环路功能执行静态分析的分析引擎，使用正向和反向验证相位跟踪分析的组合。分析引擎包括许多功能。例如：（1）分析引擎可以对不同可调整大小的程序语句块进行操作; （2）分析引擎可以识别跟踪的子跟踪，并对该子跟踪执行分析（而不是完整跟踪）; （3）分析引擎可以形成状态条件的金字塔，并且基于金字塔和/或辅助来源提取谓词; （4）分析引擎可以使用越来越多的可用发现技术来生成谓词; （5）分析引擎可以根据需要选择性地实现与跟踪关联的过程调用，并执行其他改进; 和（6）分析引擎可以在其分析过程中添加额外的验证目标等。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式