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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A formal concurrency model based architecture description language for synthesis of software development tools 04

A formal concurrency model based architecture description la...

引用

conference on languages, Compilers and Tools for Embedded Systems

作者： Qin, W Rajagopalan, S Malik, S Princeton Univ Dept Elect Engn Princeton NJ 08544 USA

ISBN: (纸本)9781581138061

Rapidly increasing design and manufacturing non-recurring engineering (NRE) costs are prompting a shift in electronic design from hardwired application specific integrated circuits (ASICs) to the use of software on programmable platforms. However, in order to minimize the power and performance overhead of such processors, we are seeing the introduction of domain or application specific processors such as network and communication processors. The design of such specialized processors requires software development tools such as simulators and compilers. In order to quickly develop these tools for multiple design points under consideration, it is highly desirable to have them synthesized from formal processor descriptions written in Architecture Description languages (ADLs). In this paper, we present the Mescal Architecture Description language (MADL). MADL features a two-layer structure, a core layer and an annotation layer. The core layer is based on a formal and flexible microprocessor model-the operation state machine (OSM), which enables MADL to express the concurrency at the operation execution level for a wide range of architectures. We address the challenges faced in designing the core layer to combine the OSM model with techniques for achieving compact processor descriptions. The annotation layer features a generic syntax that allows creating annotation schemes to specify implementation dependent or tool specific information. To show the effectiveness of MADL, we present an MADL-based simulator synthesis framework that has been used to generate efficient cycle accurate simulators and instruction set simulators with very low development effort. We also describe our annotation schemes that enable the extraction of architecture properties for use in instruction scheduling and integer-linear-programming based register allocation. Our experimental results demonstrate the efficacy of MADL as a practical and promising language for the development of programmable plat

关键词： design languages verification

来源：评论

学校读者我要写书评

暂无评论

iTasks: Executable specifications of interactive work flow systems for the web

iTasks: Executable specifications of interactive work flow s...

引用

12th acm sigplan International conference on Functional programming

作者： Plasmeijer, Rinus Achten, Peter Koopman, Pieter Radboud Univ Nijmegen Inst Comp & Informat Sci Software Technol Dept NL-6525 ED Nijmegen Netherlands

ISBN: (纸本)9781595938152

In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are automated systems in which tasks are coordinated that have to be executed by humans and computers. The combinators that we propose support work flow patterns commonly found in commercial work flow systems. Compared with most of these commercial systems, the iTask system offers several advantages: tasks are statically typed, tasks can be higher order, the combinators are fully compositional, dynamic and recursive work flows can be specified, and last but not least, the specification is used to generate an executable web-based multi-user work flow application. With the iTask system, useful work flows can be defined which cannot be expressed in other systems: work can be interrupted and subsequently directed to other workers for further processing. The implementation is special as well. It is based on the Clean iData toolkit which makes it possible to create fully dynamic, interactive, thin client web applications. Thanks to the generic programming techniques used in the iData toolkit, the programming effort is reduced significantly: state handling, form rendering, user interaction, and storage management is handled automatically. The iTask system allows a task to be regarded as a special kind of persistent redex being reduced by the application user via task completion. The combinators control the order in which these redexes are made available to the application user. The system rewrites the persistent task redexes in a similar way as functions are rewritten in lazy functional languages.

关键词： design languages clean iData iTask

来源：评论

学校读者我要写书评

暂无评论

Profile-guided proactive garbage collection for locality optimization 06

Profile-guided proactive garbage collection for locality opt...

引用

acm sigplan conference on programming language design and implementation, PLDI 2006 - PLAS 2006: 2006 programming languages and Analysis for Security Workshop

作者： Chen, Wen-Ke Bhansali, Sanjay Chilimbi, Trishul Gao, Xiaofeng Chuang, Weihaw Microsoft Research One Microsoft Way Redmond WA 98052 United States Dept. of Computer Science and Engineering University of California at San Diego San Diego CA 92093 United States

ISBN: (纸本)1595933743

Many applications written in garbage collected languages have large dynamic working sets and poor data locality. We present a new system for continuously improving program data locality at run time with low overhead. Our system proactively reorganizes the heap by leveraging the garbage collector and uses profile information collected through a low-overhead mechanism to guide the reorganization at run time. The key contributions include making a case that garbage collection should be viewed as a proactive technique for improving data locality by triggering garbage collection for locality optimization independently of normal garbage collection for space, combining page and cache locality optimization in the same system, and demonstrating that sampling provides sufficiently detailed data access information to guide both page and cache locality optimization with low runtime overhead. We present experimental results obtained by modifying a commercial, state-of-the-art garbage collector to support our claims. Independently triggering garbage collection for locality optimization significantly improved optimizations benefits. Combining page and cache locality optimizations in the same system provided larger average execution time improvements (17%) than either alone (page 8%, cache 7%). Finally, using sampling limited profiling overhead to less than 3%, on average. Copyright © 2006 acm.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Taming the Wildcards: Combining Definition- and Use-Site Variance 11

Taming the Wildcards: Combining Definition- and Use-Site Var...

引用

