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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

800 篇 会议
131 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

823 篇 工学
- 807 篇 软件工程
- 547 篇 计算机科学与技术...
- 22 篇 控制科学与工程
- 11 篇 信息与通信工程
- 7 篇 电气工程
- 5 篇 电子科学与技术（可...
- 4 篇 化学工程与技术
- 3 篇 机械工程
- 2 篇 材料科学与工程（可...
- 2 篇 建筑学
- 2 篇 交通运输工程
- 2 篇 安全科学与工程
- 1 篇 光学工程
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 纺织科学与工程
102 篇 理学
- 88 篇 数学
- 10 篇 系统科学
- 8 篇 统计学（可授理学、...
- 4 篇 化学
- 2 篇 物理学
- 2 篇 生物学
- 1 篇 地质学
53 篇 管理学
- 35 篇 管理科学与工程(可...
- 21 篇 工商管理
- 21 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
4 篇 教育学
- 4 篇 教育学
3 篇 法学
- 3 篇 社会学

主题

166 篇 design
155 篇 languages
96 篇 performance
74 篇 computer program...
56 篇 algorithms
45 篇 experimentation
42 篇 computer program...
39 篇 verification
36 篇 reliability
34 篇 object oriented ...
27 篇 java programming...
26 篇 functional progr...
25 篇 program synthesi...
24 篇 probabilistic pr...
22 篇 java
19 篇 domain-specific ...
19 篇 theory
19 篇 concurrency
17 篇 compilers
17 篇 type systems

机构

15 篇 carnegie mellon ...
13 篇 princeton univ p...
11 篇 univ texas austi...
10 篇 univ michigan an...
10 篇 rice univ housto...
10 篇 purdue univ w la...
10 篇 univ washington ...
10 篇 univ calif berke...
9 篇 univ wisconsin m...
9 篇 harvard univ cam...
9 篇 univ penn philad...
9 篇 stanford univ st...
8 篇 yale univ new ha...
8 篇 cornell univ ith...
8 篇 univ chicago il ...
7 篇 mit cambridge ma...
7 篇 northeastern uni...
7 篇 microsoft resear...
6 篇 microsoft res re...
6 篇 microsoft res re...

作者

11 篇 walker david
10 篇 dillig isil
9 篇 chlipala adam
8 篇 solar-lezama arm...
8 篇 chaudhuri swarat
7 篇 august david i.
7 篇 shao zhong
7 篇 gulwani sumit
7 篇 sarkar vivek
6 篇 wang xinyu
6 篇 grossman dan
6 篇 adl-tabatabai al...
6 篇 aiken alex
6 篇 foster nate
6 篇 bacon david f.
6 篇 myers andrew c.
6 篇 mezini mira
6 篇 mahlke scott
6 篇 bodik rastislav
5 篇 mckinley kathryn...

语言

852 篇 英文
78 篇 其他
1 篇 中文

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

共 931 条记录，以下是271-280 订阅

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

详细简洁

排序：

To-Many or To-One? All-in-One! Efficient Purely Functional Multi-maps with Type-Heterogeneous Hash-Tries 2018

To-Many or To-One? All-in-One! Efficient Purely Functional M...

引用

39th acm sigplan conference on programming language design and implementation (PLDI)

作者： Steindorfer, Michael J. Vinju, Jurgen J. Delft Univ Technol Delft Netherlands Ctr Wiskunde & Informat Amsterdam Netherlands TU Eindhoven Eindhoven Netherlands

ISBN: (纸本)9781450356985

An immutable multi-map is a many-to-many map data structure with expected fast insert and lookup operations. This data structure is used for applications processing graphs or many-to-many relations as applied in compilers, runtimes of programming languages, or in static analysis of object-oriented systems. Collection data structures are assumed to carefully balance execution time of operations with memory consumption characteristics and need to scale gracefully from a few elements to multiple gigabytes at least. When processing larger in-memory data sets the overhead of the data structure encoding itself becomes a memory usage bottleneck, dominating the overall performance. In this paper we propose AXIOM, a novel hash-trie data structure that allows for a highly efficient and type-safe multi-map encoding by distinguishing inlined values of singleton sets from nested sets of multi-mappings. AXIOM strictly generalizes over previous hash-trie data structures by supporting the processing of fine-grained type-heterogeneous content on the implementation level (while API and language support for type-heterogeneity are not scope of this paper). We detail the design and optimizations of AXIOM and further compare it against state-of-the-art immutable maps and multi-maps in Java, Scala and Clojure. We isolate key differences using microbenchmarks and validate the resulting conclusions on a case study in static analysis. AXIOM reduces the key-value storage overhead by 1.87 x;with specializing and inlining across collection boundaries it improves by 5.1 x.

关键词： Data structures persistent data structures functional programming hashtable multi-map many-to-many relation graph optimization performance JVM

来源：评论

学校读者我要写书评

暂无评论

Partial online cycle elimination in inclusion constraint graphs

Partial online cycle elimination in inclusion constraint gra...

引用

Proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Faehndrich, Manuel Foster, Jeffrey S. Su, Zhendong Aiken, Alexander Univ of California Berkeley Berkeley United States

Many program analyses are naturally formulated and implemented using inclusion constraints. We present new results on the scalable implementation of such analyses based on two insights: first, that online elimination of cyclic constraints yields orders-of-magnitude improvements in analysis time for large problems;second, that the choice of constraint representation affects the quality and efficiency of online cycle elimination. We present an analytical model that explains our design choices and show that the model's predictions match well with results from a substantial experiment.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

The undergraduate capstone software design experience

The undergraduate capstone software design experience

引用

1997 conference on TRI-Ada, TRI-Ada 1997

作者： Blair, Jean R. S. Ressler, Eugene K. Wagner, Thomas D. Department of Electrical Engineering and Computer Science United States Military Academy West PointNY10996 United States

ISBN: (纸本)0897919815

Ada 95 is being used as the implementation language for a senior level compiler design course at the United States Military Academy. This paper describes experiences and lessons learned as well as the scenario based approach for a large object oriented compiler project in that course. The term-long compiler project gives the students experience as a part of a (fictitious) design- implementation team building a production compiler. Ada 95 is compared to Pascal and C++ for the same course and positive and negative aspects of the three languages are described. © 1997 acm.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Stride prefetching by dynamically inspecting objects

Stride prefetching by dynamically inspecting objects

引用

conference on programming language design and implementation

作者： Inagaki, T Onodera, T Komatsu, H Nakatani, T IBM Japan Ltd Tokyo Res Lab Yamato Kanagawa 2428502 Japan

Software prefetching is a promising technique to hide cache miss latencies, but it remains challenging to effectively prefetch pointer-based data structures because obtaining the memory address to be prefetched requires pointer dereferences. The recently proposed stride prefetching overcomes this problem, but it only exploits inter-iteration stride patterns and relies on an off-line profiling method. We propose a new algorithm for stride prefetching which is intended for use in a dynamic compiler. We exploit both inter- and intra-iteration stride patterns, which we discover using an ultra-lightweight profiling technique, called object inspection. This is a kind of partial interpretation that only a dynamic compiler can perform. During the compilation of a method, the dynamic compiler gathers the profile information by partially interpreting the method using the actual values of parameters and causing no side effects. We evaluated an implementation of our prefetching algorithm in a production-level Java just-in-time compiler. The results show that the algorithm achieved up to an 18.9% and 25.1% speedup in industry-standard benchmarks on the Pentium 4 and the Athlon MP, respectively, while it increased the compilation time by less than 3.0%.

关键词： algorithm design experimentation performance Java just-in-time compiler object-inspection stride prefetching

来源：评论

学校读者我要写书评

暂无评论

JavaGI in the Battlefield: Practical Experience with Generalized Interfaces 09

JavaGI in the Battlefield: Practical Experience with General...

引用

8th International conference on Generative programming and Component Engineering

作者： Wehr, Stefan Thiemann, Peter Univ Freiburg D-7800 Freiburg Germany

ISBN: (纸本)9781605584942

Generalized interfaces are an extension of the interface concept found in object-oriented languages such as Java or C#. The extension is inspired by Haskell's type classes. It supports retroactive and type-conditional interface implementations, binary methods, symmetric multimethods, interfaces over families of types, and static interface methods. This article reports practical experience with generalized interfaces as implemented in the JavaGI language. Several real-world case studies demonstrate how generalized interfaces provide solutions to extension and integration problems with components in binary form, how they make certain design patterns redundant, and how they eliminate various run-time errors. In each case study, the use of JavaGI results in elegant and highly readable code. Furthermore, the article discusses the implementation of a compiler and a run-time system for JavaGI. Benchmarks show that our implementation offers acceptable performance.

关键词： design Experimentation languages JavaGI retroactive interface implementation external methods multimethods case studies

来源：评论

学校读者我要写书评

暂无评论

Inferable Object-Oriented Typed Assembly language 10

Inferable Object-Oriented Typed Assembly Language

引用

acm sigplan conference on programming language design and implementation

作者： Tate, Ross Chen, Juan Hawblitzel, Chris Univ Calif San Diego San Diego CA 92103 USA

ISBN: (纸本)9781450300193

A certifying compiler preserves type information through compilation to assembly language programs, producing typed assembly language (TAL) programs that can be verified for safety independently so that the compiler does not need to be trusted. There are two challenges for adopting certifying compilation in practice. First, requiring every compiler transformation and optimization to preserve types is a large burden on compilers, especially when adopting certifying compilation into existing optimizing non-certifying compilers. Second, type annotations significantly increase the size of assembly language programs. This paper proposes an alternative to traditional certifying compilers. It presents iTalX, the first inferable TAL type system that supports existential types, arrays, interfaces, and stacks. We have proved our inference algorithm is complete, meaning if an assembly language program is typeable with iTaIX then our algorithm will infer an iTaIX typing for that program. Furthermore, our algorithm is guaranteed to terminate even if the assembly language program is untypeable. We demonstrate that it is practical to infer such an expressive TAL by showing a prototype implementation of type inference for code compiled by Bartok, an optimizing C# compiler. Our prototype implementation infers complete type annotations for 98% of functions in a suite of realistic C# benchmarks. The type-inference time is about 8% of the compilation time. We needed to change only 2.5% of the compiler code, mostly adding new code for defining types and for writing types to object files. Most transformations are untouched. Type-annotation size is only 17% of the size of pure code and data, reducing type annotations in our previous certifying compiler [4] by 60%. The compiler needs to preserve only essential type information such as method signatures, object-layout information, and types for static data and external labels. Even non-certifying compilers have most of this information avai

关键词： Type inference Typed assembly language (TAL) Object-oriented compiler Existential quantification Certifying compiler

来源：评论

学校读者我要写书评

暂无评论

A General Path-Based Representation for Predicting Program Properties 2018

A General Path-Based Representation for Predicting Program P...

引用

39th acm sigplan conference on programming language design and implementation (PLDI)

作者： Alon, Uri Zilberstein, Meital Levy, Omer Yahav, Eran Technion Haifa Israel Univ Washington Seattle WA 98195 USA

ISBN: (纸本)9781450356985

Predicting program properties such as names or expression types has a wide range of applications. It can ease the task of programming, and increase programmer productivity. A major challenge when learning from programs is how to represent programs in a way that facilitates effective learning. We present a general path-based representation for learning from programs. Our representation is purely syntactic and extracted automatically. The main idea is to represent a program using paths in its abstract syntax tree (AST). This allows a learning model to leverage the structured nature of code rather than treating it as a flat sequence of tokens. We showthat this representation is general and can: (i) cover different prediction tasks, (ii) drive different learning algorithms (for both generative and discriminative models), and (iii) work across different programming languages. We evaluate our approach on the tasks of predicting variable names, method names, and full types. We use our representation to drive both CRF-based and word2vec-based learning, for programs of four languages: JavaScript, Java, Python and C#. Our evaluation shows that our approach obtains better results than task-specific handcrafted representations across different tasks and programming languages.

关键词： programming languages Big Code Machine Learning Learning Representations

来源：评论

学校读者我要写书评

暂无评论

Green: A Framework for Supporting Energy-Conscious programming using Controlled Approximation 10

Green: A Framework for Supporting Energy-Conscious Programmi...

引用

acm sigplan conference on programming language design and implementation

作者： Baek, Woongki Chilimbi, Trishul M. Stanford Univ Comp Syst Lab Stanford CA 94305 USA Microsoft Res Redmond WA 98052 USA

ISBN: (纸本)9781450300193

Energy-efficient computing is important in several systems ranging from embedded devices to large scale data centers. Several application domains offer the opportunity to tradeoff quality of service/solution (QoS) for improvements in performance and reduction in energy consumption. Programmers sometimes take advantage of such opportunities, albeit in an ad-hoc manner and often without providing any QoS guarantees. We propose a system called Green that provides a simple and flexible framework that allows programmers to take advantage of such approximation opportunities in a systematic manner while providing statistical QoS guarantees. Green enables programmers to approximate expensive functions and loops and operates in two phases. In the calibration phase, it builds a model of the QoS loss produced by the approximation. This model is used in the operational phase to make approximation decisions based on the QoS constraints specified by the programmer. The operational phase also includes an adaptation function that occasionally monitors the runtime behavior and changes the approximation decisions and QoS model to provide strong statistical QoS guarantees. To evaluate the effectiveness of Green, we implemented our system and language extensions using the Phoenix compiler framework. Our experiments using benchmarks from domains such as graphics, machine learning, signal processing, and finance, and an in-production, real-world web search engine, indicate that Green can produce significant improvements in performance and energy consumption with small and controlled QoS degradation.

关键词： Performance Measurement languages designs Energy-Conscious programming Controlled Approximation

来源：评论

学校读者我要写书评

暂无评论

Concurrency Debugging with Differential Schedule Projections 15

Concurrency Debugging with Differential Schedule Projections

引用

36th acm sigplan conference on programming language design and implementation

作者： Machado, Nuno Lucia, Brandon Rodrigues, Luis Univ Lisbon Inst Super Tecn INESC ID P-1699 Lisbon Portugal Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9781450334686

We present Symbiosis: a concurrency debugging technique based on novel differential schedule projections (DSPs). A DSP shows the small set of memory operations and data-flows responsible for a failure, as well as a reordering of those elements that avoids the failure. To build a DSP, Symbiosis first generates a full, failing, multithreaded schedule via thread path profiling and symbolic constraint solving. Symbiosis selectively reorders events in the failing schedule to produce a non-failing, alternate schedule. A DSP reports the ordering and data-flow differences between the failing and non-failing schedules. Our evaluation on buggy real-world software and benchmarks shows that, in practical time, Symbiosis generates DSPs that both isolate the small fraction of event orders and data-flows responsible for the failure, and show which event reorderings prevent failing. In our experiments, DSPs contain 81% fewer events and 96% fewer data-flows than the full failure-inducing schedules. Moreover, by allowing developers to focus on only a few events, DSPs reduce the amount of time required to find a valid fix.

关键词： Algorithms design Reliability Concurrency Debugging Symbolic Execution Constraint Solving Differential Schedule Projection

来源：评论

学校读者我要写书评

暂无评论

Test-Driven Synthesis 14

Test-Driven Synthesis

引用

35th acm sigplan conference on programming language design and implementation (PLDI)

作者： Perelman, Daniel Gulwani, Sumit Grossman, Dan Provost, Peter Univ Washington Seattle WA 98195 USA Microsoft Corp Mountain View CA USA

ISBN: (纸本)9781450327848

programming-by-example technologies empower end-users to create simple programs merely by providing input/output examples. Existing systems are designed around solvers specialized for a specific set of data types or domain-specific language (DSL). We present a program synthesizer which can be parameterized by an arbitrary DSL that may contain conditionals and loops and therefore is able to synthesize programs in any domain. In order to use our synthesizer, the user provides a sequence of increasingly sophisticated input/output examples along with an expert-written DSL definition. These two inputs correspond to the two key ideas that allow our synthesizer to work in arbitrary domains. First, we developed a novel iterative synthesis technique inspired by test-driven development-which also gives our technique the name of test-driven synthesis-where the input/output examples are consumed one at a time as the program is refined. Second, the DSL allows our system to take an efficient component-based approach to enumerating possible programs. We present applications of our synthesis methodology to end-user programming for transformations over strings, XML, and table layouts. We compare our synthesizer on these applications to state-of-the-art DSL-specific synthesizers as well to the general purpose synthesizer Sketch.

关键词： languages Experimentation program synthesis end-user programming test driven development

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共94页 << < 24 25 26 27 28 29 30 31 32 33 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：