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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

语言

547 篇 英文
20 篇 其他

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

共 567 条记录，以下是101-110 订阅

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

详细简洁

排序：

Typed Self-Representation 09

Typed Self-Representation

引用

acm sigplan conference on programming language design and implementation

作者： Rendel, Tillmann Ostermann, Klaus Hofer, Christian Univ Aarhus DK-8000 Aarhus C Denmark

ISBN: (纸本)9781605583921

Self-representation - the ability to represent programs in their own language - has important applications in reflective languages and many other domains of programming language design. Although approaches to designing typed program representations for sublanguages of some base language have become quite popular recently, the question whether a fully metacircular typed self-representation is possible is still open. This paper makes a big step towards this aim by defining the F(omega)* calculus, an extension of the higher-order polymorphic lambda calculus F. that allows type self-representations. While the usability of these representations for metaprogramming is still limited, we believe that our approach makes a significant step towards a new generation of reflective languages that are both safe and efficient.

关键词： Lambda Calculus language design Reflection Self Interpretation Types

来源：评论

学校读者我要写书评

暂无评论

Renaissance: Benchmarking Suite for Parallel Applications on the JVM 2019

Renaissance: Benchmarking Suite for Parallel Applications on...

引用

40th acm sigplan conference on programming language design and implementation (pldi) part of acm's Federated Computing Research conference (FCRC)

作者： Prokopec, Aleksandar Rosa, Andrea Leopoldseder, David Duboscq, Gilles Tuma, Petr Studener, Martin Bulej, Lubomir Zheng, Yudi Villazon, Alex Simon, Doug Wurthinger, Thomas Binder, Walter Oracle Labs Zurich Switzerland Univ Svizzera Italiana Lugano Switzerland Johannes Kepler Univ Linz Linz Austria Charles Univ Prague Prague Czech Republic Univ Privada Boliviana Colcapirhua Bolivia

ISBN: (纸本)9781450367127

Established benchmark suites for the Java Virtual Machine (JVM), such as DaCapo, ScalaBench, and SPECjvm2008, lack workloads that take advantage of the parallel programming abstractions and concurrency primitives offered by the JVM and the Java Class Library. However, such workloads are fundamental for understanding the way in which modern applications and data-processing frameworks use the JVM's concurrency features, and for validating new just-in-time (JIT) compiler optimizations that enable more efficient execution of such workloads. We present Renaissance, a new benchmark suite composed of modern, real-world, concurrent, and object-oriented workloads that exercise various concurrency primitives of the JVM. We show that the use of concurrency primitives in these workloads reveals optimization opportunities that were not visible with the existing workloads. We use Renaissance to compare performance of two state-of-the-art, production-quality JIT compilers (HotSpot C2 and Graal), and show that the performance differences are more significant than on existing suites such as DaCapo and SPECjvm2008. We also use Renaissance to expose four new compiler optimizations, and we analyze the behavior of several existing ones. Evaluating these optimizations using four benchmark suites shows a more prominent impact on the Renaissance workloads than on those of other suites.

关键词： benchmarks JIT compilation parallelism concurrency JVM object-oriented programming benchmarks functional programming benchmarks Big Data benchmarks

来源：评论

学校读者我要写书评

暂无评论

Efficient and precise datarace detection for multithreaded object-oriented programs

Efficient and precise datarace detection for multithreaded o...

引用

conference on programming language design and implementation (pldi 02)

作者： Choi, JD Lee, KW Loginov, A O'Callahan, R Sarkar, V Sridharan, M IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA Univ Washington Seattle WA 98195 USA Univ Wisconsin Madison WI 53706 USA MIT Cambridge MA 02139 USA

We present a novel approach to dynamic datarace detection for multithreaded object-oriented programs. Past techniques for on-the-fly datarace detection either sacrificed precision for performance, leading to many false positive datarace reports, or maintained precision but incurred significant overheads in the range of 3x to 30x. In contrast, our approach results in very few false positives and runtime overhead in the 13% to 42% range, making it both efficient and precise. This performance improvement is the result of a unique combination of complementary static and dynamic optimization techniques.

