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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,118 篇 会议
137 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,082 篇 工学
- 1,011 篇 软件工程
- 776 篇 计算机科学与技术...
- 43 篇 控制科学与工程
- 42 篇 电气工程
- 40 篇 信息与通信工程
- 9 篇 电子科学与技术（可...
- 8 篇 机械工程
- 5 篇 安全科学与工程
- 4 篇 材料科学与工程（可...
- 4 篇 建筑学
- 4 篇 土木工程
- 4 篇 化学工程与技术
- 4 篇 航空宇航科学与技...
- 3 篇 生物工程
- 2 篇 光学工程
- 2 篇 农业工程
132 篇 理学
- 112 篇 数学
- 13 篇 系统科学
- 8 篇 统计学（可授理学、...
- 5 篇 生物学
- 4 篇 物理学
- 4 篇 化学
88 篇 管理学
- 52 篇 管理科学与工程(可...
- 40 篇 图书情报与档案管...
- 29 篇 工商管理
13 篇 教育学
- 13 篇 教育学
7 篇 经济学
- 7 篇 应用经济学
5 篇 法学
- 4 篇 社会学
- 1 篇 法学
2 篇 农学
- 2 篇 作物学

主题

185 篇 design
173 篇 languages
102 篇 performance
96 篇 computer program...
62 篇 algorithms
50 篇 computer program...
47 篇 object oriented ...
46 篇 experimentation
43 篇 java programming...
40 篇 verification
35 篇 reliability
32 篇 functional progr...
31 篇 java
26 篇 program synthesi...
24 篇 probabilistic pr...
21 篇 domain-specific ...
20 篇 measurement
20 篇 concurrency
19 篇 theory
19 篇 c (programming l...

机构

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 篇 mit cambridge ma...
8 篇 univ chicago il ...
7 篇 microsoft res re...
7 篇 swiss fed inst t...
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,173 篇 英文
81 篇 其他
1 篇 中文

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

共 1255 条记录，以下是61-70 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Toward Just-in-Time and language-Agnostic Mutation Testing 22

Toward Just-in-Time and Language-Agnostic Mutation Testing

引用

6th International conference on the Art, Science, and Engineering of programming (programming)

作者： Reschke, Stefan Mattis, Toni Niephaus, Fabio Hirschfeld, Robert Univ Potsdam Hasso Plattner Inst Potsdam Germany Oracle Labs Potsdam Germany

ISBN: (纸本)9781450396561

Mutation Testing is a popular approach to determine the quality of a suite of unit tests. It is based on the idea that introducing faults into a system under test (SUT) should cause tests to fail, otherwise, the test suite might be of insufficient quality. In the language of mutation testing, such a fault is referred to as "mutation", and an instance of the SUT's code that contains the mutation is referred to as "mutant". Mutation testing is computationally expensive and time-consuming. Reasons for this include, for example, a high number of mutations to consider, interrelations between these mutations, and mutant-associated costs such as the cost of mutant creation or the cost of checking whether any tests fail in response. Furthermore, implementing a reliable tool for automatic mutation testing is a significant effort for any language. As a result, mutation testing is only available for some languages. Present mutation tools often rely on modifying code or binary executables. We refer to this as "ahead-of-time" mutation testing. Oftentimes, they neither take dynamic information that is only available at run-time into account nor alter program behavior at run-time. However, mutating via the latter could save costs on mutant creation: If the corresponding module of code is compiled, only the mutated section of code needs to be recompiled. Run-time information (like previous execution results selected by an initial test run) could help to determine the utility of a mutant. Skipping mutants of low utility could have an impact on mutation testing efficiency. We refer to this approach as just-in-time mutation testing. In this paper, we provide a proof of concept for just-in-time and language-agnostic mutation testing. We present preliminary results of a feasibility study that explores the implementation of just-in-time mutation testing based on Truffle's instrumentation API. Based on these results, future research can evaluate the implications of just-in-time and langua

关键词： mutation testing mutation coverage just-in-time language-agnostic GraalVM Truffle polyglot

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

language Transformations in the Classroom 28

Language Transformations in the Classroom

引用

43rd acm sigplan International conference on programming language design and implementation (PLDI)

作者： Cimini, Matteo Mourad, Benjamin Univ Massachusetts Lowell Lowell MA 01854 USA

language transformations are algorithms that take a language specification in input, and return the language specification modified. language transformations are useful for automatically adding features such as subtyping to programming languages (PLs), and for automatically deriving abstract machines. In this paper, we set forth the thesis that teaching programming languages features with the help of language transformations, in addition to the planned material, can be beneficial for students to help them deepen their understanding of the features being taught. We have conducted a study on integrating language transformations into an undergraduate PL course. We describe our study, the material that we have taught, and the exam submitted to students, and we present the results from this study. Although we refrain from drawing general conclusions on the effectiveness of language transformations, this paper offers encouraging data. We also offer this paper to inspire similar studies.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Sound Probabilistic Inference via Guide Types 2021

Sound Probabilistic Inference via Guide Types

引用

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

作者： Wang, Di Hoffmann, Jan Reps, Thomas Carnegie Mellon Univ Pittsburgh PA 15213 USA Univ Wisconsin Madison WI 53706 USA

ISBN: (纸本)9781450383912

Probabilistic programming languages aim to describe and automate Bayesian modeling and inference. Modern languages support programmable inference, which allows users to customize inference algorithms by incorporating guide programs to improve inference performance. For Bayesian inference to be sound, guide programs must be compatible with model programs. One pervasive but challenging condition for model-guide compatibility is absolute continuity, which requires that the model and guide programs define probability distributions with the same support. This paper presents a new probabilistic programming language that guarantees absolute continuity, and features general programming constructs, such as branching and recursion. Model and guide programs are implemented as coroutines that communicate with each other to synchronize the set of random variables they sample during their execution. Novel guide types describe and enforce communication protocols between coroutines. If the model and guide are well-typed using the same protocol, then they are guaranteed to enjoy absolute continuity. An efficient algorithm infers guide types from code so that users do not have to specify the types. The new programming language is evaluated with an implementation that includes the type-inference algorithm and a prototype compiler that targets Pyro. Experiments show that our language is capable of expressing a variety of probabilistic models with nontrivial control flow and recursion, and that the coroutine-based computation does not introduce significant overhead in actual Bayesian inference.

关键词： Probabilistic programming Bayesian inference type systems coroutines

来源：评论

学校读者我要写书评

暂无评论

Task Parallel Assembly language for Uncompromising Parallelism 2021

Task Parallel Assembly Language for Uncompromising Paralleli...

引用

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

作者： Rainey, Mike Newton, Ryan R. Hale, Kyle Hardavellas, Nikos Campanoni, Simone Dinda, Peter Acar, Umut A. Carnegie Mellon Univ Pittsburgh PA 15213 USA Facebook New York NY USA IIT Chicago IL 60616 USA Northwestern Univ Chicago IL 60611 USA

ISBN: (纸本)9781450383912

Achieving parallel performance and scalability involves making compromises between parallel and sequential computation. If not contained, the overheads of parallelism can easily outweigh its benefits, sometimes by orders of magnitude. Today, we expect programmers to implement this compromise by optimizing their code manually. This process is labor intensive, requires deep expertise, and reduces code quality. Recent work on heartbeat scheduling shows a promising approach that manifests the potentially vast amounts of available, latent parallelism, at a regular rate, based on even beats in time. The idea is to amortize the overheads of parallelism over the useful work performed between the beats. Heartbeat scheduling is promising in theory, but the reality is complicated: it has no known practical implementation. In this paper, we propose a practical approach to heartbeat scheduling that involves equipping the assembly language with a small set of primitives. These primitives leverage existing kernel and hardware support for interrupts to allow parallelism to remain latent, until a heartbeat, when it can be manifested with low cost. Our Task Parallel Assembly language (TPAL) is a compact, RISC-like assembly language. We specify TPAL through an abstract machine and implement the abstract machine as compiler transformations for C/C++ code and a specialized run-time system. We present an evaluation on both the Linux and the Nautilus kernels, considering a range of heartbeat interrupt mechanisms. The evaluation shows that TPAL can dramatically reduce the overheads of parallelism without compromising scalability.

关键词： parallel programming languages granularity control

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Multi-language static code analysis on the LARA framework 10

Multi-language static code analysis on the LARA framework

引用

10th acm sigplan International Workshop on the State Of the Art in Program Analysis, SOAP 2021, co-located with the 42nd acm sigplan International conference on programming language design and implementation, PLDI 2021

作者： Teixeira, Gil Bispo, João Correia, Filipe F. Faculty of Engineering University of Porto Porto Portugal Faculty of Engineering University of Porto Inesc Tec Porto Portugal

ISBN: (纸本)9781450384681

We propose a mechanism to raise the abstraction level of source-code analysis and robustly support multiple languages. Built on top of the LARA framework, it allows sharing language specifications between LARA source-to-source compilers, and enables the mapping of a virtual AST over the nodes of ASTs provided by different, unrelated parsers. We use this approach to create a language specification for Object-Oriented (OO) languages and add support for three different LARA compilers. We evaluate it by implementing a library of 18 software metrics using this language specification and apply the metrics to source code in four programming languages (C, C++, Java, and JavaScript). We compare the results with other tools to evaluate the approach. © 2021 Owner/Author.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Filling Typed Holes with Live GUIs 2021

Filling Typed Holes with Live GUIs

引用

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

作者： Omar, Cyrus Moon, David Blinn, Andrew Voysey, Ian Collins, Nick Chugh, Ravi Univ Michigan Ann Arbor MI 48109 USA Carnegie Mellon Univ Pittsburgh PA 15213 USA Univ Chicago Chicago IL 60637 USA

ISBN: (纸本)9781450383912

Text editing is powerful, but some types of expressions are more naturally represented and manipulated graphically. Examples include expressions that compute colors, music, animations, tabular data, plots, diagrams, and other domain-specific data structures. This paper introduces live literals, or livelits, which allow clients to fill holes of types like these by directly manipulating a user-defined GUI embedded persistently into code. Uniquely, livelits are compositional: a livelit GUI can itself embed spliced expressions, which are typed, lexically scoped, and can in turn embed other livelits. Livelits are also uniquely live: a livelit can provide continuous feedback about the run-time implications of the client's choices even when splices mention bound variables, because the system continuously gathers closures associated with the hole that the livelit is filling. We integrate livelits into Hazel, a live hole-driven programming environment, and describe case studies that exercise these novel capabilities. We then define a simply typed livelit calculus, which specifies how livelits operate as live graphical macros. The metatheory of macro expansion has been mechanized in Agda.

关键词： live programming macros typed holes GUIs

来源：评论

学校读者我要写书评

暂无评论

Gleipnir: Toward Practical Error Analysis for Quantum Programs 2021

Gleipnir: Toward Practical Error Analysis for Quantum Progra...

引用

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

作者： Tao, Runzhou Shi, Yunong Yao, Jianan Hui, John Chong, Frederic T. Gu, Ronghui Columbia Univ New York NY 10027 USA Univ Chicago Chicago IL 60637 USA Amazon New York NY USA Supertech Chicago IL USA Quantum Circuits Inc Chicago IL USA

ISBN: (纸本)9781450383912

Practical error analysis is essential for the design, optimization, and evaluation of Noisy Intermediate-Scale Quantum(NISQ) computing. However, bounding errors in quantum programs is a grand challenge, because the effects of quantum errors depend on exponentially large quantum states. In this work, we present Gleipnir, a novel methodology toward practically computing verified error bounds in quantum programs. Gleipnir introduces the ((rho) over cap,delta)-diamond norm, an error metric constrained by a quantum predicate consisting of the approximate state (rho) over cap and its distance d to the ideal state rho?. This predicate ((rho) over cap,delta) can be computed adaptively using tensor networks based on the Matrix Product States. Gleipnir features a lightweight logic for reasoning about error bounds in noisy quantum programs, based on the ((rho) over cap,delta)-diamond norm metric. Our experimental results show that Gleipnir is able to efficiently generate tight error bounds for real-world quantum programs with 10 to 100 qubits, and can be used to evaluate the error mitigation performance of quantum compiler transformations.

关键词： quantum programming error analysis approximate computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共126页 << < 3 4 5 6 7 8 9 10 11 12 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：