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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

278 篇 会议
40 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

274 篇 工学
- 267 篇 软件工程
- 140 篇 计算机科学与技术...
- 7 篇 电气工程
- 3 篇 生物工程
- 2 篇 信息与通信工程
- 2 篇 控制科学与工程
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 化学工程与技术
- 1 篇 纺织科学与工程
- 1 篇 生物医学工程（可授...
10 篇 理学
- 8 篇 数学
- 1 篇 化学
- 1 篇 地质学
- 1 篇 生物学
6 篇 管理学
- 3 篇 管理科学与工程(可...
- 3 篇 图书情报与档案管...
2 篇 农学
- 2 篇 作物学
1 篇 教育学
- 1 篇 教育学

主题

80 篇 design
73 篇 languages
32 篇 performance
17 篇 verification
16 篇 algorithms
14 篇 reliability
14 篇 probabilistic pr...
13 篇 object oriented ...
13 篇 program synthesi...
13 篇 domain-specific ...
13 篇 functional progr...
11 篇 java
10 篇 experimentation
10 篇 programming lang...
9 篇 type systems
9 篇 theory
9 篇 concurrency
7 篇 compilers
7 篇 optimization
6 篇 modules

机构

9 篇 carnegie mellon ...
8 篇 purdue univ w la...
6 篇 princeton univ p...
5 篇 northeastern uni...
5 篇 yale univ new ha...
5 篇 harvard univ cam...
5 篇 cornell univ ith...
5 篇 univ washington ...
5 篇 univ calif berke...
4 篇 univ wisconsin m...
4 篇 univ calif davis...
4 篇 univ utah salt l...
4 篇 univ penn philad...
4 篇 rice univ housto...
4 篇 univ chicago il ...
4 篇 stanford univ st...
4 篇 univ texas austi...
3 篇 mit csail cambri...
3 篇 univ cambridge c...
3 篇 microsoft res re...

作者

7 篇 walker david
6 篇 foster nate
5 篇 shao zhong
5 篇 gulwani sumit
5 篇 dillig isil
4 篇 rainey mike
4 篇 gu ronghui
4 篇 rompf tiark
4 篇 solar-lezama arm...
4 篇 chaudhuri swarat
4 篇 myers andrew c.
4 篇 wansbrough keith
3 篇 hirschfeld rober...
3 篇 flatt matthew
3 篇 rajamani sriram
3 篇 seshia sanjit a.
3 篇 rajan hridesh
3 篇 huang jeff
3 篇 liu yu david
3 篇 vechev martin

语言

283 篇 英文
34 篇 其他
1 篇 中文

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

共 318 条记录，以下是171-180 订阅

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

详细简洁

排序：

Green-Marl: A DSL for Easy and Efficient Graph Analysis

Green-Marl: A DSL for Easy and Efficient Graph Analysis

引用

17th International conference on Architectural Support for programming languages and Operating Systems

作者： Hong, Sungpack Chafi, Hassan Sedlar, Eric Olukotun, Kunle Stanford Univ Pervas Parallelism Lab Stanford CA 94305 USA

ISBN: (纸本)9781450307598

the increasing importance of graph-data based applications is fueling the need for highly efficient and parallel implementations of graph analysis software. In this paper we describe Green-Marl, a domain-specific language (DSL) whose high level language constructs allow developers to describe their graph analysis algorithms intuitively, but expose the data-level parallelism inherent in the algorithms. We also present our Green-Marl compiler which translates high-level algorithmic description written in Green-Marl into an efficient C++ implementation by exploiting this exposed data-level parallelism. Furthermore, our Green-Marl compiler applies a set of optimizations that take advantage of the high-level semantic knowledge encoded in the Green-Marl DSL. We demonstrate that graph analysis algorithms can be written very intuitively with Green-Marl through some examples, and our experimental results show that the compiler-generated implementation out of such descriptions performs as well as or better than highly-tuned handcoded implementations.

关键词： Algorithms design Performance Graph Domain-Specific language Parallel programming

来源：评论

学校读者我要写书评

暂无评论

MORBIG: A Static Parser for POSIX Shell 11

MORBIG: A Static Parser for POSIX Shell

引用

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

作者： Regis-Gianas, Yann Jeannerod, Nicolas Treinen, Ralf Univ Paris Diderot CNRS INRIA IRIFPI R2 Paris France Univ Paris Diderot CNRS IRIF Ecole Normale Super Paris France Univ Paris Diderot CNRS IRIF Paris France

ISBN: (纸本)9781450360296

the POSIX shell language defies conventional wisdom of compiler construction on several levels: the shell language was not designed for static parsing, but with an intertwining of syntactic analysis and execution by expansion in mind. Token recognition cannot be specified by regular expressions, lexical analysis depends on the parsing context and the evaluation context, and the shell grammar given in the specification is ambiguous. Besides, the unorthodox design choices of the shell language fit badly in the usual specification languages used to describe other programming languages. this makes the standard usage of LEX and YACC as a pipeline inadequate for the implementation of a parser for POSIX shell. the existing implementations of shell parsers are complex and use low-level character-level parsing code which is difficult to relate to the POSIX specification. We find it hard to trust such parsers, especially when using them for writing automatic verification tools for shell scripts. this paper offers an overview of the technical difficulties related to the syntactic analysis of the POSIX shell language. It also describes how we have resolved these difficulties using advanced parsing techniques (namely speculative parsing, parser state introspection, context-dependent lexical analysis and longest-prefix parsing) while keeping the implementation at a sufficiently high level of abstraction so that experts can check that the POSIX standard is respected. the resulting tool, called MORBIG, is an open-source static parser for a well-defined and realistic subset of the POSIX shell language.

关键词： Parsing POSIX shell functional programming

来源：评论

学校读者我要写书评

暂无评论

Maximal Sound Predictive Race Detection with Control Flow Abstraction 14

Maximal Sound Predictive Race Detection with Control Flow Ab...

引用

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

作者： Huang, Jeff Meredith, Patrick O'Neil Rosu, Grigore Univ Illinois Dept Comp Sci Urbana IL 61801 USA

ISBN: (纸本)9781450327848

Despite the numerous static and dynamic program analysis techniques in the literature, data races remain one of the most common bugs in modern concurrent software. Further, the techniques that do exist either have limited detection capability or are unsound, meaning that they report false positives. We present a sound race detection technique that achieves a provably higher detection capability than existing sound techniques. A key insight of our technique is the inclusion of abstracted control flow information into the execution model, which increases the space of the causal model permitted by classical happens-before or causally-precedes based detectors. By encoding the control flow and a minimal set of feasibility constraints as a group of first-order logic formulae, we formulate race detection as a constraint solving problem. Moreover, we formally prove that our formulation achieves the maximal possible detection capability for any sound dynamic race detector with respect to the same input trace under the sequential consistency memory model. We demonstrate via extensive experimentation that our technique detects more races than the other state-of-the-art sound race detection techniques, and that it is scalable to executions of real world concurrent applications with tens of millions of critical events. these experiments also revealed several previously unknown races in real systems (e. g., Eclipse) that have been confirmed or fixed by the developers. Our tool is also adopted by Eclipse developers.

关键词： Algorithms design theory Maximal Sound Data Race Prediction Control Flow

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

LaminarIR: Compile-Time Queues for Structured Streams 15

LaminarIR: Compile-Time Queues for Structured Streams

引用

36th acm sigplan conference on programming language design and implementation

作者： Ko, Yousun Burgstaller, Bernd Scholz, Bernhard Yonsei Univ Seoul 120749 South Korea Univ Sydney Sydney NSW 2006 Australia

ISBN: (纸本)9781450334686

Stream programming languages employ FIFO (first-in, first-out) semantics to model data channels between producers and consumers. A FIFO data channel stores tokens in a buffer that is accessed indirectly via read-and write-pointers. this indirect token-access decouples a producer's write-operations from the read-operations of the consumer, thereby making dataflow implicit. For a compiler, indirect token-access obscures data-dependencies, which renders standard optimizations ineffective and impacts stream program performance negatively. In this paper we propose a transformation for structured stream programming languages such as StreamIt that shifts FIFO buffer management from run-time to compile-time and eliminates splitters and joiners, whose task is to distribute and merge streams. To show the effectiveness of our lowering transformation, we have implemented a StreamIt to C compilation framework. We have developed our own intermediate representation (IR) called LaminarIR, which facilitates the transformation. We report on the enabling effect of the LaminarIR on LLVM's optimizations, which required the conversion of several standard StreamIt benchmarks from static to randomized input, to prevent computation of partial results at compile-time. We conducted our experimental evaluation on the Intel i7-2600K, AMD Opteron 6378, Intel Xeon Phi 3120A and ARM Cortex-A15 platforms. Our LaminarIR reduces data-communication on average by 35.9% and achieves platform-specific speedups between 3.73x and 4.98x over StreamIt. We reduce memory accesses by more than 60% and achieve energy savings of up to 93.6% on the Intel i7-2600K.

关键词： languages Algorithms Performance stream programming synchronous data flow program transformation performance analysis compiler optimization

来源：评论

学校读者我要写书评

暂无评论

SOAP 2019 - Proceedings of the 8th acm sigplan International Workshop on State of the Art in Program Analysis, co-located with PLDI 2019

SOAP 2019 - Proceedings of the 8th ACM SIGPLAN International...

引用

8th acm sigplan International Workshop on State Of the Art in Program Analysis, SOAP 2019, co-located with PLDI 2019

ISBN: (纸本)9781450367202

the proceedings contain 7 papers. the topics discussed include: fixpoint reuse for incremental JavaScript analysis;know your analysis: how instrumentation aids understanding static analysis;SootDiff: bytecode comparison across different Java compilers;modernizing parsing tools: parsing and analysis with object-oriented programming;commit-time incremental analysis;program analysis for process migration;and MetaDL: analyzing datalog in datalog.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ARRAY 2019 - Proceedings of the 6th acm sigplan International Workshop on Libraries, languages and Compilers for Array programming, co-located with PLDI 2019

ARRAY 2019 - Proceedings of the 6th ACM SIGPLAN Internationa...

引用

6th acm sigplan International Workshop on Libraries, languages and Compilers for Array programming, ARRAY 2019, co-located with PLDI 2019

ISBN: (纸本)9781450367172

the proceedings contain 9 papers. the topics discussed include: finite difference methods fengshui: alignment through a mathematics of arrays;data-parallel flattening by expansion;ALPyNA: acceleration of loops in python for novel architectures;high-level synthesis of functional patterns with lift;toward generalized tensor algebra for ab initio quantum chemistry methods;TeIL: a type-safe imperative tensor intermediate language;convolutional neural networks in APL;records with rank polymorphism;and linear algebraic depth-first search. © 2019 Association for Computing Machinery. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Typed Lua: An optional type system for Lua

Typed Lua: An optional type system for Lua

引用

8th Workshop on Dynamic languages and Applications, Dyla 2014, with PLDI 2014

作者： Maidl, André Murbach Mascarenhas, Fabio Ierusalimschy, Roberto PUC-Rio Rio de Janeiro Brazil UFRJ Rio de Janeiro Brazil

ISBN: (纸本)9781450329163

Dynamically typed languages trade flexibility and ease of use for safety, while statically typed languages prioritize the early detection of bugs, and provide a better framework for structure large programs. the idea of optional typing is to combine the two approaches in the same language: the programmer can begin development with dynamic types, and migrate to static types as the program matures. the challenge is designing a type system that feels natural to the programmer that is used to programming in a dynamic language. this paper presents the initial design of Typed Lua, an optionally-typed extension of the Lua scripting language. Lua is an imperative scripting language with first class functions and lightweight metaprogramming mechanisms. the design of Typed Lua's type system has a novel combination of features that preserves some of the idioms that Lua programmers are used to, while bringing static type safety to them. We show how the major features of the type system type these idioms with some examples, and discuss some of the design issues we faced. © 2014 acm.

关键词： gradual typing Lua programming language optional typing type systems

来源：评论

学校读者我要写书评

暂无评论

Developing a stage lighting system for scratch

Developing a stage lighting system for scratch

引用

6th acm sigplan Internatinal conference on Functional programming (ICFP'01)

作者： Sperber, M. Wilhelm-Schickard-Institut fur Info. Universität Tübingen Tübingen Germany

Lula is a system for computer-assisted stage lighting design and control. Whereas other systems for the same purpose are usually the results of long chains of incremental improvements of historic concepts. Lula represents a complete redesign. Whereas other systems focus on control aspects of lighting. Lula focuses on design and generates control information from it. this approach gives significantly more flexibility to the lighting designer and shortens the design process itself. Lula's design and implementation draw from a number of disciplines in advanced programming. It is written in Scheme and runs atop PLT Scheme, and benefits from its high-level GUI library. Lula uses an algebraic model for lighting looks based on just three combinators. It employs Functional Reactive programming for all dynamic aspects of lighting, and is programmable via a functional-reactive domain-specific language. Lula is an actual product and has users who have neither interest in nor knowledge of functional programming.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Concrete syntax for objects - Domain-specific language embedding and assimilation without restrictions

Concrete syntax for objects - Domain-specific language embed...

引用

19th conference on Object-Oriented programming, Systems, languages, and Applications

作者： Bravenboer, M Visser, E Univ Utrecht Inst Comp & Informat Sci NL-3508 TB Utrecht Netherlands

ISBN: (纸本)1581138318

Application programmer's interfaces give access to domain knowledge encapsulated in class libraries without providing the appropriate notation for expressing domain composition. Since object-oriented languages are designed for extensibility and reuse, the language constructs are often sufficient for expressing domain abstractions at the semantic level. However, they do not provide the right abstractions at the syntactic level. In this paper we describe META BORG, a method for providing concrete syntax for domain abstractions to application programmers. the method consists of embedding domain-specific languages in a general purpose host language and assimilating the embedded domain code into the surrounding host code. Instead of extending the implementation of the host language, the assimilation phase implements domain abstractions in terms of existing APIs leaving the host language undisturbed. Indeed, META-BORG can be considered a method for promoting APIs to the language level. the method is supported by proven and available technology, i.e. the syntax definition formalism SDF and the program transformation language and toolset Stratego/XT. We illustrate the method with applications in three domains: code generation, XML generation, and user-interface construction.

关键词： languages design METABORG stratego SDF embedded languages syntax extension extensible syntax domain-specific languages rewriting meta programming concrete object syntax

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共32页 << < 14 15 16 17 18 19 20 21 22 23 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：