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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

737 篇 会议
127 篇 期刊文献
1 册 图书

馆藏范围

865 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

777 篇 工学
- 742 篇 软件工程
- 568 篇 计算机科学与技术...
- 35 篇 控制科学与工程
- 19 篇 电气工程
- 19 篇 信息与通信工程
- 16 篇 生物工程
- 8 篇 土木工程
- 6 篇 建筑学
- 4 篇 化学工程与技术
- 3 篇 材料科学与工程（可...
- 3 篇 电子科学与技术（可...
- 3 篇 环境科学与工程（可...
- 2 篇 机械工程
- 2 篇 光学工程
- 2 篇 农业工程
59 篇 理学
- 33 篇 数学
- 18 篇 生物学
- 6 篇 物理学
- 6 篇 化学
- 6 篇 系统科学
- 1 篇 大气科学
- 1 篇 地球物理学
- 1 篇 统计学（可授理学、...
59 篇 管理学
- 35 篇 图书情报与档案管...
- 26 篇 管理科学与工程(可...
- 8 篇 工商管理
12 篇 法学
- 12 篇 社会学
- 1 篇 法学
6 篇 教育学
- 6 篇 教育学
3 篇 农学
- 3 篇 作物学
1 篇 医学

主题

250 篇 languages
111 篇 object oriented ...
83 篇 performance
83 篇 design
52 篇 algorithms
46 篇 verification
43 篇 java
41 篇 experimentation
38 篇 reliability
36 篇 computer program...
34 篇 theory
19 篇 human factors
17 篇 concurrency
16 篇 parallel program...
16 篇 object-oriented ...
15 篇 measurement
14 篇 scala
13 篇 aspect oriented ...
13 篇 javascript
12 篇 type systems

机构

18 篇 univ washington ...
13 篇 ecole polytech f...
12 篇 tech univ darmst...
11 篇 microsoft res re...
9 篇 mit csail cambri...
8 篇 univ texas austi...
7 篇 univ marburg d-3...
7 篇 univ texas austi...
7 篇 aarhus univ dk-8...
6 篇 princeton univ p...
6 篇 johannes kepler ...
6 篇 suny binghamton ...
6 篇 harvard univ cam...
6 篇 purdue univ w la...
6 篇 univ calif berke...
5 篇 univ duisburg es...
5 篇 microsoft res ca...
5 篇 ecole polytech f...
5 篇 mcgill univ mont...
5 篇 univ hong kong p...

作者

12 篇 rajan hridesh
12 篇 odersky martin
11 篇 mezini mira
10 篇 hirschfeld rober...
10 篇 binder walter
9 篇 salvaneschi guid...
9 篇 aldrich jonathan
9 篇 ostermann klaus
8 篇 mckinley kathryn...
8 篇 marr stefan
8 篇 rompf tiark
7 篇 oliveira bruno c...
7 篇 noble james
7 篇 liu yu david
7 篇 kuncak viktor
7 篇 gulwani sumit
6 篇 bond michael d.
6 篇 ceze luis
6 篇 van der storm ti...
6 篇 coad peter

语言

746 篇 英文
116 篇 其他
2 篇 中文
1 篇 俄文

检索条件"任意字段=2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages"

共 865 条记录，以下是61-70 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

LACASA: Lightweight affinity and object capabilities in scala 2016

LACASA: Lightweight affinity and object capabilities in scal...

引用

2016 acm sigplan international conference on object-oriented programming, systems, languages, and Applications, OOPSLA 2016

作者： Haller, Philipp Loiko, Alex KTH Royal Institute of Technology Sweden Google Sweden

ISBN: (纸本)9781450344449

Aliasing is a known source of challenges in the context of imperative object-oriented languages, which have led to important advances in type systems for aliasing control. However, their large-scale adoption has turned out to be a surprisingly difficult challenge. While new language designs show promise, they do not address the need of aliasing control in existing languages. This paper presents a new approach to isolation and uniqueness in an existing, widely-used language, Scala. The approach is unique in the way it addresses some of the most important obstacles to the adoption of type system extensions for aliasing control. First, adaptation of existing code requires only a minimal set of annotations. Only a single bit of information is required per class. Surprisingly, the paper shows that this information can be provided by the object-capability discipline, widely-used in program security. We formalize our approach as a type system and prove key soundness theorems. The type system is implemented for the full Scala language, providing, for the first time, a sound integration with Scala's local type inference. Finally, we empirically evaluate the conformity of existing Scala open-source code on a corpus of over 75,000 LOC. © 2016 acm.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

First-class effect reflection for effect-guided programming 2016

First-class effect reflection for effect-guided programming

引用

2016 acm sigplan international conference on object-oriented programming, systems, languages, and Applications, OOPSLA 2016

作者： Long, Yuheng Liu, Yu David Rajan, Hridesh Iowa State University United States SUNY Binghamton United States

ISBN: (纸本)9781450344449

This paper introduces a novel type-and-effect calculus, firstclass effects, where the computational effect of an expression can be programmatically reflected, passed around as values, and analyzed at run time. A broad range of designs "hardcoded" in existing effect-guided analyses - from thread scheduling, version-consistent software updating, to data zeroing - can be naturally supported through the programming abstractions. The core technical development is a type system with a number of features, including a hybrid type system that integrates static and dynamic effect analyses, a refinement type system to verify application-specific effect management properties, a double-bounded type system that computes both over-approximation of effects and their *** introduce and establish a notion of soundness called trace consistency, defined in terms of how the effect and trace correspond. The property sheds foundational insight on "good" first-class effect programming. © 2016 acm.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

GEMS: Shared-memory parallel programming for *** 2016

GEMS: Shared-memory parallel programming for ***

引用

2016 acm sigplan international conference on object-oriented programming, systems, languages, and Applications, OOPSLA 2016

作者： Bonetta, Daniele Salucci, Luca Marr, Stefan Binder, Walter Oracle Labs Austria Università della Svizzera italiana Switzerland Johannes Kepler University Linz Linz Austria

ISBN: (纸本)9781450344449

JavaScript is the most popular programming language for client-side Web applications, and *** has popularized the language for server-side computing, too. In this domain, the minimal support for parallel programming remains however a major limitation. In this paper we introduce a novel parallel programming abstraction called Generic Messages (GEMS). GEMS allow one to combine message passing and shared-memory parallelism, extending the classes of parallel applications that can be built with ***. GEMS have customizable semantics and enable several forms of thread safety, isolation, and concurrency control. GEMS are designed as convenient JavaScript abstractions that expose high-level and safe parallelism models to the developer. Experiments show that GEMS outperform equivalent *** applications thanks to their usage of shared memory. © 2016 acm.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Apex: Automatic programming assignment error explanation 2016

Apex: Automatic programming assignment error explanation

引用

2016 acm sigplan international conference on object-oriented programming, systems, languages, and Applications, OOPSLA 2016

作者： Kim, Dohyeong Kwon, Yongwhi Liu, Peng Kim, I Luk Perry, David Mitchel Zhang, Xiangyu Rodriguez-Rivera, Gustavo Department of Computer Science Purdue University United States

ISBN: (纸本)9781450344449

This paper presents Apex, a system that can automatically generate explanations for programming assignment bugs, regarding where the bugs are and how the root causes led to the runtime failures. It works by comparing the passing execution of a correct implementation (provided by the instructor) and the failing execution of the buggy implementation (submitted by the student). The technique overcomes a number of technical challenges caused by syntactic and semantic differences of the two implementations. It collects the symbolic traces of the executions and matches assignment statements in the two execution traces by reasoning about symbolic equivalence. It then matches predicates by aligning the control dependences of the matched assignment statements, avoiding direct matching of path conditions which are usually quite different. Our evaluation shows that Apex is every effective for 205 buggy real world student submissions of 4 programming assignments, and a set of 15 programming assignment type of buggy programs collected from ***, precisely pinpointing the root causes and capturing the causality for 94.5% of them. The evaluation on a standard benchmark set with over 700 student bugs shows similar results. A user study in the classroom shows that Apex has substantially improved student productivity. © 2016 acm.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Efficient and thread-safe objects for dynamically-typed languages 2016

Efficient and thread-safe objects for dynamically-typed lang...

引用

2016 acm sigplan international conference on object-oriented programming, systems, languages, and Applications, OOPSLA 2016

作者： Daloze, Benoit Marr, Stefan Bonetta, Daniele Mössenböck, Hanspeter Johannes Kepler University Linz Linz Austria Oracle Labs Austria

ISBN: (纸本)9781450344449

We are in the multi-core era. Dynamically-typed languages are in widespread use, but their support for multithreading still lags behind. One of the reasons is that the sophisticated techniques they use to efficiently represent their dynamic object models are often unsafe in multithreaded environments. This paper defines safety requirements for dynamic object models in multithreaded environments. Based on these requirements, a language-agnostic and thread-safe object model is designed that maintains the efficiency of sequential approaches. This is achieved by ensuring that field reads do not require synchronization and field updates only need to synchronize on objects shared between threads. Basing our work on JRuby+Truffle, we show that our safe object model has zero overhead on peak performance for thread-local objects and only 3% average overhead on parallel benchmarks where field updates require synchronization. Thus, it can be a foundation for safe and efficient multithreaded VMs for a wide range of dynamic languages. © 2016 acm.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations 2016

Deriving divide-and-conquer dynamic programming algorithms u...

引用

2016 acm sigplan international conference on object-oriented programming, systems, languages, and Applications, OOPSLA 2016

作者： Itzhaky, Shachar Singh, Rohit Solar-Lezama, Armando Yessenov, Kuat Lu, Yongquan Leiserson, Charles Chowdhury, Rezaul MIT United States Stony Brook University Stony BrookNY United States

ISBN: (纸本)9781450344449

We introduce a framework allowing domain experts to manipulate computational terms in the interest of deriving better, more efficient implementations. It employs deductive reasoning to generate provably correct efficient implementations from a very high-level specification of an algorithm, and inductive constraint-based synthesis to improve automation. Semantic information is encoded into program terms through the use of refinement types. In this paper, we develop the technique in the context of a system called Bellmania that uses solver-aided tactics to derive parallel divide-and-conquer implementations of dynamic programming algorithms that have better locality and are significantly more efficient than traditional loop-based implementations. Bellmania includes a high-level language for specifying dynamic programming algorithms and a calculus that facilitates gradual transformation of these specifications into efficient implementations. These transformations formalize the divide-and-conquer technique;a visualization interface helps users to interactively guide the process, while an SMT-based back-end verifies each step and takes care of low-level reasoning required for parallelism. We have used the system to generate provably correct implementations of several algorithms, including some important algorithms from computational biology, and show that the performance is comparable to that of the best manually optimized code. © 2016 acm.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Modeling and analysis of remote memory access programming 2016

Modeling and analysis of remote memory access programming

引用

2016 acm sigplan international conference on object-oriented programming, systems, languages, and Applications, OOPSLA 2016

作者： Dan, Andrei Marian Lam, Patrick Hoefler, Torsten Vechev, Martin ETH Zurich Switzerland University of Waterloo Canada

ISBN: (纸本)9781450344449

Recent advances in networking hardware have led to a new generation of Remote Memory Access (RMA) networks in which processors from different machines can communicate directly, bypassing the operating system and allowing higher performance. Researchers and practitioners have proposed libraries and programming models for RMA to enable the development of applications running on these networks, However, the memory models implied by these RMA libraries and languages are often loosely specified, poorly understood, and differ depending on the underlying network architecture and other factors. Hence, it is difficult to precisely reason about the semantics of RMA programs or how changes in the network architecture affect them. We address this problem with the following contributions: (i) a coreRMA language which serves as a common foundation, formalizing the essential characteristics of RMA programming;(ii) complete axiomatic semantics for that language;(iii) integration of our semantics with an existing constraint solver, enabling us to exhaustively generate core- RMA programs (litmus tests) up to a specified bound and check whether the tests satisfy their specification;and (iv) extensive validation of our semantics on real-world RMA systems. We generated and ran 7,441 litmus tests using each of the low-level RMA network APIs: DMAPP, VPI Verbs, and Portals 4. Our results confirmed that our model successfully captures behaviors exhibited by these networks. Moreover, we found RMA programs that behave inconsistently with existing documentation, confirmed by network experts. Our work provides an important step towards understanding existing RMA networks, thus influencing the design of future RMA interfaces and hardware. © 2016 acm.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共87页 << < 3 4 5 6 7 8 9 10 11 12 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：