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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是291-300 订阅

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

详细简洁

排序：

Type-preserving compilation of end-to-end verification of security enforcement 10

Type-preserving compilation of end-to-end verification of se...

引用

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

作者： Chen, Juan Chugh, Ravi Swamy, Nikhil Microsoft Research United States University of California San Diego CA 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. © 2010 acm.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

A Distributed OpenCL Framework using Redundant Computation and Data Replication 16

A Distributed OpenCL Framework using Redundant Computation a...

引用

37th acm sigplan conference on programming language design and implementation

作者： Kim, Junghyun Jo, Gangwon Jung, Jaehoon Kim, Jungwon Lee, Jaejin Seoul Natl Univ Ctr Manycore Programming Dept Comp Sci & Engn Seoul 08826 South Korea

ISBN: (纸本)9781450342612

Applications written solely in OpenCL or CUDA cannot execute on a cluster as a whole. Most previous approaches that extend these programming models to clusters are based on a common idea: designating a centralized host node and coordinating the other nodes with the host for computation. However, the centralized host node is a serious performance bottleneck when the number of nodes is large. In this paper, we propose a scalable and distributed OpenCL framework called SnuCL-D for large-scale clusters. SnuCL-D's remote device virtualization provides an OpenCL application with an illusion that all compute devices in a cluster are confined in a single node. To reduce the amount of control-message and data communication between nodes, SnuCL-D replicates the OpenCL host program execution and data in each node. We also propose a new OpenCL host API function and a queueing optimization technique that significantly reduce the overhead incurred by the previous centralized approaches. To show the effectiveness of SnuCL-D, we evaluate SnuCL-D with a microbenchmark and eleven benchmark applications on a large-scale CPU cluster and a medium-scale GPU cluster.

关键词： OpenCL clusters heterogeneous computing programming models runtime systems redundant computation data replication

来源：评论

学校读者我要写书评

暂无评论

Study of dead data members in C++ applications

Study of dead data members in C++ applications

引用

Proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, pldi

作者： Sweeney, Peter P. Tip, Frank IBM Thomas J. Watson Research Cent Yorktown Heights United States

