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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,278 篇 会议
296 篇 期刊文献
2 册 图书

馆藏范围

2,576 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,280 篇 工学
- 2,147 篇 软件工程
- 1,702 篇 计算机科学与技术...
- 85 篇 控制科学与工程
- 57 篇 信息与通信工程
- 55 篇 电气工程
- 23 篇 电子科学与技术（可...
- 17 篇 机械工程
- 14 篇 建筑学
- 14 篇 土木工程
- 13 篇 材料科学与工程（可...
- 13 篇 生物工程
- 10 篇 光学工程
- 9 篇 安全科学与工程
- 8 篇 化学工程与技术
- 5 篇 动力工程及工程热...
- 5 篇 生物医学工程（可授...
- 4 篇 力学（可授工学、理...
278 篇 理学
- 217 篇 数学
- 30 篇 系统科学
- 18 篇 统计学（可授理学、...
- 16 篇 物理学
- 16 篇 生物学
- 8 篇 化学
- 6 篇 地质学
207 篇 管理学
- 112 篇 图书情报与档案管...
- 107 篇 管理科学与工程(可...
- 48 篇 工商管理
22 篇 教育学
- 22 篇 教育学
17 篇 法学
- 15 篇 社会学
9 篇 经济学
- 9 篇 应用经济学
2 篇 农学
2 篇 艺术学
1 篇 军事学

主题

390 篇 design
369 篇 languages
186 篇 computer program...
182 篇 performance
162 篇 object oriented ...
89 篇 algorithms
88 篇 java programming...
81 篇 experimentation
78 篇 functional progr...
71 篇 theory
69 篇 computer program...
65 篇 java
63 篇 verification
61 篇 reliability
48 篇 semantics
47 篇 software design
45 篇 domain-specific ...
38 篇 parallel program...
37 篇 concurrency
35 篇 measurement

机构

24 篇 carnegie mellon ...
22 篇 univ washington ...
18 篇 univ penn philad...
17 篇 princeton univ p...
17 篇 stanford univ st...
16 篇 univ texas austi...
15 篇 harvard univ cam...
14 篇 purdue univ w la...
13 篇 microsoft res re...
13 篇 microsoft resear...
13 篇 rice univ housto...
12 篇 univ wisconsin m...
12 篇 mit cambridge ma...
12 篇 cornell univ ith...
12 篇 microsoft res ca...
11 篇 univ michigan an...
11 篇 swiss fed inst t...
11 篇 univ calif berke...
10 篇 microsoft res re...
10 篇 yale univ new ha...

作者

19 篇 hirschfeld rober...
16 篇 walker david
15 篇 visser eelco
15 篇 felleisen matthi...
14 篇 findler robert b...
13 篇 grossman dan
13 篇 bacon david f.
12 篇 chlipala adam
11 篇 flatt matthew
11 篇 sarkar vivek
11 篇 myers andrew c.
11 篇 mezini mira
11 篇 morrisett greg
10 篇 mckinley kathryn...
10 篇 bockisch christo...
10 篇 adl-tabatabai al...
10 篇 de moor oege
10 篇 dillig isil
9 篇 lumsdaine a
9 篇 van der storm ti...

语言

2,349 篇 英文
222 篇 其他
4 篇 中文
1 篇 葡萄牙文

检索条件"任意字段=ACM SIGPLAN Conference on Programming Language Design and Implementation"

共 2576 条记录，以下是891-900 订阅

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

详细简洁

排序：

Delegated Isolation 11

Delegated Isolation

引用

2011 acm International conference on Object Oriented programming Systems languages and Applications

作者： Lublinerman, Roberto Zhao, Jisheng Budimlic, Zoran Chaudhuri, Swarat Sarkar, Vivek Penn State Univ University Pk PA 16802 USA Rice Univ Houston TX 77251 USA

ISBN: (纸本)9781450309400

Isolation-the property that a task can access shared data without interference from other tasks-is one of the most basic concerns in parallel programming. In this paper, we present Aida, a new model of isolated execution for parallel programs that perform frequent, irregular accesses to pointer-based shared data structures. The three primary benefits of Aida are dynamism, safety and liveness guarantees, and programmability. First, Aida allows tasks to dynamically select and modify, in an isolated manner, arbitrary fine-grained regions in shared data structures, all the while maintaining a high level of concurrency. Consequently, the model can achieve scalable parallelization of regular as well as irregular shared-memory applications. Second, the model offers freedom from data races, deadlocks, and livelocks. Third, no extra burden is imposed on programmers, who access the model via a simple, declarative isolation construct that is similar to that for transactional memory. The key new insight in Aida is a notion of delegation among concurrent isolated tasks (known in Aida as assemblies). Each assembly A is equipped with a region in the shared heap that it owns-the only objects accessed by A are those it owns, guaranteeing race-freedom. The region owned by A can grow or shrink flexibly-however, when A needs to own a datum owned by B, A delegates itself, as well as its owned region, to B. From now on, B has the responsibility of re-executing the task A set out to complete. Delegation as above is the only inter-assembly communication primitive in Aida. In addition to reducing contention in a local, data-driven manner, it guarantees freedom from deadlocks and livelocks. We offer an implementation of Aida on top of the Habanero Java parallel programming language. The implementation employs several novel ideas, including the use of a union-find data structure to represent tasks and the regions that they own. A thorough evaluation using several irregular data-parallel bench

关键词： languages design Isolation programming abstractions Irregular parallelism Contention

来源：评论

学校读者我要写书评

暂无评论

ICFP'11 - Proceedings of the 2011 acm sigplan International conference on Functional programming

ICFP'11 - Proceedings of the 2011 ACM SIGPLAN International ...

引用

16th acm sigplan International conference on Functional programming, ICFP'11

ISBN: (纸本)9781450308656

The proceedings contain 38 papers. The topics discussed include: on the bright side of type classes: instance arguments in Agda;functional modelling of musical harmony;how to make ad hoc proof automation less ad hoc;temporal higher-order contracts;parsing with derivatives: a functional pearl;an efficient non-moving garbage collector for functional languages;deriving an efficient FPGA implementation of a low density parity check forward error corrector;geometry of synthesis IV: compiling affine recursion into static hardware;a hierarchy of mendler style recursion combinators: taming inductive datatypes with negative occurrences;typed self-interpretation by pattern matching;and using Camlp4 for presenting dynamic mathematics on the web: DynaMoW, an OCaml language extension for the run-time generation of mathematical contents and their presentation on the web.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An approach to modular object-oriented programming in language-driven development framework

An approach to modular object-oriented programming in langua...

引用

6th Workshop on the implementation, Compilation, Optimization of Object-Oriented languages, Programs and Systems, ICOOOLPS 2011 - In Conjunction with the 25th European conference on Object-Oriented programming, ECOOP 2011

作者： Sedunov, Alexey A. Tyukachev, Nikolay A. Voronezh State University Russia

ISBN: (纸本)9781450308946

We report on our ongoing research of an object-oriented language for a metaprogramming framework called Turbine. The paper describes structural elements of models, their relations and intended patterns of usage and then presents an object-oriented language we've developed specifically for the Turbine framework ("base language"). We also demonstrate usage of base language constructs on examples of the modular behavior extension for the set of AST classes. © 2011 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Product Lines of Theorems 11

Product Lines of Theorems

引用

2011 acm International conference on Object Oriented programming Systems languages and Applications

作者： Delaware, Benjamin Cook, William R. Batory, Don Univ Texas Austin Dept Comp Sci Austin TX 78712 USA

ISBN: (纸本)9781450309400

Mechanized proof assistants are powerful verification tools, but proof development can be difficult and time-consuming. When verifying a family of related programs, the effort can be reduced by proof reuse. In this paper, we show how to engineer product lines with theorems and proofs built from feature modules. Each module contains proof fragments which are composed together to build a complete proof of correctness for each product. We consider a product line of programming languages, where each variant includes metatheory proofs verifying the correctness of its semantic definitions. This approach has been realized in the Coq proof assistant, with the proofs of each feature independently certifiable by Coq. These proofs are composed for each language variant, with Coq mechanically verifying that the composite proofs are correct. As validation, we formalize a core calculus for Java in Coq which can be extended with any combination of casts, interfaces, or generics.

关键词： design Theory Verification Feature-Orientation Mechanized Metatheory Product Line Verification

来源：评论

学校读者我要写书评

暂无评论

Misfits in abstractions: Towards user-centered design in domain-specific languages for end-user programming

Misfits in abstractions: Towards user-centered design in dom...

引用

acm International conference on Systems, programming, languages, and Applications: Software for Humanity, SPLASH'11

作者： Nishino, Hiroki NUS Graduate School for Integrative Sciences and Engineering National University of Singapore Singapore

ISBN: (纸本)9781450309424

In this paper, we discuss user-centered design of end-user programming languages with an example of computer music language. We describe an approach to analyze the misfits between the users'conceptualization and the programming language design in an existing usability problem with a focus on the abstraction layers both in conceptualization and language. When an entity in the users'conceptualization involved in problem-solving has no counterpart in a DSL, this can appear as a usability problem. Analysis of such a misfit caused by inappropriate abstraction in DSL design can contribute to better usability in end-user programming.

关键词： Abstracting

来源：评论

学校读者我要写书评

暂无评论

A Smalltalk implementation of Exil, a component-based programming language 11

A Smalltalk implementation of Exil, a component-based progra...

引用

3rd International Workshop on Smalltalk Technologies 2011, IWST'11

作者： Špaček, Petr Dony, Christophe Tibermacine, Chouki Fabresse, Luc LIRMM CNRS Montpellier II University 161 rue Ada 34392 Montpellier Cedex 5 France Université Lille Nord de France 941 rue Charles Bourseul 59508 Douai Cedex France

ISBN: (纸本)9781450310505

The component-based development paradigm brings various solutions for software reusability and better modular structure of applications. When applied in programming language context it changes the way dependencies and connections between software pieces are expressed. In this paper we present the Smalltalk implementation of "Exil", a component-based architecture description and programming language that makes it possible to use component related concepts (ports, interfaces, services, .) at design and if wished at programming time. This proposal enables Smalltalk users to develop their applications in the component-oriented style. Copyright © 2011 acm.

关键词： Reusability

来源：评论

学校读者我要写书评

暂无评论

Ribbons: A Partially Shared Memory programming Model 11

Ribbons: A Partially Shared Memory Programming Model

引用

2011 acm International conference on Object Oriented programming Systems languages and Applications

作者： Hoffman, Kevin Metzger, Harrison Eugster, Patrick Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA

ISBN: (纸本)9781450309400

The need for programs to execute subcomponents in isolation from each other or with lower privileges is prevalent among today's systems. We introduce ribbons: a shared memory programming model that allows for more implicit sharing of memory than processes but is more restrictive than threads. Ribbons structure the heap into protection domains. Privileges between these protection domains are carefully controlled in order to confine computation. We propose RIBBONJ, a backwards-compatible extension of Java, to easily create or port programs to use the ribbons model. We study the progress and isolation properties of a subset of the language. Building on JikesRVM we implement ribbons by leveraging existing memory protection mechanisms in modern hardware and operating systems, avoiding the overhead of inline security checks and read or write barriers. We evaluate efficiency via microbenchmarks and the DaCapo suite, observing minor overhead. Additionally, we refactor Apache Tomcat to use ribbons for application isolation, discuss the refactoring's design and complexity, and evaluate performance using the SPECweb2009 benchmark.

关键词： design languages Security shared memory virtual memory access control heap partitioning multithreading ribbons

来源：评论

学校读者我要写书评

暂无评论

SpiceC: Scalable parallelism via implicit copying and explicit Commit 11

SpiceC: Scalable parallelism via i</...

引用

16th acm Symposium on Principles and Practice of Parallel programming

作者： Feng, Min Gupta, Rajiv Hu, Yi Univ Calif Riverside CSE Dept Riverside CA 92521 USA

ISBN: (纸本)9781450301190

In this paper we present an approach to parallel programming called SpiceC. SpiceC simplifies the task of parallel programming through a combination of an intuitive computation model and SpiceC directives. The SpiceC parallel computation model consists of multiple threads where every thread has a private space for data and all threads share data via a shared space. Each thread performs computations using its private space thus offering isolation which allows for speculative computations. SpiceC provides easy to use SpiceC compiler directives using which the programmers can express different forms of parallelism. It allows developers to express high level constraints on data transfers between spaces while the tedious task of generating the code for the data transfers is performed by the compiler. SpiceC also supports data transfers involving dynamic data structures without help from developers. SpiceC allows developers to create clusters of data to enable parallel data transfers. SpiceC programs are portable across modern chip multiprocessor based machines that may or may not support cache coherence. We have developed implementations of SpiceC for shared memory systems with and without cache coherence. We evaluate our implementation using seven benchmarks of which four are parallelized speculatively. Our compiler generated implementations achieve speedups ranging from 2x to 18x on a 24 core system.

关键词： Compiler directives Multicores Speculation language design Performance

来源：评论

学校读者我要写书评

暂无评论

Fast and Space-Efficient Virtual Machine Checkpointing 11

Fast and Space-Efficient Virtual Machine Checkpointing

引用

7th acm sigplan/SIGOPS International conference on Virtual Execution Environments

作者： Park, Eunbyung Egger, Bernhard Lee, Jaejin Seoul Natl Univ Sch Comp Sci & Engn Seoul 151744 South Korea

ISBN: (纸本)9781450306874

Checkpointing, i.e., recording the volatile state of a virtual machine (VM) running as a guest in a virtual machine monitor (VMM) for later restoration, includes storing the memory available to the VM. Typically, a full image of the VM's memory along with processor and device states are recorded. With guest memory sizes of up to several gigabytes, the size of the checkpoint images becomes more and more of a concern. In this work we present a technique for fast and space-efficient checkpointing of virtual machines. In contrast to existing methods, our technique eliminates redundant data and stores only a subset of the VM's memory pages. Our technique transparently tracks I/O operations of the guest to external storage and maintains a list of memory pages whose contents are duplicated on non-volatile storage. At a checkpoint, these pages are excluded from the checkpoint image. We have implemented the proposed technique for paravirtualized as well as fully-virtualized guests in the Xen VMM. Our experiments with a paravirtualized guest (Linux) and two fully-virtualized guests (Linux, Windows) show a significant reduction in the size of the checkpoint image as well as the time required to complete the checkpoint. Compared to the current Xen implementation, we achieve, on average, an 81% reduction in the stored data and a 74% reduction in the time required to take a checkpoint for the paravirtualized Linux guest. In a fully-virtualized environment running Windows and Linux guests, we achieve a 64% reduction of the image size along with a 62% reduction in checkpointing time.

关键词： design Measurement Performance Reliability Virtual Machine Checkpointing

来源：评论

学校读者我要写书评

暂无评论

Modularizing Crosscutting Concerns with Ptolemy 11

Modularizing Crosscutting Concerns with Ptolemy

引用

10th International conference on Aspect-Oriented Software Development (AOSD)

作者： Rajan, Hridesh Leavens, Gary T. Dyer, Robert Bagherzadeh, Mehdi Iowa State Univ Ames IA 50011 USA Univ Cent Florida Orlando FL 32816 USA

ISBN: (纸本)9781450305563

This tutorial will provide an introduction to Ptolemy. Ptolemy is a programming language whose goals are to improve a software engineer's ability to separate conceptual concerns, while preserving encapsulation of object-oriented code and the ability of programmers to modularly reason about their code. In particular, Ptolemy's features are useful towards modularization of cross-cutting concerns. A cross-cutting concern is a requirement whose implementation is spread across and mixed with the code of other requirements. There has been attempts to improve separation of cross-cutting concerns, e.g. by aspect-oriented and implicit-invocation languages, but none give software developers textual separation of concerns and modular reasoning at the same time. Ptolemy has both these properties important for scalable software engineering. Ptolemy's event types provide a well-defined interface between object-oriented code and cross-cutting code. This in turn enables separate type-checking and compilation. Ptolemy also provides a novel and practical specification mechanism that we call translucid contracts. A translucid contracts allows developers to reason about the control effects of the object-oriented code and cross-cutting code modularly. This tutorial will proceed by discussing the goals of the Ptolemy programming language. We will then discuss Ptolemy's programming features and its specification features by way of several hands-on exercises. We will conclude with pointers to ongoing work on design, implementation and verification of Ptolemy programs.

关键词： modular reasoning aspect-oriented programming languages implicit invocation translucid contracts aspect-oriented interfaces Ptolemy

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共258页 << < 86 87 88 89 90 91 92 93 94 95 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：