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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

783 篇 会议
135 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

806 篇 工学
- 792 篇 软件工程
- 529 篇 计算机科学与技术...
- 22 篇 控制科学与工程
- 12 篇 信息与通信工程
- 7 篇 电气工程
- 5 篇 电子科学与技术（可...
- 4 篇 化学工程与技术
- 2 篇 生物工程
- 2 篇 安全科学与工程
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 动力工程及工程热...
- 1 篇 纺织科学与工程
- 1 篇 航空宇航科学与技...
- 1 篇 生物医学工程（可授...
99 篇 理学
- 84 篇 数学
- 10 篇 系统科学
- 8 篇 统计学（可授理学、...
- 4 篇 化学
- 3 篇 物理学
- 3 篇 生物学
- 1 篇 地质学
52 篇 管理学
- 35 篇 管理科学与工程(可...
- 23 篇 工商管理
- 20 篇 图书情报与档案管...
6 篇 经济学
- 6 篇 应用经济学
4 篇 教育学
- 4 篇 教育学
3 篇 法学
- 3 篇 社会学

主题

164 篇 design
155 篇 languages
96 篇 performance
70 篇 computer program...
56 篇 algorithms
43 篇 experimentation
42 篇 computer program...
39 篇 verification
34 篇 reliability
32 篇 object oriented ...
27 篇 probabilistic pr...
26 篇 java programming...
26 篇 functional progr...
25 篇 program synthesi...
22 篇 java
19 篇 theory
19 篇 concurrency
18 篇 domain-specific ...
17 篇 compilers
17 篇 type systems

机构

15 篇 carnegie mellon ...
13 篇 princeton univ p...
11 篇 univ texas austi...
10 篇 univ michigan an...
10 篇 rice univ housto...
10 篇 purdue univ w la...
10 篇 univ calif berke...
9 篇 univ wisconsin m...
9 篇 harvard univ cam...
9 篇 univ penn philad...
9 篇 stanford univ st...
9 篇 univ washington ...
8 篇 mit cambridge ma...
8 篇 yale univ new ha...
8 篇 cornell univ ith...
8 篇 univ chicago il ...
7 篇 northeastern uni...
7 篇 microsoft resear...
6 篇 microsoft res re...
6 篇 microsoft res re...

作者

11 篇 walker david
10 篇 chlipala adam
10 篇 dillig isil
8 篇 solar-lezama arm...
8 篇 chaudhuri swarat
7 篇 august david i.
7 篇 shao zhong
7 篇 sarkar vivek
6 篇 wang xinyu
6 篇 grossman dan
6 篇 adl-tabatabai al...
6 篇 aiken alex
6 篇 foster nate
6 篇 bacon david f.
6 篇 gulwani sumit
6 篇 myers andrew c.
6 篇 mezini mira
6 篇 mahlke scott
6 篇 mansinghka vikas...
6 篇 bodik rastislav

语言

841 篇 英文
76 篇 其他
1 篇 中文

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

共 918 条记录，以下是411-420 订阅

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

详细简洁

排序：

programming Model for a Heterogeneous x86 Platform 09

Programming Model for a Heterogeneous x86 Platform

引用

acm sigplan conference on programming language design and implementation

作者： Saha, Bratin Zhou, Xiaocheng Chen, Hu Gao, Ying Yan, Shoumeng Rajagopalan, Mohan Fang, Jesse Zhang, Peinan Ronen, Ronny Mendelson, Avi Intel Corp Santa Clara CA 95051 USA

ISBN: (纸本)9781605583921

The client computing platform is moving towards a heterogeneous architecture consisting of a combination of cores focused on scalar performance, and a set of throughput-oriented cores. The throughput oriented cores (e.g. a GPU) may be connected over both coherent and non-coherent interconnects, and have different ISAs. This paper describes a programming model for such heterogeneous platforms. We discuss the language constructs, runtime implementation, and the memory model for such a programming environment. We implemented this programming environment in a x86 heterogeneous platform simulator. We ported a number of workloads to our programming environment, and present the performance of our programming environment on these workloads.

关键词： heterogeneous platforms programming model

来源：评论

学校读者我要写书评

暂无评论

Verifiable Composition of Deterministic Grammars 09

Verifiable Composition of Deterministic Grammars

引用

acm sigplan conference on programming language design and implementation

作者： Schwerdfeger, August C. Van Wyk, Eric R. Univ Minnesota Dept Comp Sci & Engn Minneapolis MN 55455 USA

ISBN: (纸本)9781605583921

There is an increasing interest in extensible languages, (domain-specific) language extensions, and mechanisms for their specification and implementation. One challenge is to develop tools that allow non-expert programmers to add an eclectic set of language extensions to a host language. We describe mechanisms for composing and analyzing concrete syntax specifications of a host language and extensions to it. These specifications consist of context-free grammars with each terminal symbol mapped to a regular expression, from which a slightly-modified LR parser and context-aware scanner are generated. Traditionally, conflicts are detected when a parser is generated from the composed grammar, but this comes too late since it is the non-expert programmer directing the composition of independently developed extensions with the host language. The primary contribution of this paper is a modular analysis that is performed independently by each extension designer on her extension ( composed alone with the host language). If each extension passes this modular analysis, then the language composed later by the programmer will compile with no conflicts or lexical ambiguities. Thus, extension writers can verify that their extension will safely compose with others and, if not, fix the specification so that it will. This is possible due to the context-aware scanner's lexical disambiguation and a set of reasonable restrictions limiting the constructs that can be introduced by an extension. The restrictions ensure that the parse table states can be partitioned so that each state can be attributed to the host language or a single extension.

关键词： languages Algorithms Verification LR Parsing context-aware scanning language composition grammar composition extensible languages

来源：评论

学校读者我要写书评

暂无评论

Typed Self-Representation 09

Typed Self-Representation

引用

acm sigplan conference on programming language design and implementation

作者： Rendel, Tillmann Ostermann, Klaus Hofer, Christian Univ Aarhus DK-8000 Aarhus C Denmark

ISBN: (纸本)9781605583921

Self-representation - the ability to represent programs in their own language - has important applications in reflective languages and many other domains of programming language design. Although approaches to designing typed program representations for sublanguages of some base language have become quite popular recently, the question whether a fully metacircular typed self-representation is possible is still open. This paper makes a big step towards this aim by defining the F(omega)* calculus, an extension of the higher-order polymorphic lambda calculus F. that allows type self-representations. While the usability of these representations for metaprogramming is still limited, we believe that our approach makes a significant step towards a new generation of reflective languages that are both safe and efficient.

关键词： Lambda Calculus language design Reflection Self Interpretation Types

来源：评论

学校读者我要写书评

暂无评论

A Decision Procedure for Subset Constraints over Regular languages 09

A Decision Procedure for Subset Constraints over Regular Lan...

引用

acm sigplan conference on programming language design and implementation

作者： Hooimeijer, Pieter Weimer, Westley Univ Virginia Charlottesville VA 22903 USA

ISBN: (纸本)9781605583921

Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings, and are often manipulated using high-level string operations such as equality checks, regular expression matching, and string concatenation. It is difficult to reason about these operations because they are not well-integrated into current constraint solvers. We present a decision procedure that solves systems of equations over regular language variables. Given such a system of constraints, our algorithm finds satisfying assignments for the variables in the system. We define this problem formally and render a mechanized correctness proof of the core of the algorithm. We evaluate its scalability and practical utility by applying it to the problem of automatically finding inputs that cause SQL injection vulnerabilities.

关键词： decision procedure regular language

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Automatic Generation of Library Bindings Using Static Analysis 09

Automatic Generation of Library Bindings Using Static Analys...

引用

acm sigplan conference on programming language design and implementation

作者： Ravitch, Tristan Jackson, Steve Aderhold, Eric Liblit, Ben Univ Wisconsin Dept Comp Sci Madison WI 53706 USA

ISBN: (纸本)9781605583921

High-level languages are growing in popularity. However, decades of C software development have produced large libraries of fast, time-tested, meritorious code that are impractical to recreate from scratch. Cross-language bindings can expose low-level C code to high-level languages. Unfortunately, writing bindings by hand is tedious and error-prone, while mainstream binding generators require extensive manual annotation or fail to offer the language features that users of modem languages have come to expect. We present an improved binding-generation strategy based on static analysis of unannotated library source code. We characterize three high-level idioms that are not uniquely expressible in C's low-level type system: array parameters, resource managers, and multiple return values. We describe a suite of interprocedural analyses that recover this high-level information, and we show how the results can be used in a binding generator for the Python programming language. In experiments with four large C libraries, we find that our approach avoids the mistakes characteristic of hand-written bindings while offering a level of Python integration unmatched by prior automated approaches. Among the thousands of functions in the public interfaces of these libraries, roughly 40% exhibit the behaviors detected by our static analyses.

关键词： FFI foreign function interfaces bindings libraries dataflow analysis modular static program analysis multi-language code reuse

来源：评论

学校读者我要写书评

暂无评论

Trace-based Just-in-Time Type Specialization for Dynamic languages 09

Trace-based Just-in-Time Type Specialization for Dynamic Lan...

引用

acm sigplan conference on programming language design and implementation

作者： Gal, Andreas Eich, Brendan Shaver, Mike Anderson, David Mandelin, David Haghighat, Mohammad R. Kaplan, Blake Hoare, Graydon Zbarsky, Boris Orendorff, Jason Ruderman, Jesse Smith, Edwin Reitmaier, Rick Bebenita, Michael Chang, Mason Franz, Michael Intel Corp Santa Clara CA 95051 USA Univ Calif Irvine Irvine CA USA

ISBN: (纸本)9781605583921

Dynamic languages such as JavaScript are more difficult to compile than statically typed ones. Since no concrete type information is available, traditional compilers need to emit generic code that can handle all possible type combinations at runtime. We present an alternative compilation technique for dynamically-typed languages that identifies frequently executed loop traces at run-time and then generates machine code on the fly that is specialized for the actual dynamic types occurring on each path through the loop. Our method provides cheap inter-procedural type specialization, and an elegant and efficient way of incrementally compiling lazily discovered alternative paths through nested loops. We have implemented a dynamic compiler for JavaScript based on our technique and we have measured speedups of 10x and more for certain benchmark programs.

关键词： design Experimentation Measurement Performance JavaScript just-in-time compilation trace trees

来源：评论

学校读者我要写书评

暂无评论

An Integrated Proof language for Imperative Programs 09

An Integrated Proof Language for Imperative Programs

引用

acm sigplan conference on programming language design and implementation

作者： Zee, Karen Kuncak, Viktor Rinard, Martin C. CSAIL MIT Cambridge MA USA Ecole Polytech Fed Lausanne IC Lausanne VD Switzerland

ISBN: (纸本)9781605583921

We present an integrated proof language for guiding the actions of multiple reasoning systems as they work together to prove complex correctness properties of imperative programs. The language operates in the context of a program verification system that uses multiple reasoning systems to discharge generated proof obligations. It is designed to 1) enable developers to resolve key choice points in complex program correctness proofs, thereby enabling automated reasoning systems to successfully prove the desired correctness properties;2) allow developers to identify key lemmas for the reasoning systems to prove, thereby guiding the reasoning systems to find an effective proof decomposition;3) enable multiple reasoning systems to work together productively to prove a single correctness property by providing a mechanism that developers can use to divide the property into lemmas, each of which is suitable for a different reasoning system;and 4) enable developers to identify specific lemmas that the reasoning systems should use when attempting to prove other lemmas or correctness properties, thereby appropriately confining the search space so that the reasoning systems can find a proof in an acceptable amount of time. The language includes a rich set of declarative proof constructs that enables developers to direct the reasoning systems as little or as much as they desire. Because the declarative proof statements are embedded into the program as specialized comments, they also serve as verified documentation and are a natural extension of the assertion mechanism found in most program verification systems. We have implemented our integrated proof language in the context of a program verification system for Java and used the resulting system to verify a collection of linked data structure implementations. Our experience indicates that our proof language makes it possible to successfully prove complex program correctness properties that are otherwise beyond the reach of autom

