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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是131-140 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Persistency for Synchronization-Free Regions 2018

Persistency for Synchronization-Free Regions

引用

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

作者： Gogte, Vaibhav Diestelhorst, Stephan Wang, William Narayanasamy, Satish Chen, Peter M. Wenisch, thomas F. Univ Michigan Ann Arbor MI 48109 USA Arm Res Cambridge England

ISBN: (纸本)9781450356985

Nascent persistent memory (PM) technologies promise the performance of DRAM with the durability of disk, but how best to integrate them into programming systems remains an open question. Recent work extends language memory models with a persistency model prescribing semantics for updates to PM. these semantics enable programmers to design data structures in PM that are accessed like memory and yet are recoverable upon crash or failure. Alas, we find the semantics and performance of existing approaches unsatisfying. Existing approaches require high-overhead mechanisms, are restricted to certain synchronization constructs, provide incomplete semantics, and/or may recover to state that cannot arise in fault-free execution. We propose persistency semantics that guarantee failure atomicity of synchronization-free regions (SFRs) -program regions delimited by synchronization operations. Our approach provides clear semantics for the PM state recovery code may observe and extends C++11's "sequential consistency for data-race-free" guarantee to post-failure recovery code. We investigate two designs for failure-atomic SFRs that vary in performance and the degree to which commit of persistent state may lag execution. We demonstrate both approaches in LLVM v3.6.0 and compare to a state-of-the-art baseline to show performance improvement up to 87.5% (65.5% avg).

关键词： Persistent memories persistency models language memory models failure-atomicity synchronization-free regions

来源：评论

学校读者我要写书评

暂无评论

To-Many or To-One? All-in-One! Efficient Purely Functional Multi-maps with Type-Heterogeneous Hash-Tries 2018

To-Many or To-One? All-in-One! Efficient Purely Functional M...

引用

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

作者： Steindorfer, Michael J. Vinju, Jurgen J. Delft Univ Technol Delft Netherlands Ctr Wiskunde & Informat Amsterdam Netherlands TU Eindhoven Eindhoven Netherlands

ISBN: (纸本)9781450356985

An immutable multi-map is a many-to-many map data structure with expected fast insert and lookup operations. this data structure is used for applications processing graphs or many-to-many relations as applied in compilers, runtimes of programming languages, or in static analysis of object-oriented systems. Collection data structures are assumed to carefully balance execution time of operations with memory consumption characteristics and need to scale gracefully from a few elements to multiple gigabytes at least. When processing larger in-memory data sets the overhead of the data structure encoding itself becomes a memory usage bottleneck, dominating the overall performance. In this paper we propose AXIOM, a novel hash-trie data structure that allows for a highly efficient and type-safe multi-map encoding by distinguishing inlined values of singleton sets from nested sets of multi-mappings. AXIOM strictly generalizes over previous hash-trie data structures by supporting the processing of fine-grained type-heterogeneous content on the implementation level (while API and language support for type-heterogeneity are not scope of this paper). We detail the design and optimizations of AXIOM and further compare it against state-of-the-art immutable maps and multi-maps in Java, Scala and Clojure. We isolate key differences using microbenchmarks and validate the resulting conclusions on a case study in static analysis. AXIOM reduces the key-value storage overhead by 1.87 x;with specializing and inlining across collection boundaries it improves by 5.1 x.

关键词： Data structures persistent data structures functional programming hashtable multi-map many-to-many relation graph optimization performance JVM

来源：评论

学校读者我要写书评

暂无评论

A Play on Regular Expressions Functional Pearl 10

A Play on Regular Expressions Functional Pearl

引用

15th acm sigplan International conference on Functional programming

作者： Fischer, Sebastian Huch, Frank Wilke, thomas Univ Kiel D-24098 Kiel Germany

ISBN: (纸本)9781605587943

Cody, Hazel, and theo, two experienced Haskell programmers and an expert in automata theory, develop an elegant Haskell program for matching regular expressions: (i) the program is purely functional;(ii) it is overloaded over arbitrary semirings, which not only allows to solve the ordinary matching problem but also supports other applications like computing leftmost longest matchings or the number of matchings, all with a single algorithm;(iii) it is more powerful than other matchers, as it can be used for parsing every context-free language by taking advantage of laziness. the developed program is based on an old technique to turn regular expressions into finite automata which makes it efficient both in terms of worst-case time and space bounds and actual performance: despite its simplicity, the Haskell implementation can compete with a recently published professional C++ program for the same problem.

