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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,072 篇 工学
- 1,005 篇 软件工程
- 778 篇 计算机科学与技术...
- 43 篇 控制科学与工程
- 36 篇 电气工程
- 32 篇 信息与通信工程
- 12 篇 机械工程
- 10 篇 电子科学与技术（可...
- 6 篇 建筑学
- 6 篇 土木工程
- 6 篇 生物工程
- 5 篇 材料科学与工程（可...
- 5 篇 化学工程与技术
- 5 篇 安全科学与工程
- 4 篇 光学工程
- 4 篇 航空宇航科学与技...
- 2 篇 冶金工程
- 2 篇 农业工程
- 2 篇 生物医学工程（可授...
138 篇 理学
- 112 篇 数学
- 13 篇 系统科学
- 8 篇 生物学
- 8 篇 统计学（可授理学、...
- 7 篇 物理学
- 5 篇 化学
89 篇 管理学
- 52 篇 管理科学与工程(可...
- 41 篇 图书情报与档案管...
- 29 篇 工商管理
17 篇 教育学
- 17 篇 教育学
6 篇 经济学
- 6 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 农学
1 篇 医学
1 篇 军事学

主题

170 篇 design
157 篇 languages
96 篇 performance
95 篇 computer program...
57 篇 algorithms
49 篇 computer program...
47 篇 object oriented ...
43 篇 experimentation
42 篇 java programming...
39 篇 verification
34 篇 reliability
28 篇 java
28 篇 functional progr...
26 篇 program synthesi...
24 篇 probabilistic pr...
20 篇 concurrency
19 篇 compilers
19 篇 domain-specific ...
19 篇 theory
18 篇 type systems

机构

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...

作者

12 篇 walker david
10 篇 dillig isil
9 篇 shao zhong
9 篇 chlipala adam
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,156 篇 英文
80 篇 其他
1 篇 中文

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

共 1237 条记录，以下是151-160 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Static array storage optimization in MATLAB 03

引用

conference on programming language design and implementation

作者： Joisha, PG Banerjee, P Northwestern Univ ECE Dept Evanston IL 60208 USA

ISBN: (纸本)9781581136623

An adaptation of the classic register allocation algorithm to the problem of array storage optimization in MATLAB is presented. The method involves the decomposition of an interference graph's color classes using inferred type information. A key trait is the use of symbolic types, along with control flow, in performing the decomposition. On a benchmark suite spanning the published test suites of some recent research MATLAB compilers, our implementation produces savings in the average virtual memory size, with respect to code generated by a commercial MATLAB compiler, of between 51% and 139% in 6 out of 11 programs, and savings between 0.7% and 47% in the remaining. In absolute terms, this ranged from 123KB to over 9MB. Substantial improvements in other categories of memory, such as resident sets and dynamic data (stack plus heap), were also observed and are reported. Speedups in execution times of at least over an order of magnitude in 4 programs, of over 100% in 4 of the remaining, and 10% and over in-the rest are also reported.

关键词： algorithms design languages performance

来源：评论

学校读者我要写书评

暂无评论

design and implementation of the uw illustrated compiler 88

Design and implementation of the uw illustrated compiler

引用

acm sigplan conference on programming language design and implementation, PLDI 1988

作者： Andrew, Kristy Henry, Robert R. Yamamoto, Wayne K. Computer Science Department FR-35 University of Washington SeattleWA98195 United States Computers MS ICO 05 CupminoCA95014 United States AT and T Bell Laboratories IHP2FS.40 ZLM Park Plaza NapervilleIL60566-7050 United States

ISBN: (纸本)0897912691

We have implemented an illustrated compiIer for a simple block structured language. The compiler graphically displays its control and data structures, and so gives its viewers an intuitive understanding of compiler organization and operation. The illustrations were planned by hand and display information naturally and concisely. © 1988 acm.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Efficient and precise datarace detection for multithreaded object-oriented programs

Efficient and precise datarace detection for multithreaded o...

引用

conference on programming language design and implementation (PLDI 02)

作者： Choi, JD Lee, KW Loginov, A O'Callahan, R Sarkar, V Sridharan, M IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA Univ Washington Seattle WA 98195 USA Univ Wisconsin Madison WI 53706 USA MIT Cambridge MA 02139 USA

We present a novel approach to dynamic datarace detection for multithreaded object-oriented programs. Past techniques for on-the-fly datarace detection either sacrificed precision for performance, leading to many false positive datarace reports, or maintained precision but incurred significant overheads in the range of 3x to 30x. In contrast, our approach results in very few false positives and runtime overhead in the 13% to 42% range, making it both efficient and precise. This performance improvement is the result of a unique combination of complementary static and dynamic optimization techniques.

关键词： experimentation languages measurement performance dataraces race conditions debugging parallel programs synchronization multithreaded programming object-oriented programming static-dynamic co-analysis

来源：评论

学校读者我要写书评

暂无评论

Type-preserving Compilation for End-to-end Verification of Security Enforcement

Type-preserving Compilation for End-to-end Verification of S...

引用

acm sigplan conference on programming language design and implementation

作者： Chen, Juan Chugh, Ravi Swamy, Nikhil Microsoft Research United States University of California San Diego United States

ISBN: (纸本)9781450300193

A number of programming languages use rich type systems to verify security properties of code. Some of these languages are meant for source programming, but programs written in these languages are compiled without explicit security proofs, limiting their utility in settings where proofs are necessary, e.g., proof-carrying authorization. Others languages do include explicit proofs, but these are generally lambda calculi not intended for source programming, that must be further compiled to an executable form. A language suitable for source programming backed by a compiler that enables end-to-end verification is missing. In this paper, we present a type-preserving compiler that translates programs written in FINE, a source-level functional language with dependent refinements and affine types, to DCIL, a new extension of the .NET Common Intermediate language. FINE is type checked using an external SMT solver to reduce the proof burden on source programmers. We extract explicit LCF-style proof terms from the solver and carry these proof terms in the compilation to DCIL, thereby removing the solver from the trusted computing base. Explicit proofs enable DCIL to be used in a number of important scenarios, including the verification of mobile code, proof-carrying authorization, and evidence-based auditing. We report on our experience using FINE to build reference monitors for several applications, ranging from a plugin-based email client to a conference management server.

关键词： Security type systems dependent types bytecode languages functional programming authorization information flow mobile code security compilers

来源：评论

学校读者我要写书评

暂无评论

Asynchronous exceptions in Haskell 01

Asynchronous exceptions in Haskell

引用

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

作者： Marlow, S. Peyton Jones, S. Moran, A. Reppy, J. Microsoft Research Cambridge MA United States

ISBN: (纸本)9781581134148

Asynchronous exceptions, such as timeouts, are important for robust, modular programs, but are extremely difficult to program with - so much so that most programming languages either heavily restrict them or ban them altogether. We extend our earlier work, in which we added synchronous exceptions to Haskell, to support asynchronous exceptions too. Our design introduces scoped combinators for blocking and unblocking asynchronous interrupts, along with a somewhat surprising semantics for operations that can suspend. Uniquely, we also give a formal semantics for our system.

关键词： Modula (programming language)

来源：评论

学校读者我要写书评

暂无评论

implementation of the Cilk-5 multithreaded language

Implementation of the Cilk-5 multithreaded language

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Frigo, Matteo Leiserson, Charles E. Randall, Keith H. MIT Lab for Computer Science Cambridge MA United States

The fifth release of the multithreaded language Cilk uses a provably good `work-stealing' scheduling algorithm similar to the first system, but the language has been completely redesigned and the runtime system completely reengineered. The efficiency of the new implementation was aided by a clear strategy that arose from a theoretical analysis of the scheduling algorithm: concentrate on minimizing overheads that contribute to the work, even at the expense of overheads that contribute to the critical path. Although it may seem counterintuitive to move overheads onto the critical path, this `work-first' principle has led to a portable Cilk-5 implementation in which the typical cost of spawning a parallel thread is only between 2 and 6 times the cost of a C function call on a variety of contemporary machines. Many Cilk programs run on one processor with virtually no degradation compared to equivalent C programs. This paper describes how the work-first principle was exploited in the design of Cilk-5's compiler and its runtime system. In particular, we present Cilk-5's novel `two-clone' compilation strategy and its Dijkstra-like mutual-exclusion protocol for implementing the ready deque in the work-stealing scheduler.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

The design and implementation of Typed Scheme

The Design and Implementation of Typed Scheme

引用

35th acm-sigplan-SIGACT Symposium on Principles of programming languages

作者： Tobin-Hochstadt, Sam Felleisen, Matthias Northeastern Univ PLT Boston MA 02115 USA

ISBN: (纸本)9781595936899

When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)discover critical pieces of design information every time they wish to change a program. This analysis step both slows down the maintenance process and may even introduce mistakes due to the violation of undiscovered invariants. This paper presents Typed Scheme, an explicitly typed extension of an untyped scripting language. Its type system is based on the novel notion of occurrence typing, which we formalize and mechanically prove sound. The implementation of Typed Scheme additionally borrows elements from a range of approaches, including recursive types, true unions and subtyping, plus polymorphism combined with a modicum of local inference. Initial experiments with the implementation suggest that Typed Scheme naturally accommodates the programming style of the underlying scripting language, at least for the first few thousand lines of ported code. © 2008 acm.

