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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

264 篇 会议
2 册 图书
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

216 篇 工学
- 209 篇 软件工程
- 91 篇 计算机科学与技术...
- 6 篇 电气工程
- 3 篇 控制科学与工程
- 2 篇 机械工程
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 信息与通信工程
- 1 篇 石油与天然气工程
- 1 篇 生物工程
7 篇 管理学
- 4 篇 图书情报与档案管...
- 3 篇 管理科学与工程(可...
- 1 篇 工商管理
6 篇 理学
- 5 篇 数学
- 1 篇 生物学
1 篇 教育学
- 1 篇 教育学

主题

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

机构

8 篇 purdue univ w la...
7 篇 carnegie mellon ...
5 篇 harvard univ cam...
5 篇 univ penn philad...
5 篇 stanford univ st...
4 篇 univ wisconsin m...
4 篇 princeton univ p...
4 篇 univ calif davis...
4 篇 northeastern uni...
4 篇 cornell univ ith...
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 篇 huang jeff
3 篇 vechev martin
3 篇 shao zhong
3 篇 su zhendong
3 篇 chaudhuri swarat
3 篇 myers andrew c.
3 篇 zhang xiangyu
3 篇 mansinghka vikas...
2 篇 hirschfeld rober...
2 篇 flatt matthew
2 篇 gupta gagan
2 篇 shull thomas
2 篇 yahav eran
2 篇 rajamani sriram
2 篇 niephaus fabio
2 篇 choi jiho

语言

265 篇 英文
2 篇 中文
1 篇 其他

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

共 268 条记录，以下是81-90 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

RaTrace: Simple and Efficient Abstractions for BVH Ray Traversal Algorithms 2017

RaTrace: Simple and Efficient Abstractions for BVH Ray Trave...

引用

16th acm sigplan International conference on Generative programming - Concepts and Experiences (GPCE) co-located with SPLASH conference

作者： Perard-Gayot, Arsene Weier, Martin Membarth, Richard Slusallek, Philipp Leissa, Roland Hack, Sebastian Saarland Univ Comp Graph Lab Saarbrucken Germany Bonn Rhein Sieg Univ Inst Visual Comp St Augustin Germany DFKI Agents & Simulated Real Saarbrucken Germany Saarland Univ Compiler Design Lab Saarbrucken Germany

ISBN: (纸本)9781450355247

In order to achieve the highest possible performance, the ray traversal and intersection routines at the core of every high-performance ray tracer are usually hand-coded, heavily optimized, and implemented separately for each hardware platform-even though they share most of their algorithmic core. the results are implementations that heavily mix algorithmic aspects with hardware and implementation details, making the code non-portable and difficult to change and maintain. In this paper, we present a new approach that offers the ability to define in a functional language a set of conceptual, high-level language abstractions that are optimized away by a special compiler in order to maximize performance. Using this abstraction mechanism we separate a generic ray traversal and intersection algorithm from its low-level aspects that are specific to the target hardware. We demonstrate that our code is not only significantly more flexible, simpler to write, and more concise but also that the compiled results perform as well as state-of-the-art implementations on any of the tested CPU and GPU platforms.

关键词： Computer Graphics Ray Tracing Functional programming Domain-Specific languages

来源：评论

学校读者我要写书评

暂无评论

Programmable Semantic Fragments the design and implementation of typy 2016

Programmable Semantic Fragments The Design and Implementatio...

引用

15th acm International conference on Generative programming - Concepts and Experiences (GPCE)

作者： Omar, Cyrus Aldrich, Jonathan Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9781450344463

this paper introduces typy, a statically typed programming language embedded by reflection into Python. typy features a fragmentary semantics, i.e. it delegates semantic control over each term, drawn from Python's fixed concrete and abstract syntax, to some contextually relevant user-defined semantic fragment. the delegated fragment programmatically 1) typechecks the term (following a bidirectional protocol);and 2) assigns dynamic meaning to the term by computing a translation to Python. We argue that this design is expressive with examples of fragments that express the static and dynamic semantics of 1) functional records;2) labeled sums (with nested pattern matching a la ML);3) a variation on JavaScript's prototypal object system;and 4) typed foreign interfaces to Python and OpenCL. these semantic structures are, or would need to be, defined primitively in conventionally structured languages. We further argue that this design is compositionally well-behaved. It avoids the expression problem and the problems of grammar composition because the syntax is fixed. Moreover, programs are semantically stable under fragment composition (i.e. defining a new fragment will not change the meaning of existing program components.)

关键词： metaprogramming bidirectional typechecking pattern matching foreign function interfaces

来源：评论