关键词： experimentation languages measurement performance dataraces race conditions debugging parallel programs synchronization multithreaded programming object-oriented programming static-dynamic co-analysis

来源：评论

学校读者我要写书评

暂无评论

First-class Runtime Generation of High-performance Types using Exotypes 14

First-class Runtime Generation of High-performance Types usi...

引用

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

作者： DeVito, Zachary Ritchie, Daniel Fisher, Matt Aiken, Alex Hanrahan, Pat Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781450327848

We introduce exotypes, user-defined types that combine the flexibility of meta-object protocols in dynamically-typed languages with the performance control of low-level languages. Like objects in dynamic languages, exotypes are defined programmatically at runtime, allowing behavior based on external data such as a database schema. To achieve high performance, we use staged programming to define the behavior of an exotype during a runtime compilation step and implement exotypes in Terra, a low-level staged programming language. We show how exotype constructors compose, and use exotypes to implement high-performance libraries for serialization, dynamic assembly, automatic differentiation, and probabilistic programming. Each exotype achieves expressiveness similar to libraries written in dynamically-typed languages but implements optimizations that exceed the performance of existing libraries written in low-level statically-typed languages. Though each implementation is significantly shorter, our serialization library is 11 times faster than Kryo, and our dynamic assembler is 3-20 times faster than Google's Chrome assembler.

关键词： design Performance Lua Staged computation DSL

来源：评论

学校读者我要写书评

暂无评论

Silq: A High-Level Quantum language with Safe Uncomputation and Intuitive Semantics 2020

Silq: A High-Level Quantum Language with Safe Uncomputation ...

引用

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

作者： Bichsel, Benjamin Baader, Maximilian Gehr, Timon Vechev, Martin Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450376136

Existing quantum languages force the programmer to work at a low level of abstraction leading to unintuitive and cluttered code. A fundamental reason is that dropping temporary values from the program state requires explicitly applying quantum operations that safely uncompute these values. We present Silq, the first quantum language that addresses this challenge by supporting safe, automatic uncomputation. This enables an intuitive semantics that implicitly drops temporary values, as in classical computation. To ensure physicality of Silq's semantics, its type system leverages novel annotations to reject unphysical programs. Our experimental evaluation demonstrates that Silq programs are not only easier to read and write, but also significantly shorter than equivalent programs in other quantum languages (on average -46% for Q#, -38% for Quipper), while using only half the number of quantum primitives.

关键词： Quantum language Uncomputation Semantics

来源：评论

学校读者我要写书评

暂无评论

Efficient and language-independent mobile programs 96

Efficient and language-independent mobile programs

引用

Proceedings of the acm sigplan'96 conference on programming language design and implementation, pldi

作者： Adl-Tabatabai, Ali-Reza Langdale, Geoff Lucco, Steven Wahbe, Robert Carnegie Mellon Univ Pittsburgh PA United States

ISBN: (纸本)9780897917957

This paper evaluates the design and implementation of Omniware: a safe, efficient, and language-independent system for executing mobile program modules. Omniware uses software fault isolation to achieve a unique combination of language-independence and excellent performance. Software fault isolation uses only the semantics of the underlying processor to determine whether a mobile code module can corrupt its execution environment. This separation of programming language implementation from program module safety enable mobile system to use a radically simplified virtual machine as its basis for portability.

关键词： Computer program listings

来源：评论

学校读者我要写书评

暂无评论

Practical program analysis using general purpose logic programming systems - a case study

Practical program analysis using general purpose logic progr...

引用

Proceedings of the acm sigplan'96 conference on programming language design and implementation, pldi

作者： Dawson, Steven Ramakrishnan, C.R. Warren, David S. SUNY at Stony Brook Stony Brook United States

Study shows that it is indeed possible to use declarative formulations in practical systems, when combined judiciously with the appropriate tools of evaluations. This paper describes the implementation of logical formulations of two existing analysis techniques: groundness analysis of logic programs and strictness analysis of logic programs. The XSB system is used is used as the evaluation tool. Experimental evidence shows that the resultant groundness and strictness analysis system are practical in terms of both time and space.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

