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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,094 篇 会议
132 篇 期刊文献

馆藏范围

1,226 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,062 篇 工学
- 1,002 篇 软件工程
- 769 篇 计算机科学与技术...
- 43 篇 控制科学与工程
- 36 篇 电气工程
- 31 篇 信息与通信工程
- 8 篇 电子科学与技术（可...
- 7 篇 机械工程
- 5 篇 安全科学与工程
- 4 篇 材料科学与工程（可...
- 4 篇 建筑学
- 4 篇 土木工程
- 4 篇 化学工程与技术
- 4 篇 航空宇航科学与技...
- 4 篇 生物工程
- 2 篇 光学工程
- 2 篇 农业工程
134 篇 理学
- 111 篇 数学
- 14 篇 系统科学
- 8 篇 统计学（可授理学、...
- 6 篇 生物学
- 5 篇 物理学
- 4 篇 化学
82 篇 管理学
- 47 篇 管理科学与工程(可...
- 38 篇 图书情报与档案管...
- 27 篇 工商管理
12 篇 教育学
- 12 篇 教育学
7 篇 经济学
- 7 篇 应用经济学
6 篇 法学
- 5 篇 社会学
- 1 篇 法学
2 篇 农学
- 2 篇 作物学

主题

170 篇 design
157 篇 languages
99 篇 computer program...
96 篇 performance
57 篇 algorithms
54 篇 object oriented ...
51 篇 computer program...
43 篇 experimentation
39 篇 verification
34 篇 reliability
34 篇 java programming...
29 篇 functional progr...
26 篇 program synthesi...
26 篇 java
24 篇 probabilistic pr...
20 篇 concurrency
19 篇 domain-specific ...
19 篇 theory
18 篇 c (programming l...
17 篇 compilers

机构

16 篇 carnegie mellon ...
13 篇 princeton univ p...
11 篇 univ washington ...
11 篇 univ texas austi...
10 篇 univ michigan an...
10 篇 univ penn philad...
10 篇 rice univ housto...
10 篇 purdue univ w la...
10 篇 stanford univ st...
10 篇 univ calif berke...
9 篇 univ wisconsin m...
9 篇 yale univ new ha...
9 篇 harvard univ cam...
9 篇 cornell univ ith...
8 篇 microsoft res re...
8 篇 univ chicago il ...
7 篇 microsoft res re...
7 篇 swiss fed inst t...
7 篇 mit cambridge ma...
7 篇 northeastern uni...

作者

11 篇 walker david
10 篇 dillig isil
9 篇 chlipala adam
8 篇 shao zhong
8 篇 solar-lezama arm...
8 篇 chaudhuri swarat
8 篇 gulwani sumit
7 篇 august david i.
7 篇 bacon david f.
7 篇 sarkar vivek
6 篇 wang xinyu
6 篇 hendren laurie
6 篇 grossman dan
6 篇 adl-tabatabai al...
6 篇 aiken alex
6 篇 foster nate
6 篇 felleisen matthi...
6 篇 myers andrew c.
6 篇 mezini mira
6 篇 mahlke scott

语言

1,148 篇 英文
77 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation"

共 1226 条记录，以下是401-410 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Smooth Interpretation 10

Smooth Interpretation

引用

acm sigplan conference on programming language design and implementation

作者： Chaudhuri, Swarat Solar-Lezama, Armando Penn State Univ University Pk PA 16802 USA MIT Cambridge MA 02139 USA

ISBN: (纸本)9781450300193

We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of numerical search techniques like gradient descent for program analysis and synthesis. The method extends to programs the notion of Gaussian smoothing, a popular signal-processing technique that filters out noise and discontinuities from a signal by taking its convolution with a Gaussian function. In our setting, Gaussian smoothing executes a program according to a probabilistic semantics;the execution of program P on an input x after Gaussian smoothing can be summarized as follows: (1) Apply a Gaussian perturbation to x-the perturbed input is a random variable following a normal distribution with mean x. (2) Compute and return the expected output of P on this perturbed input. Computing the expectation explicitly would require the execution of P on all possible inputs, but smooth interpretation bypasses this requirement by using a form of symbolic execution to approximate the effect of Gaussian smoothing on P. The result is an efficient but approximate implementation of Gaussian smoothing of programs. Smooth interpretation has the effect of attenuating features of a program that impede numerical searches of its input space-for example, discontinuities resulting from conditional branches are replaced by continuous transitions. We apply smooth interpretation to the problem of synthesizing values of numerical control parameters in embedded control applications. This problem is naturally formulated as one of numerical optimization: the goal is to find parameter values that minimize the error between the resulting program and a programmer-provided behavioral specification. Solving this problem by directly applying numerical optimization techniques is often impractical due to the discontinuities in the error function. By eliminating these discontinuities, smooth interpretation makes it possible to

关键词： Theory design Verification Program Smoothing Continuity Parameter Synthesis Abstract Interpretation Operational Semantics

来源：评论

学校读者我要写书评

暂无评论

ABCD:: Eliminating array bounds checks on demand

<i>ABCD</i>:: Eliminating array bounds checks on demand

引用

acm sigplan' 00 conference on programming language design and implementation (PLDI)

作者： Bodik, R Gupta, R Sarkar, V Univ Wisconsin Madison WI 53706 USA Univ Arizona Tucson AZ 85721 USA IBM Corp TJ Watson Res Ctr Yorktown Hts NY 10598 USA

To guarantee typesafe execution, Java and other strongly typed languages require bounds checking of array accesses. Because array-bounds checks may raise exceptions, they block code motion of instructions with side effects, thus preventing many useful code optimizations, such as partial redundancy elimination or instruction scheduling of memory operations. Furthermore, because it is not expressible at bytecode level, the elimination of bounds checks can only be performed at run time, after the bytecode program is loaded. Using existing powerful bounds-check optimizers at run time is not feasible, however, because they are too heavyweight for the dynamic compilation setting. ABCD is a light-weight algorithm for elimination of Array Bounds Checks on Demand. Its design emphasizes simplicity and efficiency. In essence, ABCD works by adding a few edges to the SSA value graph and performing a simple traversal of the graph. Despite its simplicity, ABCD is surprisingly powerful. On our benchmarks, ABCD removes on average 45% of dynamic bound check instructions, sometimes achieving near-ideal optimization. The efficiency of ABCD stems from two factors. First, ABCD works on a sparse representation. As a result, it requires on average fewer than 10 simple analysis steps per bounds check. Second, ABCD is demand-driven. It can be applied to a set of frequently executed (hot) bounds checks, which makes it suitable for the dynamic-compilation setting, in which compile-time cost is constrained but hot statements are known.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Wire Sorts: A language Abstraction for Safe Hardware Composition 2021

Wire Sorts: A Language Abstraction for Safe Hardware Composi...

引用

42nd acm sigplan International conference on programming language design and implementation (PLDI)

作者： Christensen, Michael Sherwood, Timothy Balkind, Jonathan Hardekopf, Ben Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA

ISBN: (纸本)9781450383912

Effective digital hardware design fundamentally requires decomposing a design into a set of interconnected modules, each a distinct unit of computation and state. However, naively connecting hardware modules leads to real-world pathological cases which are surprisingly far from obvious when looking at the interfaces alone and which are very difficult to debug after synthesis. We show for the first time that it is possible to soundly abstract even complex combinational dependencies of arbitrary hardware modules through the assignment of IO ports to one of four new sorts which we call: to-sync, to-port, from-sync, and from-port. This new taxonomy, and the reasoning it enables, facilitates modularity by escalating problematic aspects of module input/output interaction to the language-level interface specification. We formalize and prove the soundness of our new wire sorts, implement them in a practical hardware description language, and demonstrate they can be applied and even inferred automatically at scale. Through an examination of the BaseJump STL, the OpenPiton manycore research platform, and a complete RISC-V implementation, we find that even on our biggest design containing 1.5 million primitive gates, analysis takes less than 31 seconds;that across 172 unique modules analyzed, the inferred sorts are widely distributed across our taxonomy;and that by using wire sorts, our tool is 2.6-33.9x faster at finding loops than standard synthesis-time cycle detection.

关键词： hardware description languages modules composition

来源：评论

学校读者我要写书评

暂无评论

Integrated language Definition Testing Enabling Test-Driven language Development 11

Integrated Language Definition Testing Enabling Test-Driven ...

引用

2011 acm International conference on Object Oriented programming Systems languages and Applications

作者： Kats, Lennart C. L. Vermaas, Rob Visser, Eelco Delft Univ Technol NL-2600 AA Delft Netherlands

ISBN: (纸本)9781450309400

The reliability of compilers, interpreters, and development environments for programming languages is essential for effective software development and maintenance. They are often tested only as an afterthought. languages with a smaller scope, such as domain-specific languages, often remain untested. General-purpose testing techniques and test case generation methods fall short in providing a low-threshold solution for test-driven language development. In this paper we introduce the notion of a language-parametric testing language (LPTL) that provides a reusable, generic basis for declaratively specifying language definition tests. We integrate the syntax, semantics, and editor services of a language under test into the LPTL for writing test inputs. This paper describes the design of an LPTL and the tool support provided for it, shows use cases using examples, and describes our implementation in the form of the Spoofax testing language.

关键词： languages Reliability Testing Test-Driven Development language Engineering Grammarware language Workbench Domain-Specific language language Embedding Compilers Parsers

来源：评论

学校读者我要写书评

暂无评论

Profile-directed optimization of event-based programs 02

Profile-directed optimization of event-based programs

引用

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

作者： Rajagopalan, Mohan Debray, Saumya K. Hiltunen, Matti A. Schlichting, Richard D. Department of Computer Science University of Arizona Tucson AZ 85721 United States

ISBN: (纸本)9781581134636

Events are used as a fundamental abstraction in programs ranging from graphical user interfaces (GUIs) to systems for building customized network protocols. While providing a flexible structuring and execution paradigm, events have the potentially serious drawback of extra execution overhead due to the indirection between modules that raise events and those that handle them. This paper describes an approach to addressing this issue using static optimization techniques. This approach, which exploits the underlying predictability often exhibited by event-based programs, is based on first profiling the program to identify commonly occurring event sequences. A variety of techniques that use the resulting profile information are then applied to the program to reduce the overheads associated with such mechanisms as indirect function calls and argument marshaling. In addition to describing the overall approach, experimental results are given that demonstrate the effectiveness of the techniques. These results are from event-based programs written for X Windows, a system for building GUIs, and Cactus, a system for constructing highly configurable distributed services and network protocols.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

The when, why and why not of the BETA programming language

The when, why and why not of the BETA programming language

引用

3rd acm sigplan History of programming languages conference, HOPL-III

作者： Kristensen, Bent Bruun Madsen, Ole Lehrmann Møller-Pedersen, Birger University of Southern Denmark Campusvej 55 DK-5230 Odense M Denmark University of Aarhus Åbogade 34 DK-8200 Århus N Denmark University of Oslo Gaustadalleen 23 NO-0316 Oslo Norway

ISBN: (纸本)9781595937667

This paper tells the story of the development of BETA: a programming language with just one abstraction mechanism, instead of one abstraction mechanism for each kind of program element (classes, types, procedures, functions, etc.). The paper explains how this single abstraction mechanism, the pattern, came about and how it was designed to be so powerful that it covered the other mechanisms. In addition to describing the technical challenge of capturing all programming elements with just one abstraction mechanism, the paper also explains how the language was based upon a modeling approach, so that it could be used for analysis, design and implementation. It also illustrates how this modeling approach guided and settled the design of specific language concepts. The paper compares the BETA programming language with other languages and explains how such a minimal language can still support modeling, even though it does not have some of the language mechanisms found in other object-oriented languages. Finally, the paper tries to convey the organization, working conditions and social life around the BETA project, which turned out to be a lifelong activity for Kristen Nygaard, the authors of this paper, and many others. © 2007 acm.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Cloning-based context-sensitive pointer alias analysis using binary decision diagrams

Cloning-based context-sensitive pointer alias analysis using...

引用

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

作者： Whaley, John Lam, Monica S. Computer Science Department Stanford University Stanford CA 94305 United States

This paper presents the first scalable context-sensitive, inclusion-based pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a method for every context of interest, and run a context-insensitive algorithm over the expanded call graph to get context-sensitive results. For precision, we generate a clone for every acyclic path through a program's call graph, treating methods in a strongly connected component as a single node. Normally, this formulation is hopelessly intractable as a call graph often has 1014 acyclic paths or more. We show that these exponential relations can be computed efficiently using binary decision diagrams (BDDs). Key to the scalability of the technique is a context numbering scheme that exposes the commonalities across contexts. We applied our algorithm to the most popular applications available on Sourceforge, and found that the largest programs, with hundreds of thousands of Java bytecodes, can be analyzed in under 20 minutes. This paper shows that pointer analysis, and many other queries and algorithms, can be described succinctly and declaratively using Datalog, a logic programming language. We have developed a system called bddbddb that automatically translates Datalog programs into highly efficient BDD implementations. We used this approach to develop a variety of context-sensitive algorithms including side effect analysis, type analysis, and escape analysis.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Compiling KB-Sized Machine Learning Models to Tiny IoT Devices 2019

Compiling KB-Sized Machine Learning Models to Tiny IoT Devic...

引用

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

作者： Gopinath, Sridhar Ghanathe, Nikhil Seshadri, Vivek Sharma, Rahul Microsoft Res Bengaluru India

ISBN: (纸本)9781450367127

Recent advances in machine learning (ML) have produced KiloByte-size models that can directly run on constrained IoT devices. This approach avoids expensive communication between IoT devices and the cloud, thereby enabling energy-efficient real-time analytics. However, ML models are expressed typically in floating-point, and IoT hardware typically does not support floating-point. Therefore, running these models on IoT devices requires simulating IEEE-754 floating-point using software, which is very inefficient. We present SeeDot, a domain-specific language to express ML inference algorithms and a compiler that compiles SeeDot programs to fixed-point code that can efficiently run on constrained IoT devices. We propose 1) a novel compilation strategy that reduces the search space for some key parameters used in the fixed-point code, and 2) new efficient implementations of expensive operations. SeeDot compiles state-of-the-art KB-sized models to various microcontrollers and low-end FPGAs. We show that SeeDot outperforms 1) software emulation of floating-point (Arduino), 2) high-bitwidth fixed-point (MATLAB), 3) post-training quantization (TensorFlow-Lite), and 4) floating- and fixed-point FPGA implementations generated using high-level synthesis tools.

关键词： Machine Learning IoT device programming language Compiler Fixed-point Microcontroller FPGA

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共123页 << < 37 38 39 40 41 42 43 44 45 46 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：