关键词： Algorithms languages Reliability Verification verification theorem prover proof system

来源：评论

学校读者我要写书评

暂无评论

implementation of the Memory-safe Full ANSI-C Compiler 09

Implementation of the Memory-safe Full ANSI-C Compiler

引用

acm sigplan conference on programming language design and implementation

作者： Oiwa, Yutaka Natl Inst Adv Ind Sci & Technol Res Ctr Informat Secur RCIS Tokyo Japan

ISBN: (纸本)9781605583921

This paper describes a completely memory-safe compiler for C language programs that is fully compatible with the ANSI C specification. Programs written in C often suffer from nasty errors due to dangling pointers and buffer overflow. Such errors in Internet server programs are often exploited by malicious attackers to crack an entire system. The origin of these errors is usually corruption of in-memory data structures caused by out-of-bound array accesses. Usual C compilers do not provide any protection against such out-of-bound access, although many other languages such as Java and ML do provide such protection. There have been several proposals for preventing such memory corruption from various aspects: runtime buffer overrun detectors, designs for new C-like languages, and compilers for (subsets of) the C language. However, as far as we know, none of them have achieved full memory protection and full compatibility with the C language specification at the same time. We propose the most powerful solution to this problem ever presented. We have developed Fail-Safe C, a memory-safe implementation of the full ANSI C language. It detects and disallows all unsafe operations, yet conforms to the full ANSI C standard (including casts and unions). This paper introduces several techniques-both compile-time and runtime-to reduce the overhead of runtime checks, while still maintaining 100% memory safety. This compiler lets programmers easily make their programs safe without heavy rewriting or porting of their code. It also supports many of the "dirty tricks" commonly used in many existing C programs, which do not strictly conform to the standard specification. In this paper, we demonstrate several real-world server programs that can be processed by our compiler and present technical details and benchmark results for it.

