检索结果-内蒙古大学图书馆

Semantic subtyping for imperative object-oriented languages 2016

Semantic subtyping for imperative object-oriented languages

2016 ACM SIGPLAN International conference on object-oriented programming, systems, languages, and applications, oopsla 2016

作者： Ancona, Davide Corradi, Andrea DIBRIS - Università di Genova via Dodecaneso 35 Genova16146 Italy

ISBN: (纸本)9781450344449

Semantic subtyping is an approach for defining sound and complete procedures to decide subtyping for expressive types, including union and intersection types;although it has been exploited especially in functional languages for XML based programming, recently it has been partially investigated in the context of object-oriented languages, and a sound and complete subtyping algorithm has been proposed for record types, but restricted to immutable fields, with union and recursive types interpreted coinductively to support cyclic objects. In this work we address the problem of studying semantic subtyping for imperative object-oriented languages, where fields can be mutable;in particular, we add read/write field annotations to record types, and, besides union, we consider intersection types as well, while maintaining coinductive interpretation of recursive types. In this way, we get a richer notion of type with a flexible subtyping relation, able to express a variety of type invariants useful for enforcing static guarantees for mutable objects. The addition of these features radically changes the definition of subtyping, and, hence, the corresponding decision procedure, and surprisingly invalidates some subtyping laws that hold in the functional setting. We propose an intuitive model where mutable record values contain type information to specify the values that can be correctly stored in fields. Such a model, and the corresponding subtyping rules, require particular care to avoid circularity between coinductive judgments and their negations which, by duality, have to be interpreted inductively. A sound and complete subtyping algorithm is provided, together with a prototype implementation. © 2016 ACM.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A Compiler for Throughput Optimization of Graph Algorithms on GPUs 2016

A Compiler for Throughput Optimization of Graph Algorithms o...

引用

ACM SIGPLAN International conference on object-oriented programming, systems, languages, and applications (oopsla)

作者： Pai, Sreepathi Pingali, Keshav Univ Texas Austin Austin TX 78712 USA

ISBN: (纸本)9781450344449

Writing high-performance GPU implementations of graph algorithms can be challenging. In this paper, we argue that three optimizations called throughput optimizations are key to high-performance for this application class. These optimizations describe a large implementation space making it unrealistic for programmers to implement them by hand. To address this problem, we have implemented these optimizations in a compiler that produces CUDA code from an intermediate-level program representation called IrGL. Compared to state-of-the-art handwritten CUDA implementations of eight graph applications, code generated by the IrGL compiler is up to 5.95x times faster (median 1.4x) for five applications and never more than 30% slower for the others. Throughput optimizations contribute an improvement up to 4.16x (median 1.4x) to the performance of unoptimized IrGL code.

关键词： Graph applications amorphous data-parallelism GPUs compilers optimization throughput

来源：评论

学校读者我要写书评

暂无评论

Parallel incremental whole-program optimizations for *** 2016

Parallel incremental whole-program optimizations for ***

引用

2016 ACM SIGPLAN International conference on object-oriented programming, systems, languages, and applications, oopsla 2016

作者： Doeraene, Sébastien Schlatter, Tobias École polytechnique fédérale de Lausanne Switzerland

ISBN: (纸本)9781450344449

Whole-program optimizations are powerful tools that can dramatically improve performance, size and other aspects of programs. Because they depend on global knowledge, they must typically be reapplied to the whole program when small changes are made, which makes them too slow for the development cycle. This is an issue for some environments that require, or benefit a lot from, whole-program optimizations, such as compilation to JavaScript or to the Dalvik VM, because their development cycle is slowed down either by the lack of optimizations, or by the time spent on applying them. We present a new approach to designing incremental whole-program optimizers for object-oriented and functional languages: when part of a program changes, only the portions affected by the changes are reoptimized. An incremental optimizer using this approach for ***, the Scala to JavaScript compiler, demonstrates speedups from 10x to 100x compared to its batch version. As a result, the optimizer's running time becomes insignificant compared to separate compilation, making it fit for use on every compilation run during the development cycle. We also show how to parallelize the incremental algorithm to take advantage of multicore hardware. © 2016 ACM.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Type soundness for dependent object types (DOT) 2016