关键词： Algorithms design regular expressions finite automata Glushkov construction purely functional programming

来源：评论

学校读者我要写书评

暂无评论

FaCT: A DSL for Timing-Sensitive Computation 2019

FaCT: A DSL for Timing-Sensitive Computation

引用

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

作者： Cauligi, Sunjay Soeller, Gary Johannesmeyer, Brian Brown, Fraser Wahby, Riad S. Renner, John Gregoire, Benjamin Barthe, Gilles Jhala, Ranjit Stefan, Deian Univ Calif San Diego La Jolla CA 92093 USA INRIA Sophia Antipolis Biot France MPI Secur & Privacy Saarbrucken Germany IMDEA Software Inst Madrid Spain

ISBN: (纸本)9781450367127

Real-world cryptographic code is often written in a subset of C intended to execute in constant-time, thereby avoiding timing side channel vulnerabilities. this C subset eschews structured programming as we know it: if-statements, looping constructs, and procedural abstractions can leak timing information when handling sensitive data. the resulting obfuscation has led to subtle bugs, even in widely-used high-profile libraries like OpenSSL. To address the challenge of writing constant-time cryptographic code, we present FaCT, a crypto DSL that provides high-level but safe language constructs. the FaCT compiler uses a secrecy type system to automatically transform potentially timing-sensitive high-level code into low-level, constant-time LLVM bitcode. We develop the language and type system, formalize the constant-time transformation, and present an empirical evaluation that uses FaCT to implement core crypto routines from several open-source projects including OpenSSL, libsodium, and curve25519-donna. Our evaluation shows that FaCT's design makes it possible to write readable, high-level cryptographic code, with efficient, constant-time behavior.

关键词： domain-specific language program transformation cryptography

来源：评论

学校读者我要写书评

暂无评论

Supporting Speculative Parallelization in the Presence of Dynamic Data Structures 10

Supporting Speculative Parallelization in the Presence of Dy...

引用

acm sigplan conference on programming language design and implementation

作者： Tian, Chen Feng, Min Gupta, Rajiv Univ Calif Riverside CSE Dept Riverside CA 92521 USA

ISBN: (纸本)9781450300193

the availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization of sequential programs. Isolation of speculative state from non-speculative state forms the basis of such speculative techniques as this separation enables recovery from misspeculations. In our prior work on CorD [35, 36] we showed that for array and scalar variable based programs copying of data between speculative and non-speculative memory can be highly optimized to support state separation that yields significant speedups on multicore machines available today. However, we observe that in context of heap-intensive programs that operate on linked dynamic data structures, state separation based speculative parallelization poses many challenges. the copying of data structures from non-speculative to speculative state (copy-in operation) can be very expensive due to the large sizes of dynamic data structures. the copying of updated data structures from speculative state to non-speculative state (copy-out operation) is made complex due to the changes in the shape and size of the dynamic data structure made by the speculative computation. In addition, we must contend with the need to translate pointers internal to dynamic data structures between their non-speculative and speculative memory addresses. In this paper we develop an augmented design for the representation of dynamic data structures such that all of the above operations can be performed efficiently. Our experiments demonstrate significant speedups on a real machine for a set of programs that make extensive use of heap based dynamic data structures.

关键词： Performance languages design Experimentation Speculative Parallelization Multicore Processors

来源：评论

学校读者我要写书评

暂无评论

Spatial: A language and Compiler for Application Accelerators 2018

Spatial: A Language and Compiler for Application Accelerator...

引用

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

作者： Koeplinger, David Feldman, Matthew Prabhakar, Raghu Zhang, Yaqi Hadjis, Stefan Fiszel, Ruben Zhao, Tian Nardi, Luigi Pedram, Ardavan Kozyrakis, Christos Olukotun, Kunle Stanford Univ Stanford CA 94305 USA Ecole Polytech Fed Lausanne Lausanne Switzerland

ISBN: (纸本)9781450356985

