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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

250 篇 会议
5 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

210 篇 工学
- 202 篇 软件工程
- 92 篇 计算机科学与技术...
- 7 篇 电气工程
- 3 篇 控制科学与工程
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 生物工程
7 篇 理学
- 6 篇 数学
- 1 篇 生物学
5 篇 管理学
- 4 篇 管理科学与工程(可...
- 2 篇 工商管理
- 1 篇 图书情报与档案管...
2 篇 经济学
- 2 篇 应用经济学
2 篇 教育学
- 2 篇 教育学

主题

49 篇 design
40 篇 languages
22 篇 performance
15 篇 algorithms
14 篇 probabilistic pr...
12 篇 verification
12 篇 functional progr...
11 篇 program synthesi...
10 篇 object oriented ...
10 篇 reliability
10 篇 concurrency
9 篇 experimentation
9 篇 programming lang...
8 篇 type systems
8 篇 domain-specific ...
7 篇 java
6 篇 optimization
6 篇 theory
5 篇 compilers
5 篇 metaprogramming

机构

8 篇 purdue univ w la...
7 篇 carnegie mellon ...
6 篇 harvard univ cam...
5 篇 univ penn philad...
4 篇 univ wisconsin m...
4 篇 princeton univ p...
4 篇 univ calif davis...
4 篇 northeastern uni...
4 篇 cornell univ ith...
4 篇 stanford univ st...
4 篇 univ washington ...
3 篇 microsoft res re...
3 篇 swiss fed inst t...
3 篇 mit cambridge ma...
3 篇 yale univ new ha...
3 篇 rice univ housto...
3 篇 univ calif berke...
3 篇 univ texas austi...
2 篇 microsoft corp r...
2 篇 oracle labs pots...

作者

5 篇 foster nate
5 篇 gulwani sumit
5 篇 walker david
4 篇 dillig isil
3 篇 ahmed amal
3 篇 huang jeff
3 篇 vechev martin
3 篇 shao zhong
3 篇 tobin-hochstadt ...
3 篇 su zhendong
3 篇 chaudhuri swarat
3 篇 felleisen matthi...
3 篇 myers andrew c.
3 篇 zhang xiangyu
3 篇 acar umut a.
3 篇 mansinghka vikas...
2 篇 hirschfeld rober...
2 篇 flatt matthew
2 篇 gupta gagan
2 篇 shull thomas

语言

251 篇 英文
3 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation"

共 255 条记录，以下是31-40 订阅

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

详细简洁

排序：

Profile- Guided Meta-programming 15

Profile- Guided Meta-Programming

引用

36th acm sigplan conference on programming language design and implementation

作者： Bowman, William J. Miller, Swaha St-Amour, Vincent Dybvig, R. Kent Northeastern Univ Boston MA 02115 USA Cisco Syst Inc San Jose CA USA

ISBN: (纸本)9781450334686

Contemporary compiler systems such as GCC,. NET, and LLVM incorporate profile-guided optimizations (PGOs) on low-level intermediate code and basic blocks, with impressive results over purely static heuristics. Recent work shows that profile information is also useful for performing source-to-source optimizations via meta-programming. For example, using profiling information to inform decisions about data structures and algorithms can potentially lead to asymptotic improvements in performance. We present a design for profile-guided meta-programming in a general-purpose meta-programming system. Our design is parametric over the particular profiler and meta-programming system. We implement this design in two different meta-programming systems-the syntactic extensions systems of Chez Scheme and Racket- and provide several profile-guided meta-programs as usability case studies.

关键词： design Performance languages Optimization profiling profile-guided optimization PGO meta-programming

来源：评论

学校读者我要写书评

暂无评论

Type-and-Example-Directed Program Synthesis 15

Type-and-Example-Directed Program Synthesis

引用

36th acm sigplan conference on programming language design and implementation

作者： Osera, Peter-Michael Zdancewic, Steve Univ Penn Philadelphia PA 19104 USA

ISBN: (纸本)9781450334686

this paper presents an algorithm for synthesizing recursive functions that process algebraic datatypes. It is founded on proof-theoretic techniques that exploit both type information and input-output examples to prune the search space. the algorithm uses refinement trees, a data structure that succinctly represents constraints on the shape of generated code. We evaluate the algorithm by using a prototype implementation to synthesize more than 40 benchmarks and several non-trivial larger examples. Our results demonstrate that the approach meets or outperforms the state-of-the-art for this domain, in terms of synthesis time or attainable size of the generated programs.

关键词： languages theory Functional programming Proof Search Program Synthesis Type theory

来源：评论

学校读者我要写书评

暂无评论

Compiling Markov Chain Monte Carlo Algorithms for Probabilistic Modeling 2017

Compiling Markov Chain Monte Carlo Algorithms for Probabilis...

引用

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

作者： Huang, Daniel Tristan, Jean-Baptiste Morrisett, Greg Harvard Univ Cambridge MA 02138 USA Oracle Labs Burlington MA USA Cornell Univ Ithaca NY USA

ISBN: (纸本)9781450349888

the problem of probabilistic modeling and inference, at a high-level, can be viewed as constructing a (model, query, inference) tuple, where an inference algorithm implements a query on a model. Notably, the derivation of inference algorithms can be a difficult and error-prone task. Hence, researchers have explored how ideas from probabilistic prog ramming can be applied. In the context of constructing these tuples, probabilistic programming can be seen as taking a language-based approach to probabilistic modeling and inference. For instance, by using (1) appropriate languages for expressing models and queries and (2) devising inference techniques that operate on encodings of models (and queries) as program expressions, the task of inference can be automated. In this paper, we describe a compiler that transforms a probabilistic model written in a restricted modeling language and a query for posterior samples given observed data into a Markov Chain Monte Carlo (MCMC) inference algorithm that implements the query. the compiler uses a sequence of intermediate languages (ILs) that guide it in gradually and successively refining a declarative specification of a probabilistic model and the query into an executable MCMC inference algorithm. the compilation strategy produces composable MCMC algorithms for execution on a CPU or GPU.

关键词： probabilistic programming intermediate languages Markov-chain Monte Carlo kernels

来源：评论

学校读者我要写书评

暂无评论

proceedings of the 2004 acm sigplan conference on programming language design and Implentation (PLDI'04)

Proceedings of the 2004 ACM SIGPLAN Conference on Programmin...

引用

proceedings of the 2004 acm sigplan conference on programming language design and implementation (PLDI'04)

the proceedings contains 35 papers from the proceedings of the 2004 acm sigplan conference on programming language design and implementation (PLDI'04). Topics discussed include: effective stream-based and execution-based data prefetching;enhancing data cache reliability by the addition of a small fully-associative replication cache;inter-reference gap distribution replacement: an improved replacement algorithm for set-associative caches;parallel algorithms for mining frequent structural motifs in scientific data;and impact of far-field interactions on performance of multipole-based preconditioners for sparse linear systems.

关键词： Data processing

来源：评论

学校读者我要写书评

暂无评论

Expressing and Verifying Probabilistic Assertions 14

Expressing and Verifying Probabilistic Assertions

引用

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

作者： Sampson, Adrian Panchekha, Pavel Mytkowicz, Todd McKinley, Kathryn S. Grossman, Dan Ceze, Luis Univ Washington Seattle WA 98195 USA

ISBN: (纸本)9781450327848

Traditional assertions express correctness properties that must hold on every program execution. However, many applications have probabilistic outcomes and consequently their correctness properties are also probabilistic (e. g., they identify faces in images, consume sensor data, or run on unreliable hardware). Traditional assertions do not capture these correctness properties. this paper proposes that programmers express probabilistic correctness properties with probabilistic assertions and describes a new probabilistic evaluation approach to efficiently verify these assertions. Probabilistic assertions are Boolean expressions that express the probability that a property will be true in a given execution rather than asserting that the property must always be true. Given either specific inputs or distributions on the input space, probabilistic evaluation verifies probabilistic assertions by first performing distribution extraction to represent the program as a Bayesian network. Probabilistic evaluation then uses statistical properties to simplify this representation to efficiently compute assertion probabilities directly or with sampling. Our approach is a mix of both static and dynamic analysis: distribution extraction statically builds and optimizes the Bayesian network representation and sampling dynamically interprets this representation. We implement our approach in a tool called MAYHAP for C and C++ programs. We evaluate expressiveness, correctness, and performance of MAYHAP on programs that use sensors, perform approximate computation, and obfuscate data for privacy. Our case studies demonstrate that probabilistic assertions describe useful correctness properties and that MAYHAP efficiently verifies them.

关键词： languages Reliability Probabilistic programming approximate computing data obfuscation differential privacy sensors symbolic execution

来源：评论

学校读者我要写书评

暂无评论

Quipper: A Scalable Quantum programming language

Quipper: A Scalable Quantum Programming Language

引用

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

作者： Green, Alexander S. Lumsdaine, Peter LeFanu Ross, Neil J. Selinger, Peter Valiron, Benoit Dalhousie Univ Halifax NS B3H 3J5 Canada Univ Penn Philadelphia PA 19104 USA

ISBN: (纸本)9781450320146

the field of quantum algorithms is vibrant. Still, there is currently a lack of programming languages for describing quantum computation on a practical scale, i.e., not just at the level of toy problems. We address this issue by introducing Quipper, a scalable, expressive, functional, higher-order quantum programming language. Quipper has been used to program a diverse set of non-trivial quantum algorithms, and can generate quantum gate representations using trillions of gates. It is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware. Quipper has proven effective and easy to use, and opens the door towards using formal methods to analyze quantum algorithms.

关键词： Quipper Quantum programming languages

来源：评论

学校读者我要写书评

暂无评论

Terra: A Multi-Stage language for High-Performance Computing

Terra: A Multi-Stage Language for High-Performance Computing

引用

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

作者： DeVito, Zachary Hegarty, James Aiken, Alex Hanrahan, Pat Vitek, Jan Stanford Univ Stanford CA 94305 USA Purdue Univ W Lafayette IN 47907 USA

ISBN: (纸本)9781450320146

High-performance computing applications, such as auto-tuners and domain-specific languages, rely on generative programming techniques to achieve high performance and portability. However, these systems are often implemented in multiple disparate languages and perform code generation in a separate process from program execution, making certain optimizations difficult to engineer. We leverage a popular scripting language, Lua, to stage the execution of a novel low-level language, Terra. Users can implement optimizations in the high-level language, and use built-in constructs to generate and execute high-performance Terra code. To simplify meta-programming, Lua and Terra share the same lexical environment, but, to ensure performance, Terra code can execute independently of Lua's runtime. We evaluate our design by reimplementing existing multi-language systems entirely in Terra. Our Terra-based auto-tuner for BLAS routines performs within 20% of ATLAS, and our DSL for stencil computations runs 2.3x faster than hand-written C.

关键词： design Performance Lua Staged computation DSL

来源：评论

学校读者我要写书评

暂无评论

Relaxing Safely: Verified On-the-Fly Garbage Collection for x86-TSO 15

Relaxing Safely: Verified On-the-Fly Garbage Collection for ...

引用

36th acm sigplan conference on programming language design and implementation

作者： Gammie, Peter Hosking, Antony L. Engelhardt, Kai Purdue Univ W Lafayette IN 47907 USA UNSW Sydney NSW Australia

ISBN: (纸本)9781450334686

We report on a machine-checked verification of safety for a state-of-the-art, on-the-fly, concurrent, mark-sweep garbage collector that is designed for multi-core architectures with weak memory consistency. the proof explicitly incorporates the relaxed memory semantics of x86 multiprocessors. To our knowledge, this is the first fully machine-checked proof of safety for such a garbage collector. We couch the proof in a framework that system implementers will find appealing, with the fundamental components of the system specified in a simple and intuitive programming language. the abstract model is detailed enough for its correspondence with an assembly language implementation to be straightforward.

关键词： Algorithms design languages Reliability Verification formal verification machine-checked proof relaxed memory TSO

来源：评论

学校读者我要写书评

暂无评论

Network Configuration Synthesis with Abstract Topologies 2017

Network Configuration Synthesis with Abstract Topologies

引用

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

作者： Beckett, Ryan Mahajan, Ratul Millstein, Todd Padhye, Jitendra Walker, David Princeton Univ Princeton NJ 08544 USA Intentionet Redmond WA USA Microsoft Redmond WA USA Univ Calif Los Angeles Los Angeles CA 90024 USA

ISBN: (纸本)9781450349888

We develop Propane/AT, a system to synthesize provablycorrect BGP (border gateway protocol) configurations for large, evolving networks from high-level specifications of topology, routing policy, and fault-tolerance requirements. Propane/AT is based on new abstractions for capturing parameterized network topologies and their evolution, and algorithms to analyze the impact of topology and routing policy on fault tolerance. Our algorithms operate entirely on abstract topologies. We prove that the properties established by our analyses hold for every concrete instantiation of the given abstract topology. Propane/AT also guarantees that only incremental changes to existing device configurations are required when the network evolves to add or remove devices and links. Our experiments with real-world topologies and policies show that our abstractions and algorithms are effective, and that, for large networks, Propane/AT synthesizes configurations two orders of magnitude faster than systems that operate on concrete topologies.

关键词： Propane/AT Domain-specific language BGP Fault Tolerance Compilation Network Management

来源：评论

学校读者我要写书评

暂无评论

Practical Partial Evaluation for High-Performance Dynamic language Runtimes 2017

Practical Partial Evaluation for High-Performance Dynamic La...

引用

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

作者： Wurthinger, thomas Wimmer, Christian Humer, Christian Woess, Andreas Stadler, Lukas Seaton, Chris Duboscq, Gilles Simon, Doug Grimmer, Matthias Oracle Labs Zurich Switzerland Johannes Kepler Univ Linz Inst Syst Software Linz Austria

ISBN: (纸本)9781450349888

Most high-performance dynamic language virtual machines duplicate language semantics in the interpreter, compiler, and runtime system. this violates the principle to not repeat yourself. In contrast, we define languages solely by writing an interpreter. the interpreter performs specializations, e.g., augments the interpreted program with type information and profiling information. Compiled code is derived automatically using partial evaluation while incorporating these specializations. this makes partial evaluation practical in the context of dynamic languages: It reduces the size of the compiled code while still compiling all parts of an operation that are relevant for a particular program. When a speculation fails, execution transfers back to the interpreter, the program re-specializes in the interpreter, and later partial evaluation again transforms the new state of the interpreter to compiled code. We evaluate our approach by comparing our implementations of JavaScript, Ruby, and R with best-inclass specialized production implementations. Our general-purpose compilation system is competitive with production systems even when they have been heavily optimized for the one language they support. For our set of benchmarks, our speedup relative to the V8 JavaScript VM is 0.83x, relative to JRuby is 3.8x, and relative to GNU R is 5x.

关键词： dynamic languages virtual machine language implementation optimization partial evaluation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：