关键词： Type Systems Scheme

来源：评论

学校读者我要写书评

暂无评论

Reactive Probabilistic programming 2020

Reactive Probabilistic Programming

引用

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

作者： Baudart, Guillaume Mandel, Louis Atkinson, Eric Sherman, Benjamin Pouzet, Marc Carbin, Michael IBM Res MIT IBM Watson AI Lab Armonk NY 10504 USA MIT Cambridge MA 02139 USA PSL Res Univ Ecole Normale Super Paris France

ISBN: (纸本)9781450376136

Synchronous modeling is at the heart of programming languages like Lustre, Esterel, or SCADE used routinely for implementing safety critical control software, e.g., fly-by-wire and engine control in planes. However, to date these languages have had limited modern support for modeling uncertainty - probabilistic aspects of the software's environment or behavior - even though modeling uncertainty is a primary activity when designing a control system. In this paper we present ProbZelus the first synchronous probabilistic programming language. ProbZelus conservatively provides the facilities of a synchronous language to write control software, with probabilistic constructs to model uncertainties and perform inference-in-the-loop. We present the design and implementation of the language. We propose a measure-theoretic semantics of probabilistic stream functions and a simple type discipline to separate deterministic and probabilistic expressions. We demonstrate a semantics-preserving compilation into a first-order functional language that lends itself to a simple presentation of inference algorithms for streaming models. We also redesign the delayed sampling inference algorithm to provide efficient streaming inference. Together with an evaluation on several reactive applications, our results demonstrate that ProbZelus enables the design of reactive probabilistic applications and efficient, bounded memory inference.

关键词： Probabilistic programming Reactive programming Streaming inference Semantics Compilation

来源：评论

学校读者我要写书评

暂无评论

Silq: A High-Level Quantum language with Safe Uncomputation and Intuitive Semantics 2020

Silq: A High-Level Quantum Language with Safe Uncomputation ...

引用

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

作者： Bichsel, Benjamin Baader, Maximilian Gehr, Timon Vechev, Martin Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450376136

Existing quantum languages force the programmer to work at a low level of abstraction leading to unintuitive and cluttered code. A fundamental reason is that dropping temporary values from the program state requires explicitly applying quantum operations that safely uncompute these values. We present Silq, the first quantum language that addresses this challenge by supporting safe, automatic uncomputation. This enables an intuitive semantics that implicitly drops temporary values, as in classical computation. To ensure physicality of Silq's semantics, its type system leverages novel annotations to reject unphysical programs. Our experimental evaluation demonstrates that Silq programs are not only easier to read and write, but also significantly shorter than equivalent programs in other quantum languages (on average -46% for Q#, -38% for Quipper), while using only half the number of quantum primitives.

关键词： Quantum language Uncomputation Semantics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共124页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：