A single intermediate language that supports multiple implementations of exceptions

A single intermediate language that supports multiple implem...

引用

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

作者： Ramsey, N Jones, SP Harvard Univ Cambridge MA 02138 USA

We present mechanisms that enable our compiler-target language, C--, to express four of the best known techniques for implementing exceptions, all within a single, uniform framework. We define the mechanisms precisely, using a formal operational semantics. We also show that exceptions need not require special treatment in the optimizer;by introducing extra dataflow edges, we make standard optimization techniques work even on programs that use exceptions. Our approach clarifies the design space of exception-handling techniques, and it allows a single optimizer to handle a variety of implementation techniques. Our ultimate goal is to allow a source-language compiler the freedom to choose its exception-handling policy, while encapsulating the architecture-dependent mechanisms and their optimization in an implementation of C-- that can be used by compilers for many source languages.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Component-Based Synthesis of Table Consolidation and Transformation Tasks from Examples 2017

Component-Based Synthesis of Table Consolidation and Transfo...

引用

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

作者： Feng, Yu Martins, Ruben Van Geffen, Jacob Dillig, Isil Chaudhuri, Swarat Univ Texas Austin Austin TX 78712 USA Rice Univ Houston TX 77251 USA

ISBN: (纸本)9781450349888

This paper presents a novel component-based synthesis algorithm that marries the power of type-directed search with lightweight SMT-based deduction and partial evaluation. Given a set of components together with their over-approximate first-order specifications, our method first generates a program sketch over a subset of the components and checks its feasibility using an SMT solver. Since a program sketch typically represents many concrete programs, the use of SMT-based deduction greatly increases the scalability of the algorithm. Once a feasible program sketch is found, our algorithm completes the sketch in a bottom-up fashion, using partial evaluation to further increase the power of deduction for rejecting partially-filled program sketches. We apply the proposed synthesis methodology for automating a large class of data preparation tasks that commonly arise in data science. We have evaluated our synthesis algorithm on dozens of data wrangling and consolidation tasks obtained from on-line forums, and we show that our approach can automatically solve a large class of problems encountered by R users.

关键词： Program synthesis programming by example data preparation Component-based synthesis SMT-based deduction

来源：评论

学校读者我要写书评

暂无评论

Reactive Probabilistic programming 2020

Reactive Probabilistic Programming

引用

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

作者： Baudart, Guillaume Mandel, Louis Atkinson, Eric Sherman, Benjamin Pouzet, Marc Carbin, Michael IBM Res MIT IBM Watson AI Lab Armonk NY 10504 USA MIT Cambridge MA 02139 USA PSL Res Univ Ecole Normale Super Paris France

ISBN: (纸本)9781450376136

Synchronous modeling is at the heart of programming languages like Lustre, Esterel, or SCADE used routinely for implementing safety critical control software, e.g., fly-by-wire and engine control in planes. However, to date these languages have had limited modern support for modeling uncertainty - probabilistic aspects of the software's environment or behavior - even though modeling uncertainty is a primary activity when designing a control system. In this paper we present ProbZelus the first synchronous probabilistic programming language. ProbZelus conservatively provides the facilities of a synchronous language to write control software, with probabilistic constructs to model uncertainties and perform inference-in-the-loop. We present the design and implementation of the language. We propose a measure-theoretic semantics of probabilistic stream functions and a simple type discipline to separate deterministic and probabilistic expressions. We demonstrate a semantics-preserving compilation into a first-order functional language that lends itself to a simple presentation of inference algorithms for streaming models. We also redesign the delayed sampling inference algorithm to provide efficient streaming inference. Together with an evaluation on several reactive applications, our results demonstrate that ProbZelus enables the design of reactive probabilistic applications and efficient, bounded memory inference.

关键词： Probabilistic programming Reactive programming Streaming inference Semantics Compilation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：