Type soundness for dependent object types (DOT)

引用

2016 ACM SIGPLAN International conference on object-oriented programming, systems, languages, and applications, oopsla 2016

作者： Rompf, Tiark Amin, Nada Purdue University United States EPFL Switzerland

ISBN: (纸本)9781450344449

Scala's type system unifies aspects of ML modules, objectoriented, and functional programming. The Dependent object Types (DOT) family of calculi has been proposed as a new theoretic foundation for Scala and similar expressive languages. Unfortunately, type soundness has only been established for restricted subsets of DOT. In fact, it has been shown that important Scala features such as type refinement or a subtyping relation with lattice structure break at least one key metatheoretic property such as environment narrowing or invertible subtyping transitivity, which are usually required for a type soundness proof. The main contribution of this paper is to demonstrate how, perhaps surprisingly, even though these properties are lost in their full generality, a rich DOT calculus that includes recursive type refinement and a subtyping lattice with intersection types can still be proved sound. The key insight is that subtyping transitivity only needs to be invertible in code paths executed at runtime, with contexts consisting entirely of valid runtime objects, whereas inconsistent subtyping contexts can be permitted for code that is never executed. © 2016 ACM.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

Towards object-Aware Development Tools

Towards Object-Aware Development Tools

引用

ACM SIGPLAN International conference on systems, programming, languages and applications: Software for Humanity (SPLASH Companion)

作者： Chis, Andrei Univ Bern CH-3012 Bern Switzerland

ISBN: (纸本)9781450344371

Reasoning about object-oriented applications requires developers to answer contextual questions about their domain objects. Tailored development tools can support developers in this activity by providing relevant domain-specific information. Nonetheless, a high effort for extending development tools to handle domain-specific objects, together with diverging mechanisms for creating, sharing and discovering extensions, discourage developers to adapt their tools. To address this, we propose to enable contextual behavior in development tools by allowing domain objects to decide how they are handled in development tools. We show that combining this idea with mechanisms for specifying extensions using internal DSLs can significantly reduce the cost of tailoring development tools to specific domains.

关键词： Customization object-oriented programming

来源：评论

学校读者我要写书评

暂无评论

Deducing Classes Integrating the Domain Models of object-oriented applications

Deducing Classes Integrating the Domain Models of Object-Ori...

引用

ACM SIGPLAN International conference on systems, programming, languages and applications: Software for Humanity (SPLASH Companion)

作者： Rein, Patrick Univ Potsdam Hasso Plattner Inst Potsdam Germany

ISBN: (纸本)9781450344371

The interoperability of applications depends on a successful mapping between their domain models. Nowadays, common file formats serve as a mediator between the different domain models but cause friction losses during the conversion of data. These loses could be mitigated whenever the models are already working on the same concepts but are only using different representations for them. We propose the concept of deducing classes which interpret existing object structures and detect instances of themselves in this existing data. Further, we introduce a planning algorithm which combines deducing classes to allow unanticipated interactions between applications. We discuss some of the implications of this approach and illustrate upcoming research challenges.

关键词： object domain models integration abstractions

来源：评论

学校读者我要写书评

暂无评论

Finding resume and restart errors in android applications 2016

Finding resume and restart errors in android applications

引用

2016 ACM SIGPLAN International conference on object-oriented programming, systems, languages, and applications, oopsla 2016

作者： Shan, Zhiyong Azim, Tanzirul Neamtiu, Iulian School of Computer Science and Mathematics University of Central Missouri WarrensburgMO64093 United States Department of Computer Science and Engineering University of California RiversideCA92521 United States Department of Computer Science New Jersey Institute of Technology NewarkNJ07102 United States

ISBN: (纸本)9781450344449