学校读者我要写书评

暂无评论

Achieving High Coverage for Floating-Point Code via Unconstrained programming 2017

Achieving High Coverage for Floating-Point Code via Unconstr...

引用

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

作者： Fu, Zhoulai Su, Zhendong Univ Calif Davis Davis CA 95616 USA

ISBN: (纸本)9781450349888

Achieving high code coverage is essential in testing, which gives us confidence in code quality. Testing floating-point code usually requires painstaking efforts in handling floating-point constraints, e.g., in symbolic execution. this paper turns the challenge of testing floating-point code into the opportunity of applying unconstrained programming-the mathematical solution for calculating function minimum points over the entire search space. Our core insight is to derive a representing function from the floating-point program, any of whose minimum points is a test input guaranteed to exercise a new branch of the tested program. this guarantee allows us to achieve high coverage of the floating-point program by repeatedly minimizing the representing function. We have realized this approach in a tool called CoverMe and conducted an extensive evaluation of it on Sun's C math library. Our evaluation results show that CoverMe achieves, on average, 90.8% branch coverage in 6.9 seconds, drastically outperforming our compared tools: (1) Random testing, (2) AFL, a highly optimized, robust fuzzer released by Google, and (3) Austin, a state-of-the-art coverage-based testing tool designed to support floating-point code.

关键词： Unconstrained programming Representing Function CoverMe

来源：评论

学校读者我要写书评

暂无评论

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

Proceedings of the ACM SIGPLAN Conference on Programming Lan...

引用

36th acm sigplan conference on programming language design and implementation, PLDI 2015

ISBN: (纸本)9781450334686

the proceedings contain 59 papers. the topics discussed include: automatic error elimination by horizontal code transfer across multiple applications;mechanized verification of fine-grained concurrent programs;algorithmic debugging of real-world Haskell programs: deriving dependencies from the cost centre stack;light: replay via tightly bounded recording;provably correct peephole optimizations with alive;automatically improving accuracy for floating point expressions;diagnosing type errors with class;verification of producer-consumer synchronization in GPU programs;verification of a cryptographic primitive: SHA-256;asynchronous programming, analysis and testing with state machines;laminarIR: compile-time queues for structured streams;optimizing off-chip accesses in multicores;improving compiler scalability: optimizing large programs at small price;verifying read-copy-update in a logic for weak memory;and stateless model checking concurrent programs with maximal causality reduction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

From Datalog to FLIX: A Declarative language for Fixed Points on Lattices 16

From Datalog to FLIX: A Declarative Language for Fixed Point...

引用

37th acm sigplan conference on programming language design and implementation

作者： Madsen, Magnus Yee, Ming-Ho Lhotak, Ondrej Univ Waterloo Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9781450342612

We present FLIX, a declarative programming language for specifying and solving least fixed point problems, particularly static program analyses. FLIX is inspired by Datalog and extends it with lattices and monotone functions. Using FLIX, implementors of static analyses can express a broader range of analyses than is currently possible in pure Datalog, while retaining its familiar rule-based syntax. We define a model-theoretic semantics of FLIX as a natural extension of the Datalog semantics. this semantics captures the declarative meaning of FLIX programs without imposing any specific evaluation strategy. An efficient strategy is semi-naive evaluation which we adapt for FLIX. We have implemented a compiler and runtime for FLIX, and used it to express several well-known static analyses, including the IFDS and IDE algorithms. the declarative nature of FLIX clearly exposes the similarity between these two algorithms.

关键词： logic programming static analysis Datalog Logic programming Static Analysis

来源：评论

学校读者我要写书评

暂无评论

Synthesizing Transformations on Hierarchically Structured Data 16

Synthesizing Transformations on Hierarchically Structured Da...

引用

37th acm sigplan conference on programming language design and implementation

作者： Yaghmazadeh, Navid Klinger, Christian Dillig, Isil Chaudhuri, Swarat Univ Texas Austin Austin TX 78712 USA Univ Freiburg Freiburg Germany Rice Univ Houston TX 77251 USA

ISBN: (纸本)9781450342612

this paper presents a new approach for synthesizing transformations on tree-structured data, such as Unix directories and XML documents. We consider a general abstraction for such data, called hierarchical data trees (HDTs) and present a novel example-driven synthesis algorithm for HDT transformations. Our central insight is to reduce the problem of synthesizing tree transformers to the synthesis of list transformations that are applied to the paths of the tree. the synthesis problem over lists is solved using a new algorithm that combines SMT solving and decision tree learning. We have implemented our technique in a system called HADES and show that HADES can automatically synthesize a variety of interesting transformations collected from online forums.

