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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

491 篇 会议
37 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

488 篇 工学
- 485 篇 软件工程
- 291 篇 计算机科学与技术...
- 22 篇 控制科学与工程
- 6 篇 信息与通信工程
- 4 篇 电子科学与技术（可...
- 3 篇 化学工程与技术
- 2 篇 安全科学与工程
- 1 篇 动力工程及工程热...
- 1 篇 电气工程
- 1 篇 航空宇航科学与技...
77 篇 理学
- 71 篇 数学
- 6 篇 统计学（可授理学、...
- 5 篇 系统科学
- 3 篇 化学
- 1 篇 物理学
- 1 篇 生物学
35 篇 管理学
- 25 篇 管理科学与工程(可...
- 20 篇 工商管理
- 13 篇 图书情报与档案管...
4 篇 经济学
- 4 篇 应用经济学
2 篇 法学
- 2 篇 社会学
2 篇 教育学
- 2 篇 教育学

主题

75 篇 design
66 篇 languages
65 篇 performance
43 篇 computer program...
38 篇 algorithms
36 篇 computer program...
31 篇 experimentation
24 篇 verification
23 篇 reliability
23 篇 program synthesi...
22 篇 probabilistic pr...
20 篇 java programming...
15 篇 functional progr...
13 篇 object oriented ...
12 篇 c (programming l...
11 篇 computer systems...
11 篇 static analysis
11 篇 measurement
11 篇 concurrency
10 篇 compilers

机构

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...
5 篇 univ calif berke...
4 篇 carnegie mellon ...
4 篇 microsoft res re...

作者

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

语言

526 篇 英文
2 篇 其他

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

共 528 条记录，以下是41-50 订阅

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

详细简洁

排序：

An experimental analysis of self-adjusting computation 06

An experimental analysis of self-adjusting computation

引用

acm sigplan conference on programming language design and implementation, pldi 2006 - PLAS 2006: 2006 programming languages and Analysis for Security Workshop

作者： Acar, Umut A. Blelloch, Guy E. Blume, Matthias Tangwongsan, Kanat Toyota Technological Institute Japan Carnegie Mellon University United States

ISBN: (纸本)1595933743

Dependence graphs and memoization can be used to efficiently update the output of a program as the input changes dynamically. Recent work has studied techniques for combining these approaches to effectively dynamize a wide range of applications. Toward this end various theoretical results were given. In this paper we describe the implementation of a library based on these ideas, and present experimental results on the efficiency of this library on a variety of applications. The results of the experiments indicate that the approach is effective in practice, often requiring orders of magnitude less time than recomputing the output from scratch. We believe this is the first experimental evidence that incremental computation of any type is effective in practice for a reasonably broad set of applications. Copyright © 2006 acm.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

FunTAL: Reasonably Mixing a Functional language with Assembly 2017

FunTAL: Reasonably Mixing a Functional Language with Assembl...

引用

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

作者： Patterson, Daniel Perconti, Jamie Dimoulas, Christos Ahmed, Amal Northeastern Univ Boston MA 02115 USA Harvard Univ Cambridge MA 02138 USA

ISBN: (纸本)9781450349888

We present FunTAL, the first multi-language system to formalize safe interoperability between a high-level functional language and low-level assembly code while supporting compositional reasoning about the mix. A central challenge in developing such a multi-language is bridging the gap between assembly, which is staged into jumps to continuations, and high-level code, where subterms return a result. We present a compositional stack-based typed assembly language that supports components, comprised of one or more basic blocks, that may be embedded in high-level contexts. We also present a logical relation for FunTAL that supports reasoning about equivalence of high-level components and their assembly replacements, mixed-language programs with callbacks between languages, and assembly components comprised of different numbers of basic blocks.

关键词： multi-language semantics typed assembly language inline assembly contextual equivalence logical relations

来源：评论

学校读者我要写书评

暂无评论

Effective synchronization removal for Java 00

Effective synchronization removal for Java

引用

acm sigplan' 00 conference on programming language design and implementation (pldi)

作者： Ruf, E Miscosoft Res Redmond WA 98025 USA

ISBN: (纸本)9781581131994

We present a new technique for removing unnecessary synchronization operations from statically compiled Java programs. Our approach improves upon current efforts based on escape analysis, as it can eliminate synchronization opt rations even on objects that escape their allocating threads. It makes use of a compact, equivalence-class-based representation that eliminates the need for fixed point operations during the analysis. We describe and evaluate the performance of an implementation in the Marmot native Java compiler. For the benchmark programs examined, the optimization removes 100% of the dynamic synchronization operations in single-threaded programs, and 0-99% in multi-threaded programs, at a low cost in additional compilation time and code growth.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Termination proofs for systems code 06

Termination proofs for systems code

引用

pldi 2006 - 2006 acm sigplan conference on programming language design and implementation

作者： Cook, Byron Podelski, Andreas Rybalchenko, Andrey Microsoft Research Max-Planck-Institut für Informatik Germany Max-Planck-Institut für Informatik EPFL Germany

ISBN: (纸本)1595933204

Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and context-sensitive program analysis and provides capacity for large program fragments (i.e. more than 20,000 lines of code) together with support for programming language features such as arbitrarily nested loops, pointers, function-pointers, side-effects, etc. We also present experimental results on device driver dispatch routines from the Windows operating system. The most distinguishing aspect of our tool is how it shifts the balance between the two tasks of constructing and respectively checking the termination argument. Checking becomes the hard step. In this paper we show how we solve the corresponding challenge of checking with binary reachability analysis. Copyright © 2006 acm.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

INC: A language for incremental computations 88

INC: A language for incremental computations

引用

acm sigplan conference on programming language design and implementation, pldi 1988

作者： Yellin, Daniel Strom, Robert IBM T.J. Watson Research Center P.O. Box 704 Yorktown HeightsNY United States

来源：评论

学校读者我要写书评

暂无评论

***: (A)Synchronous Reactive Web programming 2020

***: (A)Synchronous Reactive Web Programming

引用

41st acm sigplan conference on programming language design and implementation (pldi)

作者： Berry, Gerard Serrano, Manuel Coll France Paris France UCA INRIA Sophia Antipolis France

ISBN: (纸本)9781450376136

We present ***, a synchronous reactive language that adds synchronous concurrency and preemption to JavaScript. Inspired from Esterel, *** simplifies the programming of non-trivial temporal behaviors as found in complex web interfaces or IoT controllers and the cooperation between synchronous and asynchronous activities. *** is compiled into plain sequential JavaScript and executes on unmodified runtime environments. We use three examples to present and discuss ***: a simple web login form to introduce the language and show how it differs from JavaScript, and two real life examples, a medical prescription pillbox and an interactive music system that show why concurrency and preemption help programming such temporal applications.

关键词： Reactive programming Synchronous programming Web programming JavaScript

来源：评论

学校读者我要写书评

暂无评论

Futhark: Purely Functional GPU-programming with Nested Parallelism and In-Place Array Updates 2017

Futhark: Purely Functional GPU-Programming with Nested Paral...

引用

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

作者： Henriksen, Troels Serup, Niels G. W. Elsman, Martin Henglein, Fritz Oancea, Cosmin E. Univ Copenhagen DIKU Dept Comp Sci Copenhagen Denmark

ISBN: (纸本)9781450349888

Futhark is a purely functional data-parallel array language that offers a machine-neutral programming model and an optimising compiler that generates OpenCL code for GPUs. This paper presents the design and implementation of three key features of Futhark that seek a suitable middle ground with imperative approaches. First, in order to express efficient code inside the parallel constructs, we introduce a simple type system for in-place updates that ensures referential transparency and supports equational reasoning. Second, we furnish Futhark with parallel operators capable of expressing efficient strength-reduced code, along with their fusion rules. Third, we present a flattening transformation aimed at enhancing the degree of parallelism that (i) builds on loop interchange and distribution but uses higher-order reasoning rather than array-dependence analysis, and (ii) still allows further locality-of-reference optimisations. Finally, an evaluation on 16 benchmarks demonstrates the impact of the language and compiler features and shows application-level performance competitive with hand-written GPU code.

关键词： functional language parallel compilers GPGPU

来源：评论

学校读者我要写书评

暂无评论

The Atomos ∑ transactional programming language 06

The Atomos ∑ transactional programming language

引用

acm sigplan conference on programming language design and implementation, pldi 2006 - PLAS 2006: 2006 programming languages and Analysis for Security Workshop

作者： Carlstrom, Brian D. McDonald, Austen Chafi, Hassan Chung, Jaewoong Minh, Chi Cao Kozyrakis, Christos Olukotun, Kunle Computer Systems Laboratory Stanford University United States

ISBN: (纸本)1595933743

Atomos is the first programming language with implicit transactions, strong atomicity, and a scalable multiprocessor implementation. Atomos is derived from Java, but replaces its synchronization and conditional waiting constructs with simpler transactional *** Atomos watch statement allows programmers to specify fine-grained watch sets used with the Atomos retry conditional waiting statement for efficient transactional conflict-driven wakeup even in transactional memory systems with a limited number of transactional contexts. Atomos supports open-nested transactions, which are necessary for building both scalable application programs and virtual machine *** implementation of the Atomos scheduler demonstrates the use of open nesting within the virtual machine and introduces the concept of transactional memory violation handlers that allow programs to recover from data dependency violations without rolling *** programming examples are given to demonstrate the usefulness of transactional programming primitives. Atomos and Java are compared through the use of several benchmarks. The results demonstrate both the improvements in parallel programming ease and parallel program performance provided by Atomos. Copyright © 2006 acm.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Inferring Type Rules for Syntactic Sugar 2018

Inferring Type Rules for Syntactic Sugar

引用

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

作者： Pombrio, Justin Krishnamurthi, Shriram Brown Univ Providence RI 02912 USA

ISBN: (纸本)9781450356985

Type systems and syntactic sugar are both valuable to programmers, but sometimes at odds. While sugar is a valuable mechanism for implementing realistic languages, the expansion process obscures program source structure. As a result, type errors can reference terms the programmers did not write (and even constructs they do not know), baffling them. The language developer must also manually construct type rules for the sugars, to give a typed account of the surface language. We address these problems by presenting a process for automatically reconstructing type rules for the surface language using rules for the core. We have implemented this theory, and show several interesting case studies.

关键词： programming languages Syntactic Sugar Macros Type Systems Resugaring

来源：评论

学校读者我要写书评

暂无评论

Fast and flexible instruction selection with on-demand tree-parsing automata 06

Fast and flexible instruction selection with on-demand tree-...

引用

acm sigplan conference on programming language design and implementation, pldi 2006 - PLAS 2006: 2006 programming languages and Analysis for Security Workshop

作者： Ertl, M. Anton Casey, Kevin Gregg, David TU Wien Austria Trinity College Dublin Ireland Institut für Computersprachen Technische Universität Wien Argentinierstraße 8 A-1040 Wien Austria

ISBN: (纸本)1595933743

Tree parsing as supported by code generator generators like BEG, burg, iburg, lburg and ml-burg is a popular instruction selection method. There are two existing approaches for implementing tree parsing: dynamic programming, and tree-parsing automata;each approach has its advantages and disadvantages. We propose a new implementation approach that combines the advantages of both existing approaches: we start out with dynamic programming at compile time, but at every step we generate a state for a tree-parsing automaton, which is used the next time a tree matching the state is found, turning the instruction selector into a fast tree-parsing automaton. We have implemented this approach in the Gforth code generator. The implementation required little effort and reduced the startup time of Gforth by up to a factor of 2.5. Copyright © 2006 acm.

关键词： Automatic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共53页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：