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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

238 篇 会议
3 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

196 篇 工学
- 191 篇 软件工程
- 79 篇 计算机科学与技术...
- 6 篇 电气工程
- 1 篇 机械工程
- 1 篇 动力工程及工程热...
- 1 篇 控制科学与工程
- 1 篇 生物工程
6 篇 理学
- 5 篇 数学
- 1 篇 生物学
- 1 篇 系统科学
2 篇 教育学
- 2 篇 教育学
2 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...

主题

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

机构

8 篇 purdue univ w la...
7 篇 carnegie mellon ...
5 篇 harvard univ cam...
4 篇 univ wisconsin m...
4 篇 princeton univ p...
4 篇 univ calif davis...
4 篇 northeastern uni...
4 篇 cornell univ ith...
4 篇 univ penn philad...
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 篇 shao zhong
4 篇 dillig isil
3 篇 huang jeff
3 篇 vechev martin
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

语言

240 篇 英文
1 篇 中文

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

共 241 条记录，以下是121-130 订阅

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

详细简洁

排序：

Featherweight Swift: A Core Calculus for Swift's Type System 13

Featherweight Swift: A Core Calculus for Swift's Type System

引用

13th acm sigplan International conference on Software language Engineering (SLE) part of SPLASH conference

作者： Racordon, Dimitri Buchs, Didier Univ Geneva Dept Comp Sci Geneva Switzerland

ISBN: (纸本)9781450381765

Swift is a modern general-purpose programming language, designed to be a replacement for C-based languages. Although primarily directed at development of applications for Apple's operating systems, Swift's adoption has been growing steadily in other domains, ranging from server-side services to machine learning. this success can be partly attributed to a rich type system that enables the design of safe, fast, and expressive programming interfaces. Unfortunately, this richness comes at the cost of complexity, setting a high entry barrier to exploit Swift's full potential. Furthermore, existing documentation typically only relies on examples, leaving new users with little help to build a deeper understanding of the underlying rules and mechanisms. this paper aims to tackle this issue by laying out the foundations for a formal framework to reason about Swift's type system. We introduce Featherweight Swift, a minimal language stripped of all features not essential to describe its typing rules. Featherweight Swift features classes and protocol inheritance, supports retroactive modeling, and emulates Swift's overriding mechanisms. Yet its formalization fits on a few pages. We present Featherweight Swift's syntax and semantics. We then elaborate on the usability of our framework to reason about Swift's features, future extensions, and implementation by discussing a bug in Swift's compiler, discovered throughout the design of our calculus.

关键词： protocol oriented programming language semantics language calculus type systems swift

来源：评论

学校读者我要写书评

暂无评论

Test-Driven Synthesis 14

Test-Driven Synthesis

引用

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

作者： Perelman, Daniel Gulwani, Sumit Grossman, Dan Provost, Peter Univ Washington Seattle WA 98195 USA Microsoft Corp Mountain View CA USA

ISBN: (纸本)9781450327848

programming-by-example technologies empower end-users to create simple programs merely by providing input/output examples. Existing systems are designed around solvers specialized for a specific set of data types or domain-specific language (DSL). We present a program synthesizer which can be parameterized by an arbitrary DSL that may contain conditionals and loops and therefore is able to synthesize programs in any domain. In order to use our synthesizer, the user provides a sequence of increasingly sophisticated input/output examples along with an expert-written DSL definition. these two inputs correspond to the two key ideas that allow our synthesizer to work in arbitrary domains. First, we developed a novel iterative synthesis technique inspired by test-driven development-which also gives our technique the name of test-driven synthesis-where the input/output examples are consumed one at a time as the program is refined. Second, the DSL allows our system to take an efficient component-based approach to enumerating possible programs. We present applications of our synthesis methodology to end-user programming for transformations over strings, XML, and table layouts. We compare our synthesizer on these applications to state-of-the-art DSL-specific synthesizers as well to the general purpose synthesizer Sketch.

关键词： languages Experimentation program synthesis end-user programming test driven development

来源：评论

学校读者我要写书评

暂无评论

proceedings of the acm sigplan Workshop on Memory Systems Performance and Correctness, MSPC 2013

Proceedings of the ACM SIGPLAN Workshop on Memory Systems Pe...

引用

acm sigplan Workshop on Memory Systems Performance and Correctness, MSPC 2013, co-located with the 34th annual acm sigplan conference on programming language design and implementation, PLDI

ISBN: (纸本)9781450321037

the proceedings contain 12 papers. the topics discussed include: APE: accelerator processor extensions to optimize data-compute co-location;a study of data structures with a deep heap shape;introducing kernel-level page reuse for high performance computing;a low overhead method for recovering unused memory inside regions;software-controlled transparent management of heterogeneous memory resources in virtualized systems;program-centric cost models for locality;a new perspective on processing-in-memory architecture design;a coldness metric for cache optimization;all-window data liveness;software-level scheduling to exploit non-uniformly shared data cache on GPGPU;cache rationing for multicore;and analyzing locality of memory references in GPU architectures.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