关键词： Memory Safety C language

来源：评论

学校读者我要写书评

暂无评论

PetaBricks: A language and Compiler for Algorithmic Choice 09

PetaBricks: A Language and Compiler for Algorithmic Choice

引用

acm sigplan conference on programming language design and implementation

作者： Ansel, Jason Chan, Cy Wong, Yee Lok Olszewski, Marek Zhao, Qin Edelman, Alan Amarasinghe, Saman MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA

ISBN: (纸本)9781605583921

It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when considering different choices for data distributions, parallelism, transformations, and blocking. The best solution to these choices is often tightly coupled to different architectures, problem sizes, data, and available system resources. In some cases, completely different algorithms may provide the best performance. Current compiler and programming language techniques are able to change some of these parameters, but today there is no simple way for the programmer to express or the compiler to choose different algorithms to handle different parts of the data. Existing solutions normally can handle only coarse-grained, library level selections or hand coded cutoffs between base cases and recursive cases. We present PetaBricks, a new implicitly parallel language and compiler where having multiple implementations of multiple algorithms to solve a problem is the natural way of programming. We make algorithmic choice a first class construct of the language. Choices are provided in a way that also allows our compiler to tune at a finer granularity. The PetaBricks compiler autotunes programs by making both fine-grained as well as algorithmic choices. Choices also include different automatic parallelization techniques, data distributions, algorithmic parameters, transformations, and blocking. Additionally, we introduce novel techniques to autotune algorithms for different convergence criteria. When choosing between various direct and iterative methods, the PetaBricks compiler is able to tune a program in such a way that delivers near-optimal efficiency for any desired level of accuracy. The compiler has the flexibility of utilizing different convergence criteria for the various components within a single algorithm, providing the user with accuracy choice alongside algorithmic choice.

关键词： Algorithms languages Performance

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共92页 << < 38 39 40 41 42 43 44 45 46 47 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：