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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,277 篇 会议
296 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

2,280 篇 工学
- 2,149 篇 软件工程
- 1,702 篇 计算机科学与技术...
- 86 篇 控制科学与工程
- 57 篇 信息与通信工程
- 55 篇 电气工程
- 22 篇 电子科学与技术（可...
- 17 篇 机械工程
- 13 篇 材料科学与工程（可...
- 13 篇 建筑学
- 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
187 篇 computer program...
182 篇 performance
162 篇 object oriented ...
89 篇 algorithms
88 篇 java programming...
81 篇 experimentation
78 篇 functional progr...
71 篇 computer program...
71 篇 theory
65 篇 java
63 篇 verification
61 篇 reliability
48 篇 semantics
47 篇 software design
45 篇 domain-specific ...
38 篇 parallel program...
37 篇 concurrency
35 篇 measurement

机构

25 篇 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 篇 van der storm ti...
10 篇 de moor oege
10 篇 dillig isil
9 篇 lumsdaine a

语言

2,356 篇 英文
214 篇 其他
4 篇 中文
1 篇 葡萄牙文

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

共 2575 条记录，以下是531-540 订阅

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

详细简洁

排序：

Compiling a Reflective language using MetaOCaml 2014

Compiling a Reflective Language using MetaOCaml

引用

13th conference on Generative programming - Concepts and Experiences (GPCE)

作者： Asai, Kenichi Ochanomizu Univ Bunkyo Ku Tokyo 1128610 Japan

ISBN: (纸本)9781450331616

A reflective language makes the language semantics open to user programs and allows them to access, extend, and modify it from within the same language framework. Because of its high flexibility and expressiveness, it can be an ideal platform for programming language research as well as practical applications in dynamic environments. However, efficient implementation of a reflective language is extremely difficult. Under the circumstance where the language semantics can change, a partial evaluator is required for compilation. This paper reports on the experience of using MetaOCaml as a compiler for a reflective language. With staging annotations, MetaOCaml achieves the same effect as using a partial evaluator. Unlike the standard partial evaluator, the run mechanism of MetaOCaml enables us to use the specialized (compiled) code in the current runtime environment. On the other hand, the lack of a binding-time analysis in MetaOCaml prohibits us from compiling a user program under modified compiled semantics.

关键词： languages Reflection metacircular interpreter partial evaluation binding-time analysis staging MetaOCaml

来源：评论

学校读者我要写书评

暂无评论

Beyond the PDP-11: Architectural support for a memory-safe C abstract machine 15

Beyond the PDP-11: Architectural support for a memory-safe C...

引用

20th International conference on Architectural Support for programming languages and Operating Systems (ASPLOS)

作者： Chisnall, David Rothwell, Colin Watson, Robert N. M. Woodruff, Jonathan Vadera, Munraj Moore, Simon W. Roe, Michael Davis, Brooks Neumann, Peter G. Univ Cambridge Cambridge CB2 1TN England SRI Int Princeton NJ USA

ISBN: (纸本)9781450328357

We propose a new memory-safe interpretation of the C abstract machine that provides stronger protection to benefit security and debugging. Despite ambiguities in the specification intended to provide implementation flexibility, contemporary implementations of C have converged on a memory model similar to the PDP-11, the original target for C. This model lacks support for memory safety despite well-documented impacts on security and reliability. Attempts to change this model are often hampered by assumptions embedded in a large body of existing C code, dating back to the memory model exposed by the original C compiler for the PDP-11. Our experience with attempting to implement a memory-safe variant of C on the CHERI experimental microprocessor led us to identify a number of problematic idioms. We describe these as well as their interaction with existing memory safety schemes and the assumptions that they make beyond the requirements of the C specification. Finally, we refine the CHERI ISA and abstract model for C, by combining elements of the CHERI capability model and fat pointers, and present a softcore CPU that implements a C abstract machine that can run legacy C code with strong memory protection guarantees.

关键词： capabilities processor design compilers memory protection C language security memory safety bounds checking

来源：评论

学校读者我要写书评

暂无评论

From network interface to multithreaded web applications : A case study in modular program verification 15

From network interface to multithreaded web applications : A...

引用

42nd Annual acm sigplan-SIGACT Symposium on Principles of programming languages, POPL 2015

作者： Chlipala, Adam MIT CSAIL United States

ISBN: (纸本)9781450333009

Many verifications of realistic software systems are monolithic, in the sense that they define single global invariants over complete system state. More modular proof techniques promise to support reuse of component proofs and even reduce the effort required to verify one concrete system, just as modularity simplifies standard software development. This paper reports on one case study applying modular proof techniques in the Coq proof assistant. To our knowledge, it is the first modular verification certifying a system that combines infrastructure with an application of interest to end users. We assume a nonblocking API for managing TCP networking streams, and on top of that we work our way up to certifying multithreaded, database-backed Web applications. Key verified components include a cooperative threading library and an implementation of a domain-specific language for XML processing. We have deployed our case-study system on mobile robots, where it interfaces with off-the-shelf components for sensing, actuation, and control. Copyright © 2015 by the Association for Computing Machinery, Inc. (acm).

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Asymmetric Memory Fences: Optimizing Both Performance and Implementability 15