LoCal: A language for Programs Operating on Serialized Data 2019

LoCal: A Language for Programs Operating on Serialized Data

引用

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

作者： Vollmer, Michael Koparkar, Chaitanya Rainey, Mike Sakka, Laith Kulkarni, Milind Newton, Ryan R. Indiana Univ Comp Sci Bloomington IN 47405 USA Purdue Univ Elect & Comp Engn W Lafayette IN 47907 USA

ISBN: (纸本)9781450367127

In a typical data-processing program, the representation of data in memory is distinct from its representation in a serialized form on disk. the former has pointers and arbitrary, sparse layout, facilitating easy manipulation by a program, while the latter is packed contiguously, facilitating easy I/O. We propose a language, LoCal, to unify in-memory and serialized formats. LoCal extends a region calculus into a location calculus, employing a type system that tracks the byte-addressed layout of all heap values. We formalize LoCal and prove type safety, and show how LoCal programs can be inferred from unannotated source terms. We transform the existing Gibbon compiler to use LoCal as an intermediate language, with the goal of achieving a balance between code speed and data compactness by introducing just enough indirection into heap layouts, preserving the asymptotic complexity of traditional representations, but working with mostly or completely serialized data. We show that our approach yields significant performance improvement over prior approaches to operating on packed data, without abandoning idiomatic programming with recursive functions.

关键词： Region Calculus Compiler Optimization Data Encoding Tree Traversal

来源：评论

学校读者我要写书评

暂无评论

Using role components to implement collaboration-based designs 11

Using role components to implement collaboration-based desig...

引用

proceedings of the 1996 conference on Object-Oriented programming Systems, languages & Applications

作者： VanHilst, Michael Notkin, David Univ of Washington Seattle United States

ISBN: (纸本)089791788X

In this paper we present a method of code implementation that works in conjunction with collaboration and responsibility based analysis modeling techniques to achieve better code reuse and resilience to change. Our approach maintains a closer mapping from responsibilities in the analysis model to entities in the implementation. In so doing, it leverages the features of flexible design and design reuse found in collaboration-based design models to provide similar adaptability and reuse in the implementation. Our approach requires no special development tools and uses only standard features available in the C++ language. In an earlier paper we described the basic mechanisms used by our approach and discussed its advantages in comparison to the framework approach. In this paper we show how our approach combines code and design reuse, describing specific techniques that can be used in the development of larger applications.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A General Path-Based Representation for Predicting Program Properties 2018

A General Path-Based Representation for Predicting Program P...

引用

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

作者： Alon, Uri Zilberstein, Meital Levy, Omer Yahav, Eran Technion Haifa Israel Univ Washington Seattle WA 98195 USA

ISBN: (纸本)9781450356985

Predicting program properties such as names or expression types has a wide range of applications. It can ease the task of programming, and increase programmer productivity. A major challenge when learning from programs is how to represent programs in a way that facilitates effective learning. We present a general path-based representation for learning from programs. Our representation is purely syntactic and extracted automatically. the main idea is to represent a program using paths in its abstract syntax tree (AST). this allows a learning model to leverage the structured nature of code rather than treating it as a flat sequence of tokens. We showthat this representation is general and can: (i) cover different prediction tasks, (ii) drive different learning algorithms (for both generative and discriminative models), and (iii) work across different programming languages. We evaluate our approach on the tasks of predicting variable names, method names, and full types. We use our representation to drive both CRF-based and word2vec-based learning, for programs of four languages: JavaScript, Java, Python and C#. Our evaluation shows that our approach obtains better results than task-specific handcrafted representations across different tasks and programming languages.

关键词： programming languages Big Code Machine Learning Learning Representations

来源：评论

学校读者我要写书评

暂无评论

TRANSIT: Specifying Protocols with Concolic Snippets

TRANSIT: Specifying Protocols with Concolic Snippets

引用

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

作者： Udupa, Abhishek Raghavan, Arun Deshmukh, Jyotirmoy V. Mador-Haim, Sela Martin, Milo M. K. Alur, Rajeev Univ Penn Philadelphia PA 19104 USA

ISBN: (纸本)9781450320146

With the maturing of technology for model checking and constraint solving, there is an emerging opportunity to develop programming tools that can transform the way systems are specified. In this paper, we propose a new way to program distributed protocols using concolic snippets. Concolic snippets are sample execution fragments that contain both concrete and symbolic values. the proposed approach allows the programmer to describe the desired system partially using the traditional model of communicating extended finite-state-machines (EFSM), along with high-level invariants and concrete execution fragments. Our synthesis engine completes an EFSM skeleton by inferring guards and updates from the given fragments which is then automatically analyzed using a model checker with respect to the desired invariants. the counterexamples produced by the model checker can then be used by the programmer to add new concrete execution fragments that describe the correct behavior in the specific scenario corresponding to the counterexample. We describe TRANSIT, a language and prototype implementation of the proposed specification methodology for distributed protocols. Experimental evaluations of TRANSIT to specify cache coherence protocols show that (1) the algorithm for expression inference from concolic snippets can synthesize expressions of size 15 involving typical operators over commonly occurring types, (2) for a classical directory-based protocol, TRANSIT automatically generates, in a few seconds, a complete implementation from a specification consisting of the EFSM structure and a few concrete examples for every transition, and (3) a published partial description of the SGI Origin cache coherence protocol maps directly to symbolic examples and leads to a complete implementation in a few iterations, with the programmer correcting counterexamples resulting from underspecified transitions by adding concrete examples in each iteration.

