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

1. 发明申请

US20130091487A1 SCALABLE PROPERTY-SENSITIVE POINTS-TO ANALYSIS FOR PROGRAM CODE 失效
标题翻译：可扩展的属性敏感点 - 程序代码的分析
公开(公告)号：US20130091487A1
公开(公告)日：2013-04-11
申请号：US13253521
申请日：2011-10-05
申请人： Satish CHANDRA , Julian DOLBY , Manu SRIDHARAN , Frank TIP
发明人： Satish CHANDRA , Julian DOLBY , Manu SRIDHARAN , Frank TIP
IPC分类号： G06F9/44
CPC分类号： G06F8/72 , G06F8/443 , G06F21/563
摘要： A novel system, computer program product, and method are disclosed for transforming a program to facilitate points-to analysis. The method begins with accessing at least a portion of program code, such as JavaScript. In one example, a method with at least one dynamic property correlation is identified for extraction. When a method m is identified for extraction with the dynamic property correlation, a body of the loop l in the method m is extracted. A new method mp is created to include the body of the loop l with the variable i as a parameter. The loop l is substituted in the program code of the method m with the new method mp to create a transformed program code.
摘要翻译：公开了一种新颖的系统，计算机程序产品和方法，用于转换程序以促进点分析。该方法开始于访问程序代码的至少一部分，例如JavaScript。在一个示例中，识别具有至少一个动态属性相关性的方法用于提取。当用动态属性相关性来识别用于提取的方法m时，提取方法m中的循环体l。创建一个新的方法mp以包含循环l的主体，变量i作为参数。循环l在方法m的程序代码中用新方法mp代替以创建转换的程序代码。

2. 发明申请

US20120174082A1 REFACTORING PROGRAMS FOR FLEXIBLE LOCKING 有权
标题翻译：灵活锁定的参考程序
公开(公告)号：US20120174082A1
公开(公告)日：2012-07-05
申请号：US12983581
申请日：2011-01-03
申请人： Julian DOLBY , Manu Sridharan , Frank Tip , Max Schaefer
发明人： Julian DOLBY , Manu Sridharan , Frank Tip , Max Schaefer
IPC分类号： G06F9/45
CPC分类号： G06F8/72 , G06F8/458
摘要： Disclosed is a novel computer implemented system, on demand service, computer program product and a method that provides a set of lock usages that improves concurrency resulting in execution performance of the software application by reducing lock contention through refactoring. More specifically, disclosed is a method to refactor a software application. The method starts with accessing at least a portion of a software application that can execute in an operating environment where there are more two or more threads of execution. Next, a determination is made if there is at least one lock used in the software application to enforce limits on accessing a resource. In response to determining that there is a lock with a first type of construct with a given set of features, the software application is refactored with the lock to preserve behavior of the software application.
摘要翻译：公开了一种新颖的计算机实现系统，按需服务，计算机程序产品和提供一组锁定用途的方法，其通过减少通过重构的锁争用来提高并发性，从而导致软件应用的执行性能。更具体地，公开了一种重构软件应用的方法。该方法开始于访问可以在具有更多两个或更多个执行线程的操作环境中执行的软件应用的至少一部分。接下来，确定在软件应用中是否存在至少一个使用锁来强制访问资源的限制。响应于确定存在具有给定的一组特征的具有第一类型构造的锁，则软件应用程序被重构以保护该软件应用程序的行为。

3. 发明申请

US20130290786A1 AUTOMATED TESTING OF APPLICATIONS WITH SCRIPTING CODE 有权
标题翻译：自动测试应用与脚本代码
公开(公告)号：US20130290786A1
公开(公告)日：2013-10-31
申请号：US13457083
申请日：2012-04-26
申请人： Shay ARTZI , Julian DOLBY , Salvatore A. GUARNIERI , Simon H. JENSEN , Marco PISTOIA , Manu SRIDHARAN , Frank TIP , Omer TRIPP
发明人： Shay ARTZI , Julian DOLBY , Salvatore A. GUARNIERI , Simon H. JENSEN , Marco PISTOIA , Manu SRIDHARAN , Frank TIP , Omer TRIPP
IPC分类号： G06F11/36
CPC分类号： G06F11/3676 , G06F11/3466 , G06F11/3684 , G06F11/3688
摘要： A novel system, computer program product, and method are disclosed for feedback-directed automated test generation for programs, such as JavaScript, in which execution is monitored to collect information that directs the test generator towards inputs that yield increased coverage. Several instantiations of the framework are implemented, corresponding to variations on feedback-directed random testing, in a tool called Artemis.
摘要翻译：公开了一种新颖的系统，计算机程序产品和方法用于诸如JavaScript的程序的反馈定向的自动测试生成，其中执行被监视以收集将测试发生器引导到产生增加的覆盖的输入的信息。在一个名为Artemis的工具中，实现了框架的几个实例，对应于反馈导向随机测试的变化。