Asymmetric Memory Fences: Optimizing Both Performance and Im...

引用

20th International conference on Architectural Support for programming languages and Operating Systems (ASPLOS)

作者： Duan, Yuelu Honarmand, Nima Torrellas, Josep Univ Illinois Urbana IL USA

ISBN: (纸本)9781450328357

There have been several recent efforts to improve the performance of fences. The most aggressive designs allow post-fence accesses to retire and complete before the fence completes. Unfortunately, such designs present implementation difficulties due to their reliance on global state and structures. This paper's goal is to optimize both the performance and the implementability of fences. We start-off with a design like the most aggressive ones but without the global state. We call it Weak Fence or wF. Since the concurrent execution of multiple wFs can deadlock, we combine wFs with a conventional fence (i.e., Strong Fence or sF) for the less performance-critical thread(s). We call the result an Asymmetric fence group. We also propose a taxonomy of Asymmetric fence groups under TSO. Compared to past aggressive fences, Asymmetric fence groups both are substantially easier to implement and have higher average performance. The two main designs presented (WS+ and W+) speed-up workloads under TSO by an average of 13% and 21%, respectively, over conventional fences.

关键词： Fences Sequential Consistency Synchronization Parallel programming Shared-Memory Machines

来源：评论

学校读者我要写书评

暂无评论

Disjointness Domains for Fine-Grained Aliasing 2015

Disjointness Domains for Fine-Grained Aliasing

引用

acm sigplan International conference on Object-Oriented programming, Systems, languages, and Applications (OOPSLA)

作者： Brandauer, Stephan Clarke, Dave Wrigstad, Tobias Uppsala Univ Uppsala Sweden

ISBN: (纸本)9781450336895

Aliasing is crucial for supporting useful implementation patterns, but it makes reasoning about programs difficult. To deal with this problem, numerous type-based aliasing control mechanisms have been proposed, expressing properties such as uniqueness. Uniqueness, however, is black-and-white: either a reference is unique or it can be arbitrarily aliased;and global: excluding aliases throughout the entire system, making code brittle to changing requirements. Disjointness domains, a new approach to alias control, address this problem by enabling more graduations between uniqueness and arbitrary reference sharing. They allow expressing aliasing constraints local to a certain set of variables (either stack variables or fields) for instance that no aliasing occurs between variables within some set of variables but between such sets or the opposite, that aliasing occurs within that set but not between different sets. A hierarchy of disjointness domains controls the flow of references through a program, helping the programmer reason about disjointness and enforce local alias invariants. The resulting system supports fine-grained control of aliasing between both variables and objects, making aliasing explicit to programmers, compilers, and tooling. This paper presents a formal account of disjointness domains along with examples. Disjointness domains provide novel means of expressing may-alias kinds of constraints, which may prove useful in compiler optimisation and verification.

关键词： design Theory Aliasing mutable state type systems uniqueness linear types

来源：评论

学校读者我要写书评

暂无评论

Reduced Hardware NOrec: A Safe and Scalable Hybrid Transactional Memory 15

Reduced Hardware NOrec: A Safe and Scalable Hybrid Transacti...

引用

20th International conference on Architectural Support for programming languages and Operating Systems (ASPLOS)

作者： Matveev, Alexander Shavit, Nir MIT Cambridge MA 02139 USA

ISBN: (纸本)9781450328357

Because of hardware TM limitations, software fallbacks are the only way to make TM algorithms guarantee progress. Nevertheless, all known software fallbacks to date, from simple locks to sophisticated versions of the NOrec Hybrid TM algorithm, have either limited scalability or weakened semantics. We propose a novel reduced-hardware (RH) version of the NOrec HyTM algorithm. Instead of an all-software slow path, in our RH NOrec the slow-path is a "mix" of hardware and software: one short hardware transaction executes a maximal amount of initial reads in the hardware, and the second executes all of the writes. This novel combination of the RH approach and the NOrec algorithm delivers the first Hybrid TM that scales while fully preserving the hardware's original semantics of opacity and privatization. Our GCC implementation of RH NOrec is promising in that it shows improved performance relative to all prior methods, at the concurrency levels we could test today.

关键词： Algorithms design Transactional Memory

来源：评论

学校读者我要写书评

暂无评论

A Domain-Specific language for Building Self-Optimizing AST Interpreters 2014

A Domain-Specific Language for Building Self-Optimizing AST ...

引用

13th conference on Generative programming - Concepts and Experiences (GPCE)

作者： Humer, Christian Wimmer, Christian Wirth, Christian Woess, Andreas Wuerthinger, Thomas Johannes Kepler Univ Linz Inst Syst Software Linz Austria Oracle Labs Redwood Shores CA USA

