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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,059 篇 工学
- 992 篇 软件工程
- 763 篇 计算机科学与技术...
- 40 篇 电气工程
- 40 篇 控制科学与工程
- 32 篇 信息与通信工程
- 12 篇 电子科学与技术（可...
- 7 篇 机械工程
- 6 篇 材料科学与工程（可...
- 5 篇 建筑学
- 5 篇 化学工程与技术
- 5 篇 生物工程
- 5 篇 安全科学与工程
- 4 篇 土木工程
- 4 篇 航空宇航科学与技...
- 3 篇 光学工程
- 2 篇 动力工程及工程热...
- 2 篇 农业工程
144 篇 理学
- 112 篇 数学
- 13 篇 物理学
- 12 篇 系统科学
- 9 篇 统计学（可授理学、...
- 7 篇 生物学
- 5 篇 化学
- 2 篇 天文学
81 篇 管理学
- 47 篇 管理科学与工程(可...
- 37 篇 图书情报与档案管...
- 26 篇 工商管理
12 篇 教育学
- 12 篇 教育学
7 篇 经济学
- 7 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 农学

主题

171 篇 design
157 篇 languages
97 篇 performance
96 篇 computer program...
58 篇 algorithms
50 篇 object oriented ...
48 篇 computer program...
43 篇 experimentation
39 篇 verification
36 篇 java programming...
34 篇 reliability
28 篇 functional progr...
26 篇 program synthesi...
26 篇 java
24 篇 probabilistic pr...
21 篇 concurrency
19 篇 domain-specific ...
19 篇 theory
18 篇 software design
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 篇 myers andrew c.
6 篇 mezini mira
6 篇 mahlke scott
6 篇 bodik rastislav

语言

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

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

共 1231 条记录，以下是91-100 订阅

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

详细简洁

排序：

NV: An Intermediate language for Verification of Network Control Planes 2020

NV: An Intermediate Language for Verification of Network Con...

引用

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

作者： Giannarakis, Nick Loehr, Devon Beckett, Ryan Walker, David Princeton Univ Princeton NJ 08544 USA Microsoft Res Redmond WA USA

ISBN: (纸本)9781450376136

Network misconfiguration has caused a raft of high-profile outages over the past decade, spurring researchers to develop a variety of network analysis and verification tools. Unfortunately, developing and maintaining such tools is an enormous challenge due to the complexity of network configuration languages. Inspired by work on intermediate languages for verification such as Boogie and Why3, we develop NV, an intermediate language for verification of network control planes. NV carefully walks the line between expressiveness and tractability, making it possible to build models for a practical subset of real protocols and their configurations, and also facilitate rapid development of tools that outperform state-of-the-art simulators (seconds vs minutes) and verifiers (often 10x faster). Furthermore, we show that it is possible to develop novel analyses just by writing new NV programs. In particular, we implement a new fault-tolerance analysis that scales to far larger networks than existing tools.

关键词： Network Verification Network Simulation Control Plane Analysis Router Configuration Analysis Intermediate Verification language

来源：评论

学校读者我要写书评

暂无评论

Armada: Low-Effort Verification of High-Performance Concurrent Programs 2020

Armada: Low-Effort Verification of High-Performance Concurre...

引用

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

作者： Lorch, Jacob R. Chen, Yixuan Kapritsos, Manos Parno, Bryan Qadeer, Shaz Sharma, Upamanyu Wilcox, James R. Zhao, Xueyuan Microsoft Res Redmond WA 98052 USA Univ Michigan Ann Arbor MI 48109 USA Yale Univ New Haven CT 06520 USA Carnegie Mellon Univ Pittsburgh PA 15213 USA Calibra Seattle WA USA Certora San Francisco CA USA

ISBN: (纸本)9781450376136

Safely writing high-performance concurrent programs is notoriously difficult. To aid developers, we introduce Armada, a language and tool designed to formally verify such programs with relatively little effort. Via a C-like language and a small-step, state-machine-based semantics, Armada gives developers the flexibility to choose arbitrary memory layout and synchronization primitives so they are never constrained in their pursuit of performance. To reduce developer effort, Armada leverages SMT-powered automation and a library of powerful reasoning techniques, including rely-guarantee, TSO elimination, reduction, and alias analysis. All these techniques are proven sound, and Armada can be soundly extended with additional strategies over time. Using Armada, we verify four concurrent case studies and show that we can achieve performance equivalent to that of unverified code.

关键词： refinement weak memory models x86-TSO

来源：评论

学校读者我要写书评

暂无评论

Multi-modal Synthesis of Regular Expressions 2020

Multi-modal Synthesis of Regular Expressions

引用

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

作者： Chen, Qiaochu Wang, Xinyu Ye, Xi Durrett, Greg Dillig, Isil Univ Texas Austin Austin TX 78712 USA Univ Michigan Ann Arbor MI 48109 USA

ISBN: (纸本)9781450376136

In this paper, we propose a multi-modal synthesis technique for automatically constructing regular expressions (regexes) from a combination of examples and natural language. Using multiple modalities is useful in this context because natural language alone is often highly ambiguous, whereas examples in isolation are often not sufficient for conveying user intent. Our proposed technique first parses the English description into a so-called hierarchical sketch that guides our programming-by-example (PBE) engine. Since the hierarchical sketch captures crucial hints, the PBE engine can leverage this information to both prioritize the search as well as make useful deductions for pruning the search space. We have implemented the proposed technique in a tool called Regel and evaluate it on over three hundred regexes. Our evaluation shows that Regel achieves 80% accuracy whereas the NLP-only and PBE-only baselines achieve 43% and 26% respectively. We also compare our proposed PBE engine against an adaptation of AlphaRegex, a state-of-the-art regex synthesis tool, and show that our proposed PBE engine is an order of magnitude faster, even if we adapt the search algorithm of AlphaRegex to leverage the sketch. Finally, we conduct a user study involving 20 participants and show that users are twice as likely to successfully come up with the desired regex using Regel compared to without it.

关键词： Program Synthesis programming by Natural languages programming by Example Regular Expression

来源：评论

学校读者我要写书评

暂无评论

Predictable Accelerator design with Time-Sensitive Affine Types 2020

Predictable Accelerator Design with Time-Sensitive Affine Ty...

引用

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

作者： Nigam, Rachit Atapattu, Sachille Thomas, Samuel Li, Zhijing Bauer, Theodore Ye, Yuwei Koti, Apurva Sampson, Adrian Zhang, Zhiru Cornell Univ Ithaca NY 14853 USA

ISBN: (纸本)9781450376136

Field-programmable gate arrays (FPGAs) provide an opportunity to co-design applications with hardware accelerators, yet they remain difficult to program. High-level synthesis (HLS) tools promise to raise the level of abstraction by compiling C or C++ to accelerator designs. Repurposing legacy software languages, however, requires complex heuristics to map imperative code onto hardware structures. We find that the black-box heuristics in HLS can be unpredictable: changing parameters in the program that should improve performance can counterintuitively yield slower and larger designs. This paper proposes a type system that restricts HLS to programs that can predictably compile to hardware accelerators. The key idea is to model consumable hardware resources with a time-sensitive affine type system that prevents simultaneous uses of the same hardware structure. We implement the type system in Dahlia, a language that compiles to HLS C++, and show that it can reduce the size of HLS parameter spaces while accepting Pareto-optimal designs.

关键词： Affine Type Systems High-Level Synthesis

来源：评论

学校读者我要写书评

暂无评论

designing a Course of programming language Foundations that Closely Combines Practice 2021

Designing a Course of Programming Language Foundations that ...

引用

acm Turing Award Celebration conference (acm TURC)

作者： Zhang, Yu Ouyang, Youwen Univ Sci & Technol China Hefei Peoples R China Calif State Univ San Marcos San Marcos TX USA

ISBN: (纸本)9781450385671

The Computer Science Curricula 2013 (CS2013) calls for undergraduate CS programs to expose their students to the models underlying different programming languages as well as the principles on which language features are defined, composed, and implemented. Although an upper division "programming languages (Foundations)" course is common in many CS programs in United States, such a course is rare in Chinese CS undergraduate programs. This is partly due to the challenge of balancing the breadth and depth of topics covered in such a course. Another common concern is the balance between theory and practice. This paper reports our experience in designing "Foundations of programming languages" at USTC. Following the exemplar programming languages courses in CS2013, this 15-week course covers scripting, functional, logic and systems languages, presenting their principle features and design/implementation issues. The topics include modern language features (e.g. closures), principles (e.g. lambda calculus and logic), control flow and runtime components (e.g. memory management and concurrency). The paper describes how four selected languages (Lua for scripting, OCaml for functional, Datalog for logic and Rust for systems) work together to provide practical experiences for students on concepts that would be considered too abstract. It also includes discussions of student performance on selected projects.

关键词： language Foundations Practice language Paradigms

来源：评论

学校读者我要写书评

暂无评论

Synthesizing Structured CAD Models with Equality Saturation and Inverse Transformations 2020

Synthesizing Structured CAD Models with Equality Saturation ...

引用

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

作者： Nandi, Chandrakana Willsey, Max Anderson, Adam Wilcox, James R. Darulova, Eva Grossman, Dan Tatlock, Zachary Univ Washington Seattle WA 98195 USA Certora Raleigh NC USA MPI SWS Saarbrucken Germany

ISBN: (纸本)9781450376136

Recent program synthesis techniques help users customize CAD models (e.g., for 3D printing) by decompiling low-level triangle meshes to Constructive Solid Geometry (CSG) expressions. Without loops or functions, editing CSG can require many coordinated changes, and existing mesh decompilers use heuristics that can obfuscate high-level structure. This paper proposes a second decompilation stage to robustly lshrinkz unstructured CSG expressions into more editable programs with map and fold operators. We present Szalinski, a tool that uses Equality Saturation with semanticspreserving CAD rewrites to efficiently search for smaller equivalent programs. Szalinski relies on inverse transformations, a novel way for solvers to speculatively add equivalences to an E-graph. We qualitatively evaluate Szalinski in case studies, show how it composes with an existing mesh decompiler, and demonstrate that Szalinski can shrink large models in seconds.

关键词： Equality Saturation Program Synthesis Decompilation Computer-Aided design

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Featherweight Swift: A Core Calculus for Swift's Type System 13

Featherweight Swift: A Core Calculus for Swift's Type System

引用

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

作者： Racordon, Dimitri Buchs, Didier Univ Geneva Dept Comp Sci Geneva Switzerland

ISBN: (纸本)9781450381765

Swift is a modern general-purpose programming language, designed to be a replacement for C-based languages. Although primarily directed at development of applications for Apple's operating systems, Swift's adoption has been growing steadily in other domains, ranging from server-side services to machine learning. This success can be partly attributed to a rich type system that enables the design of safe, fast, and expressive programming interfaces. Unfortunately, this richness comes at the cost of complexity, setting a high entry barrier to exploit Swift's full potential. Furthermore, existing documentation typically only relies on examples, leaving new users with little help to build a deeper understanding of the underlying rules and mechanisms. This paper aims to tackle this issue by laying out the foundations for a formal framework to reason about Swift's type system. We introduce Featherweight Swift, a minimal language stripped of all features not essential to describe its typing rules. Featherweight Swift features classes and protocol inheritance, supports retroactive modeling, and emulates Swift's overriding mechanisms. Yet its formalization fits on a few pages. We present Featherweight Swift's syntax and semantics. We then elaborate on the usability of our framework to reason about Swift's features, future extensions, and implementation by discussing a bug in Swift's compiler, discovered throughout the design of our calculus.

关键词： protocol oriented programming language semantics language calculus type systems swift

来源：评论

学校读者我要写书评

暂无评论

On the Principles of Differentiable Quantum programming languages 2020

On the Principles of Differentiable Quantum Programming Lang...

引用

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

作者： Zhu, Shaopeng Hung, Shih-Han Chakrabarti, Shouvanik Wu, Xiaodi Univ Maryland College Pk MD 20742 USA

ISBN: (纸本)9781450376136

Variational Quantum Circuits (VQCs), or the so-called quantum neural-networks, are predicted to be one of the most important near-term quantum applications, not only because of their similar promises as classical neural-networks, but also because of their feasibility on near-term noisy intermediate-size quantum (NISQ) machines. The need for gradient information in the training procedure of VQC applications has stimulated the development of auto-differentiation techniques for quantum circuits. We propose the first formalization of this technique, not only in the context of quantum circuits but also for imperative quantum programs (e.g., with controls), inspired by the success of differentiable programming languages in classical machine learning. In particular, we overcome a few unique difficulties caused by exotic quantum features (such as quantum no-cloning) and provide a rigorous formulation of differentiation applied to bounded-loop imperative quantum programs, its code-transformation rules, as well as a sound logic to reason about their correctness. Moreover, we have implemented our code transformation in OCaml and demonstrated the resource-efficiency of our scheme both analytically and empirically. We also conduct a case study of training a VQC instance with controls, which shows the advantage of our scheme over existing auto-differentiation for quantum circuits without controls.

关键词： quantum programming languages differentiable programming languages quantum machine learning

来源：评论

学校读者我要写书评

暂无评论

A Principled Approach to REPL Interpreters

A Principled Approach to REPL Interpreters

引用

acm sigplan International Symposium on New Ideas, New Paradigms, and Reflections on programming and Software (Onward) Part of part of SPLASH conference

作者： van Binsbergen, L. Thomas Merino, Mauricio Verano Jeanjean, Pierre van der Storm, Tijs Combemale, Benoit Barais, Olivier Ctr Wiskunde & Informat Amsterdam Netherlands Eindhoven Univ Technol Eindhoven Netherlands Univ Rennes INRIA CRNS IRISA Rennes France Univ Groningen Groningen Netherlands

ISBN: (纸本)9781450381789

Read-eval-print-loops (REPLs) allow programmers to test out snippets of code, explore APIs, or even incrementally construct code, and get immediate feedback on their actions. However, even though many languages provide a REPL, the relation between the language as is and what is accepted at the REPL prompt is not always well-defined. Furthermore, implementing a REPL for new languages, such as DSLs, may incur significant language engineering cost. In this paper we survey the domain of REPLs and investigate the (formal) principles underlying REPLs. We identify and define the class of sequential languages, which admit a sound REPL implementation based on a definitional interpreter, and present design guidelines for extending existing language implementations to support REPL-style interfaces (including computational notebooks). The obtained REPLs can then be generically turned into an exploring interpreter, to allow exploration of the user's interaction. The approach is illustrated using three case studies, based on MiniJava, QL (a DSL for questionnaires), and eFLINT (a DSL for normative rules). We expect sequential languages, and the consequent design principles, to be stepping stones towards a better understanding of the essence of REPLs.

关键词： interpreters REPLs software language engineering notebooks meta-languages language workbenches

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共124页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：