Object-oriented applications may contain data members that can be removed from the application without affecting program behavior. Such `dead' data members may occur due to unused functionality in class libraries, or due to the programmer losing track of member usage as the application changes over time. We present a simple and efficient algorithm for detecting dead data members in C++ applications. This algorithm has been implemented using a prototype version of the IBM VisualAge C++ compiler, and applied to a number of realistic benchmark programs ranging from 600 to 58,000 lines of code. For the non-trivial benchmarks, we found that up to 27.3% of the data members in the benchmarks are dead (average 12.5%), and that up to 11.6% of the object space of these applications may be occupied by dead data members at run-time (average 4.4%).

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Teapot: language support for writing memory coherence protocols

Teapot: language support for writing memory coherence protoc...

引用

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

作者： Chandra, Satish Richards, Brad Larus, James R. Univ of Wisconsin-Madison Madison United States

Recent shared-memory parallel computer systems offer the exciting possibility of customizing memory coherence protocols to fit an application's semantics and sharing patterns. Custom protocols have been used to achieve message-passing performance - while retaining the convenient programming model of a global address space - and to implement high-level language constructs. Unfortunately, coherence protocols written in a conventional language such as C are difficult to write, debug, understand, or modify. This paper describes Teapot, a small, domain-specific language for writing coherence protocols. Teapot uses continuations to help reduce the complexity of writing protocols. Simple static analysis in the Teapot compiler eliminates much of the overhead of continuations and results in protocols that run nearly as fast as hand-written C code. A Teapot specification can be compiled both to an executable coherence protocol and to input for a model checking system, which permits the specification to be verified. We report our experiences coding and verifying several protocols written in Teapot, along with measurements of the overhead incurred by writing a protocol in a higher-level language.

关键词： Computer hardware description languages

来源：评论

学校读者我要写书评

暂无评论

Higher-Order and Tuple-Based Massively-Parallel Prefix Sums 16

Higher-Order and Tuple-Based Massively-Parallel Prefix Sums

引用

37th acm sigplan conference on programming language design and implementation

作者： Maleki, Sepideh Yang, Annie Burtscher, Martin Texas State Univ Dept Comp Sci San Marcos TX 78666 USA

ISBN: (纸本)9781450342612

Prefix sums are an important parallel primitive, especially in massively-parallel programs. This paper discusses two orthogonal generalizations thereof, which we call higher-order and tuple-based prefix sums. Moreover, it describes and evaluates SAM, a GPU-friendly algorithm for computing prefix sums and other scans that directly supports higher orders and tuple values. Its templated CUDA implementation unifies all of these computations in a single 100-statement kernel. SAM is communication-efficient in the sense that it minimizes main-memory accesses. When computing prefix sums of a million or more values, it outperforms Thrust and CUDPP on both a Titan X and a K40 GPU. On the Titan X, SAM reaches memory-copy speeds for large input sizes, which cannot be surpassed. SAM outperforms CUB, the currently fastest conventional prefix sum implementation, by up to a factor of 2.9 on eighth-order prefix sums and by up to a factor of 2.6 on eight-tuple prefix sums.

关键词： Algorithms Performance design Higher-order prefix sums tuple-based prefix sums carry propagation GPU programming

来源：评论

学校读者我要写书评

暂无评论

Profile guided code positioning 90

Profile guided code positioning

引用

Proceedings of the acm sigplan '90 conference on programming language design and implementation

作者： Pettis, Karl Hansen, Robert C. Hewlett Packard Co California Language Lab Cupertino United States

ISBN: (纸本)0897913647

This paper presents the results of our investigation of code positioning techniques using execution profile data as input into the compilation process. The primary objective of the positioning is to reduce the overhead of the instruction memory hierarchy. After initial investigation in the literature, we decided to implement two prototypes for the Hewlett-Packard Precision Architecture (PA-RISC). The first, built on top of the linker, positions code based on whole procedures. This prototype has the ability to move procedures into an order that is determined by a 'closest is best' strategy. The algorithms we implemented are described through examples in this paper. The performance improvements from our work are also summarized in various tables and charts.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Efficient context-sensitive pointer analysis for c programs 95

Efficient context-sensitive pointer analysis for c programs

引用

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

作者： Wilson, Robert P. Lam, Monica S. Computer Systems Laboratory Stanford University CA94305 United States

ISBN: (纸本)0897916972

This paper proposes an efficient technique for con-extsensitive pointer analysis that is applicable to real C programs. For efficiency, we summarize the effects of procedures using partial tran$er func(ions. A partial transfer function (PTF) describes the behavior of a procedure assuming that certain alias relationships hold when it is called. We cart reuse aPTF in many calling contexts as long as the aliases among the inputs to the procedure are the same. Our empirical results demonstrate that this technique is successful-a single PTF per procedure is usually sufficient to obtain completely context-sensitive results. Because many C programs use features such as type casts and pointer arithmetic to circumvent the high-level type system, our algorithm is based on a low-level representation of memory locations that safely handles all the features of C. We have implemented our algorithm in the SUIF compiler system and efficiently for a set of C benchmarks. © 1995 acm.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Event-Driven Network programming 16

Event-Driven Network Programming

引用

37th acm sigplan conference on programming language design and implementation

作者： McClurg, Jedidiah Hojjat, Hossein Foster, Nate Cerny, Pavol CU Boulder Boulder CO 80309 USA Cornell Univ Ithaca NY 14853 USA

ISBN: (纸本)9781450342612

Software-defined networking (SDN) programs must simultaneously describe static forwarding behavior and dynamic updates in response to events. Event-driven updates are critical to get right, but difficult to implement correctly due to the high degree of concurrency in networks. Existing SDN platforms offer weak guarantees that can break application invariants, leading to problems such as dropped packets, degraded performance, security violations, etc. This paper introduces event-driven consistent updates that are guaranteed to preserve well-defined behaviors when transitioning between configurations in response to events. We propose network event structures (NESs) to model constraints on updates, such as which events can be enabled simultaneously and causal dependencies between events. We define an extension of the NetKAT language with mutable state, give semantics to stateful programs using NESs, and discuss provably-correct strategies for implementing NESs in SDNs. Finally, we evaluate our approach empirically, demonstrating that it gives well-defined consistency guarantees while avoiding expensive synchronization and packet buffering.

关键词： network update consistent update event structure software-defined networking SDN NetKAT

来源：评论

学校读者我要写书评

暂无评论

Semantic Soundness for language Interoperability 2022

Semantic Soundness for Language Interoperability

引用

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

作者： Patterson, Daniel Mushtak, Noble Wagner, Andrew Ahmed, Amal Northeastern Univ Boston MA 02115 USA

ISBN: (纸本)9781450392655

Programs are rarely implemented in a single language, and thus questions of type soundness should address not only the semantics of a single language, but how it interacts with others. Even between type-safe languages, disparate features can frustrate interoperability, as invariants from one language can easily be violated in the other. In their seminal 2007 paper, Matthews and Findler proposed a multi-language construction that augments the interoperating languages with a pair of boundaries that allow code from one language to be embedded in the other. While this technique has been widely applied, their syntactic source-level interoperability doesn't reflect practical implementations, where the behavior of interaction is only defined after compilation to a common target, and any safety must be ensured by target invariants or inserted target-level "glue code." In this paper, we present a novel framework for the design and verification of sound language interoperability that follows an interoperation-after-compilation strategy. language designers specify what data can be converted between types of the two languages via a convertibility relation tau(A) similar to tau(B) ("tau(A) is convertible to tau(B)") and specify target-level glue code implementing the conversions. Then, by giving a semantic model of source-language types as sets of target-language terms, they can establish not only the meaning of the source types, but also soundness of conversions: i.e., whenever tau(A) similar to tau(B), the corresponding pair of conversions (glue code) convert target terms that behave like tau(A) to target terms that behave like tau(B), and vice versa. With this, they can prove semantic type soundness for the entire system. We illustrate our framework via a series of case studies that demonstrate how our semantic interoperation-after-compilation approach allows us both to account for complex differences in language semantics and make efficiency trade-offs based on particulariti

关键词： language interoperability type soundness semantics logical relations

来源：评论

学校读者我要写书评

暂无评论

CEAL: A C-Based language for Self-Adjusting Computation 09

CEAL: A C-Based Language for Self-Adjusting Computation

引用

acm sigplan conference on programming language design and implementation

作者： Hammer, Matthew A. Acar, Umut A. Chen, Yan Toyota Technol Inst Chicago Chicago IL USA

ISBN: (纸本)9781605583921

Self-adjusting computation offers a language-centric approach to writing programs that can automatically respond to modifications to their data (e.g., inputs). Except for several domain-specific implementations, however, all previous implementations of self-adjusting computation assume mostly functional, higher-order languages such as Standard ML. Prior to this work, it was not known if self-adjusting computation can be made to work with low-level, imperative languages such as C without placing undue burden on the programmer. We describe the design and implementation of CEAL: a C-based language for self-adjusting computation. The language is fully general and extends C with a small number of primitives to enable writing self-adjusting programs in a style similar to conventional C programs. We present efficient compilation techniques for translating CEAL programs into C that can be compiled with existing C compilers using primitives supplied by a run-time library for self-adjusting computation. We implement the proposed compiler and evaluate its effectiveness. Our experiments show that CEAL is effective in practice: compiled self-adjusting programs respond to small modifications to their data by orders of magnitude faster than recomputing from scratch while slowing down a from-scratch run by a moderate constant factor. Compared to previous work, we measure significant space and time improvements.

关键词： Self-adjusting computation compilation control and data flow dominators tail calls trampolines performance

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共53页 << < 26 27 28 29 30 31 32 33 34 35 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：