ISBN: (纸本)9781450331616

Self-optimizing AST interpreters dynamically adapt to the provided input for faster execution. This adaptation includes initial tests of the input, changes to AST nodes, and insertion of guards that ensure assumptions still hold. Such specialization and speculation is essential for the performance of dynamic programming languages such as JavaScript. In traditional procedural and object-oriented programming languages it can be tedious to write self-optimizing AST interpreters, as those languages fail to provide constructs that would specifically support that. This paper introduces a declarative domain-specific language (DSL) that greatly simplifies writing self-optimizing AST interpreters. The DSL supports specialization of operations based on types of the input and other properties. It can then use these specializations directly or chain them to represent the operation with the minimum amount of code possible. The DSL significantly reduces the complexity of expressing specializations for those interpreters. We use it in our high-performance implementation of JavaScript, where 274 language operations have an average of about 4 and a maximum of 190 specializations. In addition, the DSL is used in implementations of Ruby, Python, R, and Smalltalk.

关键词： Algorithms languages Performance Java domain-specific languages dynamic languages language implementation self-optimizing programs

来源：评论

学校读者我要写书评

暂无评论

GOLD: A graph oriented language implemented using the eclipse xtext framework

GOLD: A graph oriented language implemented using the eclips...

引用

Eclipse Technology eXchange Workshop, ETX 2015

作者： Sotelo, Alejandro Takahashi, Silvia Systems and Computing Engineering Department Universidad de Los Andes Colombia

ISBN: (纸本)9781450339049

GOLD (Graph Oriented language) is a general purpose programming language with mathematical notations and a pseudocode-like syntax for defining and manipulating graphs and other high-level data structures such as sets, trees, and automata. Its syntax was inspired by the one used in classic algorithms textbooks. It allows set comprehensions, quantified expressions, and new control instructions. Its syntax also supports the use of Java defined classes. GOLD programs are translated into Java. Therefore, Java programs can use functions, procedures, and objects defined in GOLD. GOLD was developed as a whole new programming environment for programming and testing algorithms for advanced data structures. All GOLD components were packed into an Eclipse plug-in coded in Java under the Xtext framework. GOLD's design and implementation can be seen as a case study in language development. © 2015 acm.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Scriptable Operating Systems with Lua 10

Scriptable Operating Systems with Lua

引用

10th Symposium on Dynamic languages

作者： Neto, Lourival Vieira Ierusalimschy, Roberto de Moura, Ana Lucia Balmer, Marc NetBSD Fdn Paris France Pontificia Univ Catolica Rio de Janeiro Dept Informat Rio de Janeiro Brazil

ISBN: (纸本)9781450332118

Extensible operating system is a design based on the idea that operating systems can be adapted to meet user requirements by allowing user extensions. In a different scenario, that of application development, there is a paradigm that supports that complex systems should allow users to write scripts to tailor an application to their needs. In this paper we propose the concept of scriptable operating system, which applies scripting development paradigm to the concept of extensible operating systems. Scriptable operating systems support that operating systems can adequately provide extensibility by allowing users to script their kernel. We also present an implementation of a kernel-scripting environment that allows users to dynamically extend Linux and NetBSD operating systems using the scripting language Lua. To evaluate this environment, we extended both OS kernels to allow users to script CPU frequency scaling and network packet filtering using Lua.

关键词： scriptable operating system kernel scripting Lua programming language

来源：评论

学校读者我要写书评

暂无评论

language-independent storage strategies for tracing-JIT-based virtual machines 11

Language-independent storage strategies for tracing-JIT-base...

引用

11th Symposium on Dynamic languages, DLS 2015

作者： Pape, Tobias Felgentreff, Tim Hirschfeld, Robert Gulenko, Anton Bolz, Carl Friedrich Hasso Plattner Institute University of Potsdam Germany Technische Universität Berlin Germany King's College London United Kingdom

ISBN: (纸本)9781450336901

Storage strategies have been proposed as a run-time optimization for the PyPy Python implementation and have shown promising results for optimizing execution speed and memory requirements. However, it remained unclear whether the approach works equally well in other dynamic languages. Furthermore, while PyPy is based on RPython, a language to write VMs with reusable components such as a tracing just-in-time compiler and garbage collection, the strategies design itself was not generalized to be reusable across languages implemented using that same toolchain. In this paper, we present a general design and implementation for storage strategies and show how they can be reused across different RPython-based languages. We evaluate the performance of our implementation for RSqueak, an RPython-based VM for Squeak/Smalltalk and show that storage strategies may indeed offer performance benefits for certain workloads in other dynamic programming languages. We furthermore evaluate the generality of our implementation by applying it to Topaz, a Ruby VM, and Pycket, a Racket implementation.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共258页 << < 50 51 52 53 54 55 56 57 58 59 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：