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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,112 篇 工学
- 1,037 篇 软件工程
- 800 篇 计算机科学与技术...
- 48 篇 控制科学与工程
- 43 篇 电气工程
- 36 篇 信息与通信工程
- 9 篇 电子科学与技术（可...
- 8 篇 机械工程
- 6 篇 安全科学与工程
- 5 篇 建筑学
- 5 篇 土木工程
- 5 篇 航空宇航科学与技...
- 5 篇 生物工程
- 4 篇 材料科学与工程（可...
- 4 篇 化学工程与技术
- 2 篇 力学（可授工学、理...
- 2 篇 光学工程
- 2 篇 农业工程
141 篇 理学
- 117 篇 数学
- 13 篇 系统科学
- 9 篇 统计学（可授理学、...
- 7 篇 生物学
- 5 篇 物理学
- 4 篇 化学
89 篇 管理学
- 53 篇 管理科学与工程(可...
- 41 篇 图书情报与档案管...
- 28 篇 工商管理
15 篇 教育学
- 15 篇 教育学
6 篇 经济学
- 6 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 农学
- 2 篇 作物学

主题

180 篇 design
167 篇 languages
103 篇 computer program...
99 篇 performance
59 篇 algorithms
49 篇 object oriented ...
49 篇 computer program...
45 篇 experimentation
45 篇 java programming...
39 篇 verification
35 篇 reliability
34 篇 java
32 篇 functional progr...
26 篇 program synthesi...
24 篇 probabilistic pr...
22 篇 software design
21 篇 theory
20 篇 concurrency
19 篇 domain-specific ...
18 篇 type systems

机构

16 篇 carnegie mellon ...
13 篇 princeton univ p...
12 篇 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 篇 microsoft res re...
9 篇 yale univ new ha...
9 篇 harvard univ cam...
9 篇 cornell univ ith...
9 篇 microsoft resear...
8 篇 univ chicago il ...
7 篇 microsoft res re...
7 篇 swiss fed inst t...
7 篇 mit cambridge ma...

作者

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 篇 rajan hridesh
6 篇 foster nate
6 篇 myers andrew c.
6 篇 mezini mira
6 篇 mahlke scott

语言

1,205 篇 英文
81 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the ACM Sigplan 2003 Conference on Programming Language Design and Implementation"

共 1287 条记录，以下是381-390 订阅

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

详细简洁

排序：

Duce: An XML-centric general-purpose language

Duce: An XML-centric general-purpose language

引用

proceedings of the 2003 acm sigplan International conference on Functional programming

作者： Benzaken, Véronique Castagna, Giuseppe Frisch, Alain Université Paris-Sud 91405 Orsay France CNRS Département d'Informatique École Normale Superieure 45 Rue d'Ulm Paris France Département d'Informatique École Normale Superieure 45 Rue d'Ulm Paris France

We present the functional language Duce, discuss some design issues, and show its adequacy for working with XML documents. Distinctive features of Duce are a powerful pattern matching, first class functions, overloaded functions, a very rich type system (arrows, sequences, pairs, records, intersections, unions, differences), precise type inference for patterns and error localization, and a natural interpretation of types as sets of values. We also outline some important implementation issues;in particular, a dispatch algorithm that demonstrates how static type information can be used to obtain very efficient compilation schemas.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Forest: A language and Toolkit for programming with Filestores 11

Forest: A Language and Toolkit for Programming with Filestor...

引用

16th acm sigplan International conference on Functional programming (ICFP 11)

作者： Fisher, Kathleen Foster, Nate Walker, David Zhu, Kenny Q. Tufts Univ Medford MA 02155 USA

ISBN: (纸本)9781450308656

A filestore is a structured collection of data files housed in a conventional hierarchical file system. Many applications use filestores as a poor-man's database, and the correct execution of these applications requires that the collection of files, directories, and symbolic links stored on disk satisfy a variety of precise invariants. Moreover, all of these structures must have acceptable ownership, permission, and timestamp attributes. Unfortunately, current programming languages do not provide support for documenting assumptions about filestores, detecting errors in them, or safely loading from and storing to them. This paper describes the design, implementation, and semantics of Forest, a new domain-specific language for describing filestores. The language uses a type-based metaphor to specify the expected structure, attributes, and invariants of filestores. Forest generates loading and storing functions that make it easy to connect data on disk to an isomorphic representation in memory that can be manipulated as if it were any other data structure. Forest also generates metadata that describes the degree to which the structures on the disk conform to the specification, making error detection easy. In a nutshell, Forest extends the rigorous discipline of typed programming languages to the untyped world of file systems. We have implemented Forest as an embedded domain-specific language in Haskell. In addition to generating infrastructure for reading, writing and checking file systems, our implementation generates type class instances that make it easy to build generic tools that operate over arbitrary filestores. We illustrate the utility of this infrastructure by building a file system visualizer, a file access checker, a generic query interface, description-directed variants of several standard UNIX shell tools and (circularly) a simple Forest description inference engine. Finally, we formalize a core fragment of Forest in a semantics inspired by classical tree

关键词： Data description languages file systems filestores domain-specific languages ad hoc data Haskell bidirectional transformations generic programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

TYPE DECLARATIONS AS SUBTYPE CONSTRAINTS IN LOGIC programming 90

TYPE DECLARATIONS AS SUBTYPE CONSTRAINTS IN LOGIC PROGRAMMIN...

引用

1990 CONF OF THE SPECIAL INTEREST GROUP ON programming languageS OF THE ASSOC FOR COMPUTING MACHINERY : programming language design AND implementation

作者： JACOBS, D UNIV SO CALIF LOS ANGELESCA 90089

ISBN: (纸本)9780897913645

This paper presents a type system for logic programs that supports parametric polymorphism and subtypes. This system follows most knowledge representation and object-oriented schemes in that subtyping is name-based, i.e., τ1 is considered to be a subtype of τ2 iff it is declared as such. We take this as a fundamental principle in the sense that type declarations have the form of subtype constraints. Types are assigned meaning by viewing such constraints as Horn clauses that, together with a few basic axioms, define a subtype predicate. This technique provides a (least) model for types and, at the same time, a sound and complete proof system for deriving subtypes. Using this proof system, we define well-typedness conditions which ensure that a logic program/query respects a set of predicate types. We prove that these conditions are consistent in the sense that every atom of every resolvent produced during the execution of a well-typed program is consistent with its type.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Light: Replay via Tightly Bounded Recording 15

Light: Replay via Tightly Bounded Recording

引用

36th acm sigplan conference on programming language design and implementation

作者： Liu, Peng Zhang, Xiangyu Tripp, Omer Zheng, Yunhui Purdue Univ W Lafayette IN 47907 USA

ISBN: (纸本)9781450334686

Reproducing concurrency bugs is a prominent challenge. Existing techniques either rely on recording very fine grained execution information and hence have high runtime overhead, or strive to log as little information as possible but provide no guarantee in reproducing a bug. We present Light, a technique that features much lower overhead compared to techniques based on fine grained recording, and that guarantees to reproduce concurrent bugs. We leverage and formally prove that recording flow dependences is the necessary and sufficient condition to reproduce a concurrent bug. The flow dependences, together with the thread local orders that can be automatically inferred (and hence not logged), are encoded as scheduling constraints. An SMT solver is used to derive a replay schedule, which is guaranteed to exist even though it may be different from the original schedule. Our experiments show that Light has only 44% logging overhead, almost one order of magnitude lower than the state of the art techniques relying on logging memory accesses. Its space overhead is only 10% of those techniques. Light can also reproduce all the bugs we have collected whereas existing techniques miss some of them.

关键词： design Performance Reliability Concurrency Replay Thread Determinism Tight Bound Local Recording

来源：评论

学校读者我要写书评

暂无评论

Exception handling in PL/I

Exception handling in PL/I

引用

acm conference on language design for Reliable Software 1977

作者： MacLaren, M. Donald Research and Development Digital Equipment Corporation 146 Main Street MaynardMA01754 United States

The PL/I language's facilities for handling exceptional conditions are analyzed. The description is based on the new PL/I standard. Special attention is given to fine points which are not well known. The analysis is generally critical. It emphasizes problems in regards to implementation and structured programming. A few suggestions for future language design are offered. © 1977 Association for Computing Machinery. All rights reserved.

关键词： Structured programming

来源：评论

学校读者我要写书评

暂无评论

Lightweight Multi-language Syntax Transformation with Parser Parser Combinators 2019

Lightweight Multi-Language Syntax Transformation with Parser...

引用

40th acm sigplan conference on programming language design and implementation (PLDI) part of acm's Federated Computing Research conference (FCRC)

作者： van Tonder, Rijnard Le Goues, Claire Carnegie Mellon Univ Sch Comp Sci Pittsburgh PA 15213 USA

ISBN: (纸本)9781450367127

Automatically transforming programs is hard, yet critical for automated program refactoring, rewriting, and repair. Multi-language syntax transformation is especially hard due to heterogeneous representations in syntax, parse trees, and abstract syntax trees (ASTs). Our insight is that the problem can be decomposed such that (1) a common grammar expresses the central context-free language (CFL) properties shared by many contemporary languages and (2) open extension points in the grammar allow customizing syntax (e.g., for balanced delimiters) and hooks in smaller parsers to handle language-specific syntax (e.g., for comments). Our key contribution operationalizes this decomposition using a Parser Parser combinator (PPC), a mechanism that generates parsers for matching syntactic fragments in source code by parsing declarative user-supplied templates. This allows our approach to detach from translating input programs to any particular abstract syntax tree representation, and lifts syntax rewriting to a modularly-defined parsing problem. A notable effect is that we skirt the complexity and burden of defining additional translation layers between concrete user input templates and an underlying abstract syntax representation. We demonstrate that these ideas admit efficient and declarative rewrite templates across 12 languages, and validate effectiveness of our approach by producing correct and desirable lightweight transformations on popular real-world projects (over 50 syntactic changes produced by our approach have been merged into 40+). Our declarative rewrite patterns require an order of magnitude less code compared to analog implementations in existing, language-specific tools.

关键词： syntax transformation parsers rewriting

来源：评论

学校读者我要写书评

暂无评论

Post-pass binary adaptation for software-based speculative precomputation

Post-pass binary adaptation for software-based speculative p...

引用

conference on programming language design and implementation (PLDI 02)

作者： Liao, SSW Wang, PH Wang, H Hoflehner, G Lavery, D Shen, JP

Recently, a number of thread-based prefetching techniques have been proposed. These techniques aim at improving the latency of single-threaded applications by leveraging multithreading resources to perform memory prefetching via speculative prefetch threads. Software-based speculative precomputation (SSP) is one such technique, proposed for multithreaded Itanium models. SSP does not require expensive hardware support-instead it relies on the compiler to adapt binaries to perform prefetching on otherwise idle hardware thread contexts at run time. This paper presents a post-pass compilation tool for generating SSP-enhanced binaries. The tool is able to: (1) analyze a single-threaded application to generate prefetch threads;(2) identify and embed trigger points in the original binary;and (3) produce a new binary that has the prefetch threads attached. The execution of the new binary spawns the speculative prefetch threads, which are executed concurrently with the main thread. Our results indicate that for a set of pointer-intensive benchmarks, the prefetching performed by the speculative threads achieves an average of 87% speedup on an in-order processor and 5% speedup on an out-of-order processor.

关键词： measurement performance design experimentation algorithms long-range thread-based prefetching pointer slicing slack chaining speculative precomputation speculation prediction scheduling postpass dependence reduction loop rotation delay minimization triggering

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共129页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：