4. 发明申请

US20110016356A1 FAULT DETECTION AND LOCALIZATION IN DYNAMIC SOFTWARE APPLICATIONS 有权
标题翻译：动态软件应用中的故障检测和本地化
公开(公告)号：US20110016356A1
公开(公告)日：2011-01-20
申请号：US12502519
申请日：2009-07-14
申请人： Shay ARTZI , Julian DOLBY , Frank TIP
发明人： Shay ARTZI , Julian DOLBY , Frank TIP
IPC分类号： G06F11/36 , G06F9/44
CPC分类号： G06F11/3672 , G06F11/3466 , G06F11/3612
摘要： The present invention provides a system, computer program product and a computer implemented method for prioritizing code fragments based on the use of a software oracle and on a correlation between the executed code fragments and the output they produce. Also described is a computer-implemented method generates additional user inputs based on execution information associated with path constraints and based on information from the oracle. Advantageously, the embodiment is useful in a test generation tool that generated many similar inputs when a failure-inducing input is found, in order to enhance fault localization. Further, described is a computer-implemented flow for extending the existing idea of concolic testing to applications that interact with persistent state.
摘要翻译：本发明提供了一种系统，计算机程序产品和计算机实现的方法，用于基于使用软件oracle以及所执行的代码片段与其产生的输出之间的相关性对代码片段进行优先级排序。还描述了一种基于计算机实现的方法，其基于与路径约束相关联的执行信息并且基于来自oracle的信息生成额外的用户输入。有利地，该实施例对于在发现故障诱导输入时产生许多相似输入的测试生成工具中是有用的，以便增强故障定位。此外，描述了一种计算机实现的流程，用于将现有的concolic测试思想扩展到与持久状态交互的应用程序。

5. 发明申请

US20130282765A1 OPTIMIZING SPARSE SCHEMA-LESS DATA IN RELATIONAL STORES 有权
标题翻译：优化相关存储中的无数据
公开(公告)号：US20130282765A1
公开(公告)日：2013-10-24
申请号：US13454559
申请日：2012-04-24
申请人： Bishwaranjan BHATTACHARJEE , Mihaela Ancuta BORNEA , Patrick DANTRESSANGLE , Julian DOLBY , Kavitha SRINIVAS , Octavian UDREA
发明人： Bishwaranjan BHATTACHARJEE , Mihaela Ancuta BORNEA , Patrick DANTRESSANGLE , Julian DOLBY , Kavitha SRINIVAS , Octavian UDREA
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30292
摘要： Various embodiments of the invention relate to optimizing storage of schema-less data. A schema-less dataset including a plurality of resources is received. Each resource is associated with at least a plurality of properties. At least one set of co-occurring properties from the plurality of properties is identified. A graph including a plurality of nodes is generated. Each of the nodes represents a unique property in the set of co-occurring properties. The graph further includes an edge connecting each node representing a pair of co-occurring properties. A graph coloring operation is performed on the graph. The graph coloring operation includes assigning each of nodes to a color, where nodes connected by an edge are assigned different colors. A schema is generated that assigns a column identifier from a table to each unique property represented by one of the nodes in the graph based on the color assigned to the node.
摘要翻译：本发明的各种实施例涉及优化无模式数据的存储。接收包括多个资源的无模式数据集。每个资源与至少多个属性相关联。识别来自多个属性的至少一组共同属性。生成包括多个节点的图形。每个节点表示共同出现属性集中的唯一属性。该图还包括连接表示一对共同属性的每个节点的边缘。在图表上执行图形着色操作。图形着色操作包括将每个节点分配给颜色，其中通过边缘连接的节点被分配不同的颜色。生成一种模式，该模式根据分配给该节点的颜色，将表中的列标识符从图中的一个节点分配给每个唯一属性。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式