关键词： languages Program synthesis programming by example data transformations

来源：评论

学校读者我要写书评

暂无评论

Temporal NetKAT 16

Temporal NetKAT

引用

37th acm sigplan conference on programming language design and implementation

作者： Beckett, Ryan Greenberg, Michael Walker, David Princeton Univ Princeton NJ 08544 USA Pomona Coll Claremont CA 91711 USA

ISBN: (纸本)9781450342612

Over the past 5-10 years, the rise of software-defined networking (SDN) has inspired a wide range of new systems, libraries, hypervisors and languages for programming, monitoring, and debugging network behavior. Oftentimes, these systems are disjoint-one language for programming and another for verification, and yet another for run-time monitoring and debugging. In this paper, we present a new, unified framework, called Temporal NetKAT, capable of facilitating all of these tasks at once. As its name suggests, Temporal NetKAT is the synthesis of two formal theories: past-time (finite trace) linear temporal logic and (network) Kleene Algebra with Tests. Temporal predicates allow programmers to write down concise properties of a packet's path through the network and to make dynamic packet-forwarding, access control or debugging decisions on that basis. In addition to being useful for programming, the combined equational theory of LTL and NetKAT facilitates proofs of pathbased correctness properties. Using new, general, proof techniques, we show that the equational semantics is sound with respect to the denotational semantics, and, for a class of programs we call network-wide programs, complete. We have also implemented a compiler for temporal NetKAT, evaluated its performance on a range of benchmarks, and studied the effectiveness of several optimizations.

关键词： Software-defined networking Network programming languages Domain-specific languages Kleene algebra with tests NetKAT Temporal logic

来源：评论

学校读者我要写书评

暂无评论

Program Synthesis from Polymorphic Refinement Types 16

Program Synthesis from Polymorphic Refinement Types

引用

37th acm sigplan conference on programming language design and implementation

作者： Polikarpova, Nadia Kuraj, Ivan Solar-Lezama, Armando MIT CSAIL Cambridge MA USA

ISBN: (纸本)9781450342612

We present a method for synthesizing recursive functions that provably satisfy a given specification in the form of a polymorphic refinement type. We observe that such specifications are particularly suitable for program synthesis for two reasons. First, they offer a unique combination of expressive power and decidability, which enables automatic verification-and hence synthesis-of nontrivial programs. Second, a type-based specification for a program can often be effectively decomposed into independent specifications for its components, causing the synthesizer to consider fewer component combinations and leading to a combinatorial reduction in the size of the search space. At the core of our synthesis procedure is a newalgorithm for refinement type checking, which supports specification decomposition. We have evaluated our prototype implementation on a large set of synthesis problems and found that it exceeds the state of the art in terms of both scalability and usability. the tool was able to synthesize more complex programs than those reported in prior work (several sorting algorithms and operations on balanced search trees), as well as most of the benchmarks tackled by existing synthesizers, often starting from a more concise and intuitive user input.

关键词： languages Verification Program Synthesis Functional programming Refinement Types Predicate Abstraction

来源：评论

学校读者我要写书评

暂无评论

A Distributed OpenCL Framework using Redundant Computation and Data Replication 16

A Distributed OpenCL Framework using Redundant Computation a...

引用

37th acm sigplan conference on programming language design and implementation

作者： Kim, Junghyun Jo, Gangwon Jung, Jaehoon Kim, Jungwon Lee, Jaejin Seoul Natl Univ Ctr Manycore Programming Dept Comp Sci & Engn Seoul 08826 South Korea

ISBN: (纸本)9781450342612

Applications written solely in OpenCL or CUDA cannot execute on a cluster as a whole. Most previous approaches that extend these programming models to clusters are based on a common idea: designating a centralized host node and coordinating the other nodes with the host for computation. However, the centralized host node is a serious performance bottleneck when the number of nodes is large. In this paper, we propose a scalable and distributed OpenCL framework called SnuCL-D for large-scale clusters. SnuCL-D's remote device virtualization provides an OpenCL application with an illusion that all compute devices in a cluster are confined in a single node. To reduce the amount of control-message and data communication between nodes, SnuCL-D replicates the OpenCL host program execution and data in each node. We also propose a new OpenCL host API function and a queueing optimization technique that significantly reduce the overhead incurred by the previous centralized approaches. To show the effectiveness of SnuCL-D, we evaluate SnuCL-D with a microbenchmark and eleven benchmark applications on a large-scale CPU cluster and a medium-scale GPU cluster.

关键词： OpenCL clusters heterogeneous computing programming models runtime systems redundant computation data replication

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共27页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：