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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

515 篇 会议
52 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

524 篇 工学
- 521 篇 软件工程
- 325 篇 计算机科学与技术...
- 25 篇 控制科学与工程
- 7 篇 信息与通信工程
- 3 篇 电子科学与技术（可...
- 3 篇 化学工程与技术
- 2 篇 安全科学与工程
- 1 篇 动力工程及工程热...
- 1 篇 电气工程
- 1 篇 生物医学工程（可授...
80 篇 理学
- 73 篇 数学
- 7 篇 统计学（可授理学、...
- 5 篇 系统科学
- 3 篇 化学
- 1 篇 物理学
- 1 篇 地质学
- 1 篇 生物学
36 篇 管理学
- 23 篇 管理科学与工程(可...
- 18 篇 工商管理
- 16 篇 图书情报与档案管...
3 篇 经济学
- 3 篇 应用经济学
2 篇 法学
- 2 篇 社会学
2 篇 教育学
- 2 篇 教育学

主题

87 篇 design
74 篇 languages
66 篇 performance
50 篇 computer program...
38 篇 algorithms
37 篇 computer program...
31 篇 experimentation
24 篇 reliability
24 篇 verification
23 篇 program synthesi...
22 篇 probabilistic pr...
19 篇 java programming...
17 篇 object oriented ...
15 篇 functional progr...
12 篇 c (programming l...
11 篇 computer systems...
11 篇 static analysis
11 篇 language
11 篇 measurement
11 篇 programming lang...

机构

12 篇 carnegie mellon ...
9 篇 univ michigan an...
9 篇 univ wisconsin m...
9 篇 princeton univ p...
8 篇 univ penn philad...
8 篇 purdue univ w la...
8 篇 stanford univ st...
8 篇 univ washington ...
8 篇 univ texas austi...
7 篇 mit cambridge ma...
6 篇 microsoft res re...
6 篇 swiss fed inst t...
6 篇 yale univ new ha...
6 篇 harvard univ cam...
6 篇 cornell univ ith...
5 篇 ibm research
5 篇 microsoft resear...
4 篇 carnegie mellon ...
4 篇 microsoft res re...
4 篇 univ calif davis...

作者

7 篇 dillig isil
6 篇 august david i.
6 篇 gulwani sumit
5 篇 grossman dan
5 篇 aiken alex
5 篇 vechev martin
5 篇 bacon david f.
5 篇 su zhendong
5 篇 lam monica s.
5 篇 chlipala adam
5 篇 myers andrew c.
5 篇 walker david
5 篇 mansinghka vikas...
4 篇 mckinley kathryn...
4 篇 wang xinyu
4 篇 nakatani t
4 篇 cheng perry
4 篇 adl-tabatabai al...
4 篇 gehr timon
4 篇 lueh guei-yuan

语言

548 篇 英文
19 篇 其他

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

共 567 条记录，以下是311-320 订阅

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

详细简洁

排序：

Exocompilation for Productive programming of Hardware Accelerators 2022

Exocompilation for Productive Programming of Hardware Accele...

引用

43rd acm sigplan International conference on programming language design and implementation (pldi)

作者： Ikarashi, Yuka Bernstein, Gilbert Louis Reinking, Alex Genc, Hasan Ragan-Kelley, Jonathan MIT CSAIL Cambridge MA 02139 USA Univ Calif Berkeley Berkeley CA USA

ISBN: (纸本)9781450392655

High-performance kernel libraries are critical to exploiting accelerators and specialized instructions in many applications. Because compilers are difficult to extend to support diverse and rapidly-evolving hardware targets, and automatic optimization is often insufficient to guarantee state-of-the-art performance, these libraries are commonly still coded and optimized by hand, at great expense, in low-level C and assembly. To better support development of high-performance libraries for specialized hardware, we propose a new programming language, Exo, based on the principle of exocompilation: externalizing target-specific code generation support and optimization policies to user-level code. Exo allows custom hardware instructions, specialized memories, and accelerator configuration state to be defined in user libraries. It builds on the idea of user scheduling to externalize hardware mapping and optimization decisions. Schedules are defined as composable rewrites within the language, and we develop a set of effect analyses which guarantee program equivalence and memory safety through these transformations. We show that Exo enables rapid development of state-of-the-art matrix-matrix multiply and convolutional neural network kernels, for both an embedded neural accelerator and x86 with AVX-512 extensions, in a few dozen lines of code each.

关键词： program optimization hardware accelerators user-schedulable languages instruction abstraction scheduling user-extensible backend & scheduling

来源：评论

学校读者我要写书评

暂无评论

SPL^LIFT - Statically Analyzing Software Product Lines in Minutes Instead of Years 13

SPL<SUP>LIFT</SUP> - Statically Analyzing Software Product L...

引用

34th acm sigplan conference on programming language design and implementation (pldi)

作者： Bodden, Eric Toledo, Tarsis Ribeiro, Marcio Brabrand, Claus Borba, Paulo Mezini, Mira Tech Univ Darmstadt EC SPRIDE Darmstadt Germany IT Univ Copenhagen Copenhagen Denmark Univ Fed Pernambuco Recife PE Brazil Univ Fed Alagoas Maceio Brazil

ISBN: (纸本)9781450320146

A software product line (SPL) encodes a potentially large variety of software products as variants of some common code base. Up until now, re-using traditional static analyses for SPLs was virtually intractable, as it required programmers to generate and analyze all products individually. In this work, however, we show how an important class of existing inter-procedural static analyses can be transparently lifted to SPLs. Without requiring programmers to change a single line of code, our approach SPLLIFT automatically converts any analysis formulated for traditional programs within the popular IFDS framework for inter-procedural, finite, distributive, subset problems to an SPL-aware analysis formulated in the IDE framework, a well-known extension to IFDS. Using a full implementation based on Heros, Soot, CIDE and JavaBDD, we show that with SPLLIFT one can reuse IFDS-based analyses without changing a single line of code. Through experiments using three static analyses applied to four Java-based product lines, we were able to show that our approach produces correct results and outperforms the traditional approach by several orders of magnitude.

关键词： Software product lines inter-procedural static analysis context sensitive flow sensitive design languages Performance

来源：评论

学校读者我要写书评

暂无评论

Profile-directed optimization of event-based programs 02

Profile-directed optimization of event-based programs

引用

Proceedings of the acm sigplan 2002 conference on programming language design and implementation (pldi'02)

作者： Rajagopalan, Mohan Debray, Saumya K. Hiltunen, Matti A. Schlichting, Richard D. Department of Computer Science University of Arizona Tucson AZ 85721 United States

ISBN: (纸本)9781581134636

Events are used as a fundamental abstraction in programs ranging from graphical user interfaces (GUIs) to systems for building customized network protocols. While providing a flexible structuring and execution paradigm, events have the potentially serious drawback of extra execution overhead due to the indirection between modules that raise events and those that handle them. This paper describes an approach to addressing this issue using static optimization techniques. This approach, which exploits the underlying predictability often exhibited by event-based programs, is based on first profiling the program to identify commonly occurring event sequences. A variety of techniques that use the resulting profile information are then applied to the program to reduce the overheads associated with such mechanisms as indirect function calls and argument marshaling. In addition to describing the overall approach, experimental results are given that demonstrate the effectiveness of the techniques. These results are from event-based programs written for X Windows, a system for building GUIs, and Cactus, a system for constructing highly configurable distributed services and network protocols.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

GreenWeb: language Extensions for Energy-Efficient Mobile Web Computing 16

GreenWeb: Language Extensions for Energy-Efficient Mobile We...

引用

37th acm sigplan conference on programming language design and implementation

作者： Zhu, Yuhao Reddi, Vijay Janapa Univ Texas Austin Dept Elect & Comp Engn Austin TX 78712 USA

ISBN: (纸本)9781450342612

Web computing is gradually shifting toward mobile devices, in which the energy budget is severely constrained. As a result, Web developers must be conscious of energy efficiency. However, current Web languages provide developers little control over energy consumption. In this paper, we take a first step toward language-level research to enable energy-efficient Web computing. Our key motivation is that mobile systems can wisely budget energy usage if informed with user quality-of-service (QoS) constraints. To do this, programmers need new abstractions. We propose two language abstractions, QoS type and QoS target, to capture two fundamental aspects of user QoS experience. We then present Green Web, a set of language extensions that empower developers to easily express the QoS abstractions as program annotations. As a proof of concept, we develop a GreenWeb runtime, which intelligently determines how to deliver specified user QoS expectation while minimizing energy consumption. Overall, GreenWeb shows significant energy savings (29.2% similar to 66.0%) over Android's default Interactive governor with few QoS violations. Our work demonstrates a promising first step toward language innovations for energy-efficient Web computing.

关键词： Energy-efficiency Web Mobile computing

来源：评论

学校读者我要写书评

暂无评论

FlumeJava: Easy, Efficient Data-Parallel Pipelines 10

FlumeJava: Easy, Efficient Data-Parallel Pipelines

引用

acm sigplan conference on programming language design and implementation

作者： Chambers, Craig Raniwala, Ashish Perry, Frances Adams, Stephen Henry, Robert R. Bradshaw, Robert Weizenbaum, Nathan Google Seattle WA USA

ISBN: (纸本)9781450300193

MapReduce and similar systems significantly ease the task of writing data-parallel code. However, many real-world computations require a pipeline of Map Reduces, and programming and managing such pipelines can be difficult. We present Flume Java, a Java library that makes it easy to develop, test, and run efficient data-parallel pipelines. At the core of the Flume Java library are a couple of classes that represent immutable parallel collections, each supporting a modest number of operations for processing them in parallel. Parallel collections and their operations present a simple, high-level, uniform abstraction over different data representations and execution strategies. To enable parallel operations to run efficiently, Flume Java defers their evaluation, instead internally constructing an execution plan dataflow graph. When the final results of the parallel operations are eventually needed, Flume Java first optimizes the execution plan, and then executes the optimized operations on appropriate underlying primitives (e.g., Map Reduces). The combination of high-level abstractions for parallel data and computation, deferred evaluation and optimization, and efficient parallel primitives yields an easy-to-use system that approaches the efficiency of hand-optimized pipelines. Flume Java is in active use by hundreds of pipeline developers within Google.

关键词： data-parallel programming MapReduce Java

来源：评论

学校读者我要写书评

暂无评论

RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types 2021

RefinedC: Automating the Foundational Verification of C Code...

引用

42nd acm sigplan International conference on programming language design and implementation (pldi)

作者： Sammler, Michael Lepigre, Rodolphe Krebbers, Robbert Memarian, Kayvan Dreyer, Derek Garg, Deepak MPI SWS Saarbrucken Germany Radboud Univ Nijmegen Nijmegen Netherlands Univ Cambridge Cambridge England

ISBN: (纸本)9781450383912

Given the central role that C continues to play in systems software, and the difficulty of writing safe and correct C code, it remains a grand challenge to develop effective formal methods for verifying C programs. In this paper, we propose a new approach to this problem: a type system we call RefinedC, which combines ownership types (for modular reasoning about shared state and concurrency) with refinement types (for encoding precise invariants on C data types and Hoare-style specifications for C functions). RefinedC is both automated (requiring minimal user intervention) and foundational (producing a proof of program correctness in Coq), while at the same time handling a range of low-level programming idioms such as pointer arithmetic. In particular, following the approach of RustBelt, the soundness of the RefinedC type system is justified semantically by interpretation into the Coq-based Iris framework for higherorder concurrent separation logic. However, the typing rules of RefinedC are also designed to be encodable in a new "separation logic programmingz language we call Lithium. By restricting to a carefully chosen (yet expressive) fragment of separation logic, Lithium supports predictable, automatic, goal-directed proof search without backtracking. We demonstrate the effectiveness of RefinedC on a range of representative examples of C code.

关键词： C programming language separation logic ownership types refinement types proof automation Iris Coq

来源：评论

学校读者我要写书评

暂无评论

Linear analysis and optimization of stream programs 03

引用

conference on programming language design and implementation

作者： Lamb, AA Thies, W Amarasinghe, S MIT Comp Sci Lab Cambridge MA 02139 USA

ISBN: (纸本)9781581136623

As more complex DSP algorithms are realized in practice, there is an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this end, we present a set of aggressive optimizations that target linear sections of a stream program. Our input language is StreamIt, which represents programs as a hierarchical graph of autonomous filters. A filter is linear if each of its outputs can be represented as an affine combination of its inputs. Linearity is common in DSP components;examples include FIR filters, expanders, compressors, FFTs and DCTs. We demonstrate that several algorithmic transformations, traditionally hand-tuned by DSP experts, can be completely automated by the compiler. First, we present a linear extraction analysis that automatically detects linear filters from the C-like code in their work function. Then, we give a procedure for combining adjacent linear filters into a single filter, as well as for translating a linear filter to operate in the frequency domain. We also present an optimization selection algorithm, which finds the sequence of combination and frequency transformations that will give the maximal benefit. We have completed a fully-automatic implementation of the above techniques as part of the StreamIt compiler, and we demonstrate a 450% performance improvement over our benchmark suite.

关键词： stream programming streamIt optimization embedded linear systems algebraic simplification DSP FFT

来源：评论

学校读者我要写书评

暂无评论

Occurrence Typing Modulo Theories 16

Occurrence Typing Modulo Theories

引用

37th acm sigplan conference on programming language design and implementation

作者： Kent, Andrew M. Kempe, David Tobin-Hochstadt, Sam Indiana Univ Bloomington IN 47405 USA

ISBN: (纸本)9781450342612

We present a new type system combining occurrence typing- a technique previously used to type check programs in dynamically-typed languages such as Racket, Clojure, and JavaScript-with dependent refinement types. We demonstrate that the addition of refinement types allows the integration of arbitrary solver-backed reasoning about logical propositions from external theories. By building on occurrence typing, we can add our enriched type system as a natural extension of Typed Racket, reusing its core while increasing its expressiveness. The result is a well-tested type system with a conservative, decidable core in which types may depend on a small but extensible set of program terms. In addition to describing our design, we present the following: a formal model and proof of correctness;a strategy for integrating new theories, with specific examples including linear arithmetic and bitvectors;and an evaluation in the context of the full Typed Racket implementation. Specifically, we take safe vector operations as a case study, examining all vector accesses in a 56,000 line corpus of Typed Racket programs. Our system is able to prove that 50% of these are safe with no new annotations, and with a few annotations and modifications we capture more than 70%.

关键词： languages design Verification Refinement types occurrence typing Racket

来源：评论

学校读者我要写书评

暂无评论

Fast code generation using automatically-generated decision trees 90

Fast code generation using automatically-generated decision ...

引用

Proceedings of the acm sigplan '90 conference on programming language design and implementation

作者： Wendt, Alan L. Colorado State Univ Fort Collins United States

ISBN: (纸本)0897913647

Several recent code generators [4,5,6,8] use dagrewriting rules to accomplish both code generation and peephole optimization, and they compile these rules into hard code to generate code quickly. The chop system [6], for example, runs twice as fast as both pcc and the GNU C compiler gcc on a Sun 3/50 system and generates comparable code. These figures are for entire compilers;the code generators themselves run about seven times faster than comparable code generators. This paper describes a new system, currently under development, that further increases the speed of automatically-generated retargetable code generation. It offers two principal advantages over its predecessors.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Visualization Question Answering using Introspective Program Synthesis 2022

Visualization Question Answering using Introspective Program...

引用

43rd acm sigplan International conference on programming language design and implementation (pldi)

作者： Chen, Yanju Yan, Xifeng Feng, Yu Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA

ISBN: (纸本)9781450392655

While data visualization plays a crucial role in gaining insights from data, generating answers over complex visualizations from natural language questions is far from an easy task. Mainstream approaches reduce data visualization queries to a semantic parsing problem, which either relies on expensive-to-annotate supervised training data that pairs natural language questions with logical forms, or weakly supervised models that incorporate a larger corpus but fail on long-tailed queries without explanations. This paper aims to answer data visualization queries by automatically synthesizing the corresponding program from natural language. At the core of our technique is an abstract synthesis engine that is bootstrapped by an off-the-shelf weakly supervised model and an optimal synthesis algorithm guided by triangle alignment constraints, which represent consistency among natural language, visualization, and the synthesized program. Starting with a few tentative answers obtained from an off-the-shelf statistical model, our approach first involves an abstract synthesizer that generates a set of sketches that are consistent with the answers. Then we design an instance of optimal synthesis to complete one of the candidate sketches by satisfying common type constraints and maximizing the consistency among three parties, i.e., natural language, the visualization, and the candidate program. We implement the proposed idea in a system called POE that can answer visualization queries from natural language. Our method is fully automated and does not require users to know the underlying schema of the visualizations. We evaluate POE on 629 visualization queries and our experiment shows that Poe outperforms state-of-the-arts by improving the accuracy from 44% to 59%.

关键词： Program Synthesis Visualization Machine Learning Natural language Processing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 28 29 30 31 32 33 34 35 36 37 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：