会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Correct refactoring of concurrent software
    • 正确重构并发软件
    • US08689191B2
    • 2014-04-01
    • US12718648
    • 2010-03-05
    • Julian DolbyMax SchaeferManu SridharanFrank TipEmina Torlak
    • Julian DolbyMax SchaeferManu SridharanFrank TipEmina Torlak
    • G06F9/45
    • Automated refactorings as implemented in modern IDEs for Java usually make no special provisions for concurrent code. Thus, refactored programs may exhibit unexpected new concurrent behaviors. We analyze the types of such behavioral changes caused by current refactoring engines and develop techniques to make them behavior-preserving, ranging from simple techniques to deal with concurrency-related language constructs to a framework that computes and tracks synchronization dependencies. By basing our development directly on the Java Memory Model we can state and prove precise correctness results about refactoring concurrent programs. We show that a broad range of refactorings are not influenced by concurrency at all, whereas other important refactorings can be made behavior-preserving for correctly synchronized programs by using our framework. Experience with a prototype implementation shows that our techniques are easy to implement and require only minimal changes to existing refactoring engines.
    • 在Java的现代IDE中实现的自动重组通常对并发代码没有特别规定。 因此,重构的程序可能会出现意想不到的新并发行为。 我们分析由当前重构引擎引起的这种行为变化的类型,并开发技术以使其保持行为,从简单技术到处理与并发相关的语言结构到计算和跟踪同步依赖关系的框架。 通过将我们的开发直接基于Java内存模型,我们可以声明并证明重构并发程序的精确的正确性结果。 我们表明,广泛的重构不受并发影响,而其他重要的重构可以通过使用我们的框架来进行正确同步的程序的行为保留。 使用原型实现的经验表明,我们的技术易于实现,并且只需要对现有重构引擎进行最小的更改。
    • 2. 发明申请
    • CORRECT REFACTORING OF CONCURRENT SOFTWARE
    • 相关软件的正确引用
    • US20110219361A1
    • 2011-09-08
    • US12718648
    • 2010-03-05
    • JULIAN DOLBYMax SchaeferManu SridharanFrank TipEmina Torlak
    • JULIAN DOLBYMax SchaeferManu SridharanFrank TipEmina Torlak
    • G06F9/45
    • Automated refactorings as implemented in modern IDEs for Java usually make no special provisions for concurrent code. Thus, refactored programs may exhibit unexpected new concurrent behaviors. We analyze the types of such behavioral changes caused by current refactoring engines and develop techniques to make them behavior-preserving, ranging from simple techniques to deal with concurrency-related language constructs to a framework that computes and tracks synchronization dependencies. By basing our development directly on the Java Memory Model we can state and prove precise correctness results about refactoring concurrent programs. We show that a broad range of refactorings are not influenced by concurrency at all, whereas other important refactorings can be made behavior-preserving for correctly synchronized programs by using our framework. Experience with a prototype implementation shows that our techniques are easy to implement and require only minimal changes to existing refactoring engines.
    • 在Java的现代IDE中实现的自动重组通常对并发代码没有特别规定。 因此,重构的程序可能会出现意想不到的新并发行为。 我们分析由当前重构引擎引起的这种行为变化的类型,并开发技术以使其保持行为,从简单技术到处理与并发相关的语言结构到计算和跟踪同步依赖关系的框架。 通过将我们的开发直接基于Java内存模型,我们可以声明并证明重构并发程序的精确的正确性结果。 我们表明,广泛的重构不受并发影响,而其他重要的重构可以通过使用我们的框架来进行正确同步的程序的行为保留。 使用原型实现的经验表明,我们的技术易于实现,并且只需要对现有重构引擎进行最小的更改。
    • 3. 发明申请
    • REFACTORING PROGRAMS FOR FLEXIBLE LOCKING
    • 灵活锁定的参考程序
    • US20120174082A1
    • 2012-07-05
    • US12983581
    • 2011-01-03
    • Julian DOLBYManu SridharanFrank TipMax Schaefer
    • Julian DOLBYManu SridharanFrank TipMax Schaefer
    • G06F9/45
    • G06F8/72G06F8/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.
    • 公开了一种新颖的计算机实现系统,按需服务,计算机程序产品和提供一组锁定用途的方法,其通过减少通过重构的锁争用来提高并发性,从而导致软件应用的执行性能。 更具体地,公开了一种重构软件应用的方法。 该方法开始于访问可以在具有更多两个或更多个执行线程的操作环境中执行的软件应用的至少一部分。 接下来,确定在软件应用中是否存在至少一个使用锁来强制访问资源的限制。 响应于确定存在具有给定的一组特征的具有第一类型构造的锁,则软件应用程序被重构以保护该软件应用程序的行为。
    • 4. 发明授权
    • Refactoring programs for flexible locking
    • 重构程序灵活锁定
    • US08869127B2
    • 2014-10-21
    • US12983581
    • 2011-01-03
    • Julian DolbyManu SridharanFrank TipMax Schaefer
    • Julian DolbyManu SridharanFrank TipMax Schaefer
    • G06F9/44
    • G06F8/72G06F8/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.
    • 公开了一种新颖的计算机实现系统,按需服务,计算机程序产品和提供一组锁定用途的方法,其通过减少通过重构的锁争用来提高并发性,从而导致软件应用的执行性能。 更具体地,公开了一种重构软件应用的方法。 该方法开始于访问可以在具有更多两个或更多个执行线程的操作环境中执行的软件应用的至少一部分。 接下来,确定在软件应用中是否存在至少一个使用锁来强制访问资源的限制。 响应于确定存在具有给定的一组特征的具有第一类型构造的锁,则软件应用程序被重构以保护该软件应用程序的行为。