Industry is increasingly turning to reconfigurable architectures like FPGAs and CGRAs for improved performance and energy efficiency. Unfortunately, adoption of these architectures has been limited by their programming models. HDLs lack abstractions for productivity and are difficult to target from higher level languages. HLS tools are more productive, but offer an ad-hoc mix of software and hardware abstractions which make performance optimizations difficult. In this work, we describe a new domain-specific language and compiler called Spatial for higher level descriptions of application accelerators. We describe Spatial's hardware-centric abstractions for both programmer productivity and design performance, and summarize the compiler passes required to support these abstractions, including pipeline scheduling, automatic memory banking, and automated design tuning driven by active machine learning. We demonstrate the language's ability to target FPGAs and CGRAs from common source code. We show that applications written in Spatial are, on average, 42% shorter and achieve a mean speedup of 2.9x over SDAccel HLS when targeting a Xilinx UltraScale+ VU9P FPGA on an Amazon EC2 F1 instance.

关键词： domain-specific languages compilers hardware accelerators high-level synthesis reconfigurable architectures FPGAs CGRAs

来源：评论

学校读者我要写书评

暂无评论

Lightweight Multi-language Syntax Transformation with Parser Parser Combinators 2019

Lightweight Multi-Language Syntax Transformation with Parser...

引用

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

作者： van Tonder, Rijnard Le Goues, Claire Carnegie Mellon Univ Sch Comp Sci Pittsburgh PA 15213 USA

ISBN: (纸本)9781450367127

Automatically transforming programs is hard, yet critical for automated program refactoring, rewriting, and repair. Multi-language syntax transformation is especially hard due to heterogeneous representations in syntax, parse trees, and abstract syntax trees (ASTs). Our insight is that the problem can be decomposed such that (1) a common grammar expresses the central context-free language (CFL) properties shared by many contemporary languages and (2) open extension points in the grammar allow customizing syntax (e.g., for balanced delimiters) and hooks in smaller parsers to handle language-specific syntax (e.g., for comments). Our key contribution operationalizes this decomposition using a Parser Parser combinator (PPC), a mechanism that generates parsers for matching syntactic fragments in source code by parsing declarative user-supplied templates. this allows our approach to detach from translating input programs to any particular abstract syntax tree representation, and lifts syntax rewriting to a modularly-defined parsing problem. A notable effect is that we skirt the complexity and burden of defining additional translation layers between concrete user input templates and an underlying abstract syntax representation. We demonstrate that these ideas admit efficient and declarative rewrite templates across 12 languages, and validate effectiveness of our approach by producing correct and desirable lightweight transformations on popular real-world projects (over 50 syntactic changes produced by our approach have been merged into 40+). Our declarative rewrite patterns require an order of magnitude less code compared to analog implementations in existing, language-specific tools.

关键词： syntax transformation parsers rewriting

来源：评论

学校读者我要写书评

暂无评论

It's alive! Continuous feedback in UI programming

It's alive! Continuous feedback in UI programming

引用

34th acm sigplan conference on programming language design and implementation, PLDI 2013

作者： Burckhardt, Sebastian De Halleux, Peli Moskal, Michal Fähndrich, Manuel McDirmid, Sean Tillmann, Nikolai Kato, Jun Microsoft Research United States University of Tokyo Japan

ISBN: (纸本)9781450320146

Live programming allows programmers to edit the code of a running program and immediately see the effect of the code changes. this tightening of the traditional edit-compile-run cycle reduces the cognitive gap between program code and execution, improving the learning experience of beginning programmers while boosting the productivity of seasoned ones. Unfortunately, live programming is difficult to realize in practice as imperative languages lack well-defined abstraction boundaries that make live programming responsive or its feedback comprehensible. this paper enables live programming for user interface programming by cleanly separating the rendering and non-rendering aspects of a UI program, allowing the display to be refreshed on a code change without restarting the program. A type and effect system formalizes this separation and provides an evaluation model that incorporates the code update step. By putting live programming on a more formal footing, we hope to enable critical and technical discussion of live programming systems. Copyright © 2013 acm.

关键词： Graphical user interfaces

来源：评论

学校读者我要写书评

暂无评论

POPL: TLDI'12 - proceedings of the 8th acm sigplan Workshop on Types in language design and implementation

POPL: TLDI'12 - Proceedings of the 8th ACM SIGPLAN Workshop ...

引用

8th acm sigplan Workshop on Types in language design and implementation, TLDI'12, Co-located with POPL 2012

ISBN: (纸本)9781450311205

the proceedings contain 8 papers. the topics discussed include: towards concurrent type theory;exact type parameterization and this type support;types for relaxed memory models;towards a formal semantics for a structurally dynamic noncausal modelling language;semantics for graphical user interfaces;giving Haskell a promotion;static lock capabilities for deadlock freedom;type systems for dummies;and row-based effect types for database integration.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共26页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：