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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

491 篇 会议
37 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

488 篇 工学
- 485 篇 软件工程
- 291 篇 计算机科学与技术...
- 22 篇 控制科学与工程
- 6 篇 信息与通信工程
- 4 篇 电子科学与技术（可...
- 3 篇 化学工程与技术
- 2 篇 安全科学与工程
- 1 篇 动力工程及工程热...
- 1 篇 电气工程
- 1 篇 航空宇航科学与技...
77 篇 理学
- 71 篇 数学
- 6 篇 统计学（可授理学、...
- 5 篇 系统科学
- 3 篇 化学
- 1 篇 物理学
- 1 篇 生物学
35 篇 管理学
- 25 篇 管理科学与工程(可...
- 20 篇 工商管理
- 13 篇 图书情报与档案管...
4 篇 经济学
- 4 篇 应用经济学
2 篇 法学
- 2 篇 社会学
2 篇 教育学
- 2 篇 教育学

主题

75 篇 design
66 篇 languages
65 篇 performance
43 篇 computer program...
38 篇 algorithms
36 篇 computer program...
31 篇 experimentation
24 篇 verification
23 篇 reliability
23 篇 program synthesi...
22 篇 probabilistic pr...
20 篇 java programming...
15 篇 functional progr...
13 篇 object oriented ...
12 篇 c (programming l...
11 篇 computer systems...
11 篇 static analysis
11 篇 measurement
11 篇 concurrency
10 篇 compilers

机构

12 篇 carnegie mellon ...
9 篇 univ michigan an...
9 篇 univ wisconsin m...
9 篇 princeton univ p...
8 篇 univ penn philad...
8 篇 purdue univ w la...
8 篇 stanford univ st...
8 篇 univ washington ...
8 篇 univ texas austi...
7 篇 mit cambridge ma...
6 篇 microsoft res re...
6 篇 swiss fed inst t...
6 篇 yale univ new ha...
6 篇 harvard univ cam...
6 篇 cornell univ ith...
5 篇 ibm research
5 篇 microsoft resear...
5 篇 univ calif berke...
4 篇 carnegie mellon ...
4 篇 microsoft res re...

作者

7 篇 dillig isil
6 篇 august david i.
6 篇 gulwani sumit
5 篇 mckinley kathryn...
5 篇 grossman dan
5 篇 aiken alex
5 篇 vechev martin
5 篇 bacon david f.
5 篇 su zhendong
5 篇 solar-lezama arm...
5 篇 myers andrew c.
5 篇 millstein todd
5 篇 walker david
5 篇 mansinghka vikas...
4 篇 wang xinyu
4 篇 nakatani t
4 篇 cheng perry
4 篇 adl-tabatabai al...
4 篇 gehr timon
4 篇 lueh guei-yuan

语言

526 篇 英文
2 篇 其他

检索条件"任意字段=PLDI 2006 - 2006 ACM SIGPLAN Conference on Programming Language Design and Implementation"

共 528 条记录，以下是241-250 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Optimizing dynamically-dispatched calls with run-time type feedback 94

Optimizing dynamically-dispatched calls with run-time type f...

引用

Proceedings of the acm sigplan'94 conference on programming language design and implementation (pldi)

作者： Holzle, Urs Ungar, David Stanford Univ Stanford CA United States

ISBN: (纸本)089791662X

Object-oriented programs are difficult to optimize because they execute many dynamically-dispatched calls. These calls cannot easily be eliminated because the compiler does not know which callee will be invoked at runtime. We have developed a simple technique that feeds back type information from the runtime system to the compiler. With this type feedback, the compiler can inline any dynamically-dispatched call. Our compiler drastically reduces the call frequency of a suite of large SELF applications (by a factor of 3.6) and improves performance by a factor of 1.7. We believe that type feedback could significantly reduce call frequencies and improve performance for most other object-oriented languages (statically-typed or not) as well as for languages with type-dependent operations such as generic arithmetic.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Web Question Answering with Neurosymbolic Program Synthesis 2021

Web Question Answering with Neurosymbolic Program Synthesis

引用

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

作者： Chen, Qiaochu Lamoreaux, Aaron Wang, Xinyu Durrett, Greg Bastani, Osbert Dillig, Isil Univ Texas Austin Austin TX 78712 USA Univ Michigan Ann Arbor MI 48109 USA Univ Penn Philadelphia PA 19104 USA

ISBN: (纸本)9781450383912

In this paper, we propose a new technique based on program synthesis for extracting information from webpages. Given a natural language query and a few labeled webpages, our method synthesizes a program that can be used to extract similar types of information from other unlabeled webpages. To handle websites with diverse structure, our approach employs a neurosymbolic DSL that incorporates both neural NLP models as well as standard language constructs for tree navigation and string manipulation. We also propose an optimal synthesis algorithm that generates all DSL programs that achieve optimal F-1 score on the training examples. Our synthesis technique is compositional, prunes the search space by exploiting a monotonicity property of the DSL, and uses transductive learning to select programs with good generalization power. We have implemented these ideas in a new tool called WEBQA and evaluate it on 25 different tasks across multiple domains. Our experiments show that WEBQA significantly outperforms existing tools such as state-of-the-art question answering models and wrapper induction systems.

关键词： Program Synthesis programming by Example Web Information Extraction

来源：评论

学校读者我要写书评

暂无评论

Reticle: A Virtual Machine for programming Modern FPGAs 2021

Reticle: A Virtual Machine for Programming Modern FPGAs

引用

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

作者： Vega, Luis McMahan, Joseph Sampson, Adrian Grossman, Dan Ceze, Luis Univ Washington Seattle WA 98195 USA Cornell Univ Ithaca NY 14853 USA

ISBN: (纸本)9781450383912

Modern field-programmable gate arrays (FPGAs) have recently powered high-profile efficiency gains in systems from datacenters to embedded devices by offering ensembles of heterogeneous, reconfigurable hardware units. programming stacks for FPGAs, however, are stuck in the past-they are based on traditional hardware languages, which were appropriate when FPGAs were simple, homogeneous fabrics of basic programmable primitives. We describe Reticle, a new low-level abstraction for FPGA programming that, unlike existing languages, explicitly represents the special-purpose units available on a particular FPGA device. Reticle has two levels: a portable intermediate language and a target-specific assembly language. We show how to use a standard instruction selection approach to lower intermediate programs to assembly programs, which can be both faster and more effective than the complex metaheuristics that existing FPGA toolchains use. We use Reticle to implement linear algebra operators and coroutines and find that Reticle compilation runs up to 100 times faster than current approaches while producing comparable or better run-time and utilization.

关键词： compilers FPGAs

来源：评论

学校读者我要写书评

暂无评论

Interactive Parser Synthesis by Example 15

Interactive Parser Synthesis by Example

引用

36th acm sigplan conference on programming language design and implementation

作者： Leung, Alan Sarracino, John Lerner, Sorin Univ Calif San Diego San Diego CA 92103 USA

ISBN: (纸本)9781450334686

Despite decades of research on parsing, the construction of parsers remains a painstaking, manual process prone to subtle bugs and pitfalls. We present a programming-by-example framework called Parsify that is able to synthesize a parser from input/output examples. The user does not write a single line of code. To achieve this, Parsify provides: (a) an iterative algorithm for synthesizing and refining a grammar one example at a time, (b) an interface that provides immediate visual feedback in response to changes in the grammar being refined, and (c) a graphical mechanism for specifying example parse trees using only textual selections. We empirically demonstrate the viability of our approach by using Parsify to construct parsers for source code drawn from Verilog, SQL, Apache, and Tiger.

关键词： Algorithms Human Factors languages Parsing programming by Example Program Synthesis

来源：评论

学校读者我要写书评

暂无评论

Practical dependence testing 91

Practical dependence testing

引用

1991 acm sigplan 1991 conference on programming language design and implementation, pldi 1991

作者： Goff, Gina Kennedy, Ken Tseng, Chau-Wen Department of Computer Science Rice University HoustonTX77251-1892 United States

ISBN: (纸本)0897914287

Precise and efficient dependence tests are essential to the effectiveness of a parallelizing compiler. This paper proposes a dependence testing scheme based on classifying pairs of subscripted variable references. Exact yet fast dependence tests are presented for certain classes of array references, as well as empirical results showing that these references dominate scientific Fortran codes. These dependence tests are being implemented at Rice University in both PFC, a parallelizing compiler, and ParaScope, a parallel programming environment. © 1991 acm.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Generational garbage collection and the radioactive decay model 97

Generational garbage collection and the radioactive decay mo...

引用

Proceedings of the 1997 acm SIGPLAM conference on programming language design and implementation, pldi

作者： Clinger, William D. Hansen, Lars T. Northeastern Univ United States

ISBN: (纸本)9780897919074

If a fixed exponentially decreasing probability distribution function is used to model every object's lifetime, then the age of an object gives no information about its future life expectancy. This radioactive decay model implies there can be no rational basis for deciding which live objects should be promoted to another generation. Yet there remains a rational basis for deciding how many objects to promote, when to collect garbage, and which generations to collect. Analysis of the model leads to a new kind of generational garbage collector whose effectiveness does not depend upon heuristics that predict which objects will live longer than others. This result provides insight into the computational advantages of generational garbage collection, with implications for the management of objects whose life expectancies are difficult to predict.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Towards an API for the Real Numbers 2020

Towards an API for the Real Numbers

引用

41st acm sigplan conference on programming language design and implementation (pldi)

作者： Boehm, Hans-J Google Mountain View CA 94043 USA

ISBN: (纸本)9781450376136

The real numbers are pervasive, both in daily life, and in mathematics. Students spend much time studying their properties. Yet computers and programming languages generally provide only an approximation geared towards performance, at the expense of many of the nice properties we were taught in high school. Although this is entirely appropriate for many applications, particularly those that are sensitive to arithmetic performance in the usual sense, we argue that there are others where it is a poor choice. If arithmetic computations and result are directly exposed to human users who are not floating point experts, floating point approximations tend to be viewed as bugs. For applications such as calculators, spreadsheets, and various verification tasks, the cost of precision sacrifices is high, and the performance benefit is often not critical. We argue that previous attempts to provide accurate and understandable results for such applications using the recursive reals were great steps in the right direction, but they do not suffice. Comparing recursive reals diverges if they are equal. In many cases, comparison of numbers, including equal ones, is both important, particularly in simple cases, and intractable in the general case. We propose an API for a real number type that explicitly provides decidable equality in the easy common cases, in which it is often unnatural not to. We describe a surprisingly compact and simple implementation in detail. The approach relies heavily on classical number theory results. We demonstrate the utility of such a facility in two applications: testing floating point functions, and to implement arithmetic in Google's Android calculator application.

关键词： real numbers API design comparison decidability

来源：评论

学校读者我要写书评

暂无评论

GUM: a portable parallel implementation of Haskell

GUM: a portable parallel implementation of Haskell

引用

Proceedings of the acm sigplan'96 conference on programming language design and implementation, pldi

作者： Trinder, P.W. Hammond, K. Mattson Jr., J.S. Partridge, A.S. Jones, S.L.Peyton Glasgow Univ Glasgow United Kingdom

GUM is a portable, parallel implementation of the Haskell functional language. Despite sustained research interest in parallel functional programming, GUM is one of the first such systems to be made publicly available. GUM is message-based, and portability is facilitated by using the PVM communications harness that is available on many multi-processors. As a result, GUM is available for both shared-memory (Sun SPARCserver multiprocessors) and distributed-memory (networks of workstations) architectures. The high message-latency of distributed machines is ameliorated by sending messages asynchronously, and by sending large packets of related data in each message. Initial performance figures demonstrate absolute speedups relative to the best sequential compiler technology. To improve the performance of a parallel Haskell program GUM provides tools for monitoring and visualising the behaviour of threads and of processors during execution.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共53页 << < 21 22 23 24 25 26 27 28 29 30 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：