Smartphone apps create and handle a large variety of "instance" data that has to persist across runs, such as the current navigation route, workout results, antivirus settings, or game state. Due to the nature of the smartphone platform, an app can be paused, sent into background, or killed at any time. If the instance data is not saved and restored between runs, in addition to data loss, partially-saved or corrupted data can crash the app upon resume or restart. While smartphone platforms offer API support for data-saving and data-retrieving operations, the use of this API is ad-hoc: left to the programmer, rather than enforced by the compiler. We have observed that several categories of bugs-including data loss, failure to resume/restart or resuming/restarting in the wrong state-are due to incorrect handling of instance data and are easily triggered by just pressing the 'Home' or 'Back' buttons. To help address this problem, we have constructed a tool chain for Android (the KRE finder static analysis and the KREreproducer input generator) that helps find and reproduce such incorrect handling. We have evaluated our approach by running the static analysis on 324 apps, of which 49 were further analyzed manually. Results indicate that our approach is (i) effective, as it has discovered 49 bugs, including in popular Android apps, and (ii) efficient, completing on average in 61 seconds per app. More generally, our approach helps determine whether an app saves too much or too little state. © 2016 ACM.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

OrcO: A Concurrency-First Approach to objects

引用

ACM SIGPLAN NOTICES 2016年第10期51卷 548-567页

作者： Peters, Arthur Michener Kitchin, David Thywissen, John A. Cook, William R. Univ Texas Austin Austin TX 78712 USA Google Inc Mountain View CA USA

The majority of modern programming languages provide concurrency and object-orientation in some form. However, object-oriented concurrency remains cumbersome in many situations. We introduce the language OrcO, Orc with concurrent objects, which enables a flexible style of concurrent object-oriented programming. OrcO extends the Orc programming language by adding abstractions for programming-in-the-large;namely objects, classes, and inheritance. OrcO objects are designed to be orthogonal to concurrency, allowing the concurrent structure and object structure of a program to evolve independently. This paper describes OrcO's goals and design and provides examples of how OrcO can be used to deftly handle events, object management, and object composition.

关键词： Composition futures language design mixin inheritance object supervision Orc

来源：评论

学校读者我要写书评

暂无评论

Reactive object Queries Consistent Views in object-oriented languages 2016

Reactive Object Queries Consistent Views in Object-Oriented ...

引用

15th International conference on Modularity (MODULARITY)

作者： Lehmann, Stefan Felgentreff, Tim Lincke, Jens Rein, Patrick Hirschfeld, Robert Univ Potsdam Hasso Plattner Inst Potsdam Germany

ISBN: (纸本)9781450340335

Maintaining consistency between data throughout a system using scattered, imperative code fragments is challenging. Some mechanisms address this challenge by making data dependencies explicit. Among these mechanisms are reactive collections, which define data dependencies for collections of objects, and object queries, which allow developers to query their program for a subset of objects. However, on their own, both of these mechanisms are limited. Reactive collections require an initial collection to apply reactive operations to and object queries do not update its result as the system changes. Using these two mechanisms in conjunction allows each to mitigate the disadvantage of the other. To do so, object queries need to respond to state changes of the system. In this paper, we propose a combination of both mechanisms, called reactive object queries. Reactive object queries allow the developer to declaratively select all objects in a program that match a particular predicate, creating a view. Additionally, views can be composed of other views using reactive operations. All views are automatically updated when the program state changes. To better integrate with existing imperative systems, we provide fine-grained events signaling view updates. We implemented the proposed concepts in JavaScript. Our initial experience with example applications shows that the combined concept eases the integration of reactive mechanisms with object-oriented environments by avoiding scattered update code.

关键词： Events Reactive Collections Reactive programming object Queries object-oriented programming

来源：评论

学校读者我要写书评

暂无评论

Semantic Subtyping for Imperative object-oriented languages

引用

ACM SIGPLAN NOTICES 2016年第10期51卷 568-587页

作者： Ancona, Davide Corradi, Andrea Univ Genoa DIBRIS Via Dodecaneso 35 I-16146 Genoa Italy

关键词： Structural Types for objects Semantic Subtyping Read/Write Field Annotations

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：