关键词： Program Synthesis Distributed Protocol Synthesis Cache Coherence Protocols programming by Example

来源：评论

学校读者我要写书评

暂无评论

Latte: A language, Compiler, and Runtime for Elegant and Efficient Deep Neural Networks 16

Latte: A Language, Compiler, and Runtime for Elegant and Eff...

引用

37th acm sigplan conference on programming language design and implementation

作者： Truong, Leonard Barik, Rajkishore Totoni, Ehsan Liu, Hai Markley, Chick Fox, Armando Shpeisman, Tatiana Univ Calif Berkeley Intel Labs Berkeley CA USA Intel Labs Berkeley CA USA Univ Calif Berkeley Berkeley CA USA

ISBN: (纸本)9781450342612

Deep neural networks (DNNs) have undergone a surge in popularity with consistent advances in the state of the art for tasks including image recognition, natural language processing, and speech recognition. the computationally expensive nature of these networks has led to the proliferation of implementations that sacrifice abstraction for high performance. In this paper, we present Latte, a domain-specific language for DNNs that provides a natural abstraction for specifying new layers without sacrificing performance. Users of Latte express DNNs as ensembles of neurons with connections between them. the Latte compiler synthesizes a program based on the user specification, applies a suite of domain-specific and general optimizations, and emits efficient machine code for heterogeneous architectures. Latte also includes a communication runtime for distributed memory data-parallelism. Using networks described using Latte, we demonstrate 3-6x speedup over Caffe (C++/MKL) on the three state-of-the-art ImageNet models executing on an Intel Xeon E5-2699 v3 x86 CPU.

关键词： Deep Learning Neural Networks Domain Specific language Compiler Optimization

来源：评论

学校读者我要写书评

暂无评论

Polyhedral Auto-transformation with No Integer Linear programming 2018

Polyhedral Auto-transformation with No Integer Linear Progra...

引用

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

作者： Acharya, Aravind Bondhugula, Uday Cohen, Albert Indian Inst Sci Dept Comp Sci & Automat Bangalore Karnataka India INRIA Paris France DI Ecole Normale Super Paris France

ISBN: (纸本)9781450356985

State-of-the-art algorithms used in automatic polyhedral transformation for parallelization and locality optimization typically rely on Integer Linear programming (ILP). this poses a scalability issue when scaling to tens or hundreds of statements, and may be disconcerting in production compiler settings. In this work, we consider relaxing integrality in the ILP formulation of the Pluto algorithm, a popular algorithm used to find good affine transformations. We show that the rational solutions obtained from the relaxed LP formulation can easily be scaled to valid integral ones to obtain desired solutions, although with some caveats. We first present formal results connecting the solution of the relaxed LP to the original Pluto ILP. We then show that there are difficulties in realizing the above theoretical results in practice, and propose an alternate approach to overcome those while still leveraging linear programming. Our new approach obtains dramatic compile-time speedups for a range of large benchmarks. While achieving these compile-time improvements, we show that the performance of the transformed code is not sacrificed. Our approach to automatic transformation provides a mean compilation time improvement of 5.6x over state-of-the-art on relevant challenging benchmarks from the NAS PB, SPEC CPU 2006, and PolyBench suites. We also came across situations where prior frameworks failed to find a transformation in a reasonable amount of time, while our new approach did so instantaneously.

关键词： Polyhedral transformation Pluto algorithm

来源：评论

学校读者我要写书评

暂无评论

A Domain-Specific language for Microservices 9

A Domain-Specific Language for Microservices

引用

9th acm sigplan International Symposium on Scala (Scala) as part of the acm sigplan International conference on Functional programming (ICFP)

作者： Donham, Jacob Twitter Inc San Francisco CA 94103 USA

ISBN: (纸本)9781450358361

A common architectural pattern for complex online systems is a collection of "microservices" communicating via RPC interfaces. A service architecture provides autonomy for teams to develop, deploy, and operate system modules without centralized coordination. But this autonomy comes at a cost in leverage-the fixed costs of running a service are high, and the desire to avoid them can lead to poor design choices. In this paper we describe Strato, a system built at Twitter that runs many microservices hosted in a shared service platform-trading a little autonomy for a lot of leverage. Hosted microservices are written in a Scala-like DSL that supports transparent concurrency and native access to thrift data (the common currency of services at Twitter). the DSL compiles to a concurrency library written in Scala with an arrows-based interface. We detail the design and implementation of the DSL and concurrency library, and evaluate the effectiveness of Strato in improving leverage at Twitter.

关键词： Scala microservices

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共25页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：