32nd acm sigplan conference on programming language design and implementation (PLDI 11)

作者： Altidor, John Huang, Shan Shan Smaragdakis, Yannis Univ Massachusetts Dept Comp Sci Amherst MA 01003 USA

ISBN: (纸本)9781450306638

Variance allows the safe integration of parametric and subtype polymorphism. Two flavors of variance, definition-site versus use-site variance, have been studied and have had their merits hotly debated. Definition-site variance (as in Scala and C#) offers simple type-instantiation rules, but causes fractured definitions of naturally invariant classes;Use-site variance (as in Java) offers simplicity in class definitions, yet complex type-instantiation rules that elude most programmers. We present a unifying framework for reasoning about variance. Our framework is quite simple and entirely denotational, that is, it evokes directly the definition of variance with a small core calculus that does not depend on specific type systems. This general framework can have multiple applications to combine the best of both worlds: for instance, it can be used to add use-site variance annotations to the Scala type system. We show one such application in detail: we extend the Java type system with a mechanism that modularly infers the definition-site variance of type parameters, while allowing use-site variance annotations on any type-instantiation. Applying our technique to six Java generic libraries (including the Java core library) shows that 20-58% (depending on the library) of generic definitions are inferred to have single-variance;8-63% of method signatures can be relaxed through this inference, and up to 91% of existing wildcard annotations are unnecessary and can be elided.

关键词： variance definition-site variance use-site variance wildcards language extensions

来源：评论

学校读者我要写书评

暂无评论

SAFECode: Enforcing alias analysis for weakly typed languages 06

SAFECode: Enforcing alias analysis for weakly typed language...

引用

PLDI 2006 - 2006 acm sigplan conference on programming language design and implementation

作者： Dhurjati, Dinakar Kowshik, Sumant Adve, Vikram University of Illinois Urbana-Champaign

ISBN: (纸本)1595933204

Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized pointers, and array bounds overflow. We describe a compilation strategy for standard C programs that guarantees that aggressive interprocedural pointer analysis (or less precise ones), a call graph, and type information for a subset of memory, are never invalidated by any possible memory errors. We formalize our approach as a new type system with the necessary run-time checks in operational semantics and prove the correctness of our approach for a subset of C. Our semantics provide the foundation for other sophisticated static analyses to be applied to C programs with a guarantee of soundness. Our work builds on a previously published transformation called Automatic Pool Allocation to ensure that hard-to-detect memory errors (dangling pointer references and certain array bounds errors) cannot invalidate the call graph, points-to information or type information. The key insight behind our approach is that pool allocation can be used to create a run-time partitioning of memory that matches the compile-time memory partitioning in a points-to graph, and efficient checks can be used to isolate the run-time partitions. Furthermore, we show that the sound analysis information enables static checking techniques that eliminate many run-time checks. Our approach requires no source code changes, allows memory to be managed explicitly, and does not use meta-data on pointers or individual tag bits for memory. Using several benchmarks and system codes, we show experimentally that the run-time overheads are low (less than 10% in nearly all cases and 30% in the worst case we have seen). We also show the effectiveness of static analyses in eliminating run-time checks. Copyright © 2006 acm.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Automatic Generation of Efficient Sparse Tensor Format Conversion Routines 2020

Automatic Generation of Efficient Sparse Tensor Format Conve...

引用

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

作者： Chou, Stephen Kjolstad, Fredrik Amarasinghe, Saman MIT CSAIL Cambridge MA 02139 USA Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781450376136

This paper shows how to generate code that efficiently converts sparse tensors between disparate storage formats (data layouts) such as CSR, DIA, ELL, and many others. We decompose sparse tensor conversion into three logical phases: coordinate remapping, analysis, and assembly. We then develop a language that precisely describes how different formats group together and order a tensor's nonzeros in memory. This lets a compiler emit code that performs complex remappings of nonzeros when converting between formats. We also develop a query language that can extract statistics about sparse tensors, and we show how to emit efficient analysis code that computes such queries. Finally, we define an abstract interface that captures how data structures for storing a tensor can be efficiently assembled given specific statistics about the tensor. Disparate formats can implement this common interface, thus letting a compiler emit optimized sparse tensor conversion code for arbitrary combinations of many formats without hard-coding for any specific combination. Our evaluation shows that the technique generates sparse tensor conversion routines with performance between 1.00 and 2.01x that of hand-optimized versions in SPARSKIT and Intel MKL, two popular sparse linear algebra libraries. And by emitting code that avoids materializing temporaries, which both libraries need for many combinations of source and target formats, our technique outperforms those libraries by 1.78 to 4.01x for CSC/COO to DIA/ELL conversion.

关键词： sparse tensor conversion sparse tensor assembly sparse tensor algebra sparse tensor formats coordinate remapping notation attribute query language

来源：评论

学校读者我要写书评

暂无评论

The HipHop Compiler for PHP 12

The HipHop Compiler for PHP

引用

acm International conference on Object Oriented programming Systems languages and Applications

作者： Zhao, Haiping Proctor, Iain Yang, Minghui Qi, Xin Williams, Mark Gao, Qi Ottoni, Guilherme Paroski, Andrew MacVicar, Scott Evans, Jason Tu, Stephen Facebook Inc Menlo Pk CA USA

ISBN: (纸本)9781450315616

Scripting languages are widely used to quickly accomplish a variety of tasks because of the high productivity they enable. Among other reasons, this increased productivity results from a combination of extensive libraries, fast development cycle, dynamic typing, and polymorphism. The dynamic features of scripting languages are traditionally associated with interpreters, which is the approach used to implement most scripting languages. Although easy to implement, interpreters are generally slow, which makes scripting languages prohibitive for implementing large, CPU-intensive applications. This efficiency problem is particularly important for PHP given that it is the most commonly used language for server-side web development. This paper presents the design, implementation, and an evaluation of the HipHop compiler for PHP. HipHop goes against the standard practice and implements a very dynamic language through static compilation. After describing the most challenging PHP features to support through static compilation, this paper presents HipHop's design and techniques that support almost all PHP features. We then present a thorough evaluation of HipHop running both standard benchmarks and the Facebook web site. Overall, our experiments demonstrate that HipHop is about 5.5x faster than standard, interpreted PHP engines. As a result, HipHop has reduced the number of servers needed to run Facebook and other web sites by a factor between 4 and 6, thus drastically cutting operating costs.

关键词： languages design Performance PHP dynamic languages compilation C plus

来源：评论

学校读者我要写书评

暂无评论

GPCE 2016 - proceedings of the 2016 acm sigplan International conference on Generative programming: Concepts and Experiences, co-located with SPLASH 2016

GPCE 2016 - Proceedings of the 2016 ACM SIGPLAN Internationa...

引用

15th acm sigplan International conference on Generative programming: Concepts and Experiences, GPCE 2016

ISBN: (纸本)9781450344463

The proceedings contain 20 papers. The topics discussed include: Recaf: Java dialects as libraries;classless Java;extensible modeling with managed data in Java;actor profiling in virtual execution environments;bootstrapping domain-specific meta-languages in language workbenches;dependence-driven delimited CPS transformation for JavaScript;synthesizing regular expressions from examples for introductory automata assignments;programmable semantic fragments: the design and implementation of typy;delaying decisions in variable concern hierarchies;automatic code generation in practice: experiences with embedded robot controllers;a change-centric approach to compile configurable systems with #ifdefs;a feature-based personalized recommender system for product-line configuration;IncLing: efficient product-line testing using incremental pairwise sampling;towards a software product line of trie-based collections;tool demo: testing configurable systems with FeatureIDE;automated regression testing of BPMN 2.0 processes: a capture and replay framework for continuous delivery;a vision for online verification-validation;and automatic non-functional testing of code generators families.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SPIL: A language for construction of reliable system software

SPIL: A Language for construction of reliable system softwar...

引用

1973 acm sigplan - SIGOPS Interface Meeting: programming languages - Operating Systems

作者： Liskov, Barbara H. Smith, Leroy A. Massachusetts Institute of Technology CambridgeMA United States MITRE Corporation BedfordMA United States

Structured programming is gaining wide acceptance as a technique for increasing the reliability and understandability of software. Nowhere is the need for better software felt more keenly than in the area of systems programming. In the near future it is likely that systems will be programmed in structured programming languages, just as systems have been programmed in higher level languages in the past. This paper describes SPIL: a structured programming language intended to be used for system design and implementation. The paper discusses how the objectives of structured programming and system programming may be realized in a programming language, and delineates the influence of the objectives on the design of SPIL. The most important features of the language are briefly described. The paper concludes by evaluating SPIL as a language for system design and implementation. © 1973 Association for Computing Machinery. All rights reserved.

关键词： Systems analysis

来源：评论

学校读者我要写书评

暂无评论

Green-Marl: A DSL for Easy and Efficient Graph Analysis

Green-Marl: A DSL for Easy and Efficient Graph Analysis

引用

17th International conference on Architectural Support for programming languages and Operating Systems

作者： Hong, Sungpack Chafi, Hassan Sedlar, Eric Olukotun, Kunle Stanford Univ Pervas Parallelism Lab Stanford CA 94305 USA

ISBN: (纸本)9781450307598

The increasing importance of graph-data based applications is fueling the need for highly efficient and parallel implementations of graph analysis software. In this paper we describe Green-Marl, a domain-specific language (DSL) whose high level language constructs allow developers to describe their graph analysis algorithms intuitively, but expose the data-level parallelism inherent in the algorithms. We also present our Green-Marl compiler which translates high-level algorithmic description written in Green-Marl into an efficient C++ implementation by exploiting this exposed data-level parallelism. Furthermore, our Green-Marl compiler applies a set of optimizations that take advantage of the high-level semantic knowledge encoded in the Green-Marl DSL. We demonstrate that graph analysis algorithms can be written very intuitively with Green-Marl through some examples, and our experimental results show that the compiler-generated implementation out of such descriptions performs as well as or better than highly-tuned handcoded implementations.

关键词： Algorithms design Performance Graph Domain-Specific language Parallel programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共129页 << < 54 55 56 57 58 59 60 61 62 63 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：