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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

278 篇 会议
41 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

275 篇 工学
- 267 篇 软件工程
- 141 篇 计算机科学与技术...
- 7 篇 电气工程
- 3 篇 生物工程
- 2 篇 信息与通信工程
- 2 篇 控制科学与工程
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 化学工程与技术
- 1 篇 纺织科学与工程
- 1 篇 生物医学工程（可授...
10 篇 理学
- 8 篇 数学
- 1 篇 化学
- 1 篇 地质学
- 1 篇 生物学
6 篇 管理学
- 3 篇 管理科学与工程(可...
- 3 篇 图书情报与档案管...
2 篇 农学
- 2 篇 作物学
1 篇 教育学
- 1 篇 教育学

主题

80 篇 design
73 篇 languages
32 篇 performance
17 篇 verification
16 篇 algorithms
14 篇 reliability
14 篇 probabilistic pr...
13 篇 object oriented ...
13 篇 program synthesi...
13 篇 domain-specific ...
13 篇 functional progr...
11 篇 java
10 篇 experimentation
10 篇 programming lang...
9 篇 type systems
9 篇 theory
9 篇 concurrency
7 篇 compilers
7 篇 optimization
6 篇 modules

机构

9 篇 carnegie mellon ...
8 篇 purdue univ w la...
6 篇 princeton univ p...
5 篇 northeastern uni...
5 篇 yale univ new ha...
5 篇 harvard univ cam...
5 篇 cornell univ ith...
5 篇 univ washington ...
5 篇 univ calif berke...
4 篇 univ wisconsin m...
4 篇 univ calif davis...
4 篇 univ utah salt l...
4 篇 univ penn philad...
4 篇 rice univ housto...
4 篇 univ chicago il ...
4 篇 stanford univ st...
4 篇 univ texas austi...
3 篇 mit csail cambri...
3 篇 univ cambridge c...
3 篇 microsoft res re...

作者

7 篇 walker david
6 篇 foster nate
5 篇 shao zhong
5 篇 gulwani sumit
5 篇 dillig isil
4 篇 rainey mike
4 篇 gu ronghui
4 篇 rompf tiark
4 篇 solar-lezama arm...
4 篇 chaudhuri swarat
4 篇 myers andrew c.
4 篇 wansbrough keith
3 篇 hirschfeld rober...
3 篇 flatt matthew
3 篇 rajamani sriram
3 篇 seshia sanjit a.
3 篇 rajan hridesh
3 篇 huang jeff
3 篇 liu yu david
3 篇 vechev martin

语言

283 篇 英文
36 篇 其他
1 篇 中文

检索条件"任意字段=37th ACM SIGPLAN Conference on Programming Language Design and Implementation"

共 320 条记录，以下是281-290 订阅

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

详细简洁

排序：

A practical type system and language for reference immutability 04

A practical type system and language for reference immutabil...

引用

19th Annual acm conference on Object-Oriented programming, Systems, languages, and Applications, OOPSLA'04

作者： Birka, Adrian Ernst, Michael D. MIT Comp. Sci./Artif. Intell. Lab. Cambridge MA 02139 United States

ISBN: (纸本)1581138318

this paper describes a type system that is capable of expressing and enforcing immutability constraints. the specific constraint expressed is that the abstract state of the object to which an immutable reference refers cannot be modified using that reference. the abstract state is (part of) the transitively reachable state: that is, the state of the object and all state reachable from it by following references. the type system permits explicitly excluding fields or objects from the abstract state of an object. For a statically type-safe language, the type system guarantees reference immutability. If the language is extended with immutability downcasts, then run-time checks enforce the reference immutability constraints. In order to better understand the usability and efficacy of the type system, we have implemented an extension to Java, called Javari, that includes all the features of our type system. Javari is interoperable with Java and existing JVMs. It can be viewed as a proposal for the semantics of the Java const keyword, though Javari's syntax uses readonly instead. this paper describes the design and implementation of Javari, including the type-checking rules for the language. this paper also discusses experience with 160,000 lines of Javari code. Javari was easy to use and provided a number of benefits, including detecting errors in well-tested code.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Spatial computation

Spatial computation

引用

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

作者： Budiu, M Venkataramani, G Chelcea, T Goldstein, SC Carnegie Mellon Univ Pittsburgh PA 15213 USA

this paper describes a computer architecture, Spatial Computation (SC), which is based on the translation of high-level language programs directly into hardware structures. SC program implementations are completely distributed, with no centralized control. SC circuits are optimized for wires at the expense of computation units. In this paper we investigate a particular implementation of SC: ASH (Application-Specific Hardware). Under the assumption that computation is cheaper than communication, ASH replicates computation units to simplify interconnect, building a system which uses very simple, completely dedicated communication channels. As a consequence, communication on the datapath never requires arbitration;the only arbitration required is for accessing memory. ASH relies on very simple hardware primitives, using no associative structures, no multiported register files, no scheduling logic, no broadcast, and no clocks. As a consequence, ASH hardware is fast and extremely power efficient. In this work we demonstrate three features of ASH: (1) that such architectures can be built by automatic compilation of C programs;(2) that distributed computation is in some respects fundamentally different from monolithic superscalar processors;and (3) that ASIC implementations of ASH use three orders of magnitude less energy compared to high-end superscalar processors, while being on average only 33% slower in performance (3.5x worst-case).

关键词： measurement performance design spatial computation dataflow machine application-specific hardware low-power

来源：评论

学校读者我要写书评

暂无评论

A practical type system and language for reference immutability

A practical type system and language for reference immutabil...

引用

19th conference on Object-Oriented programming, Systems, languages, and Applications

作者： Birka, A Ernst, MD MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA

关键词： type system verification immutability readonly mutable Javari Java const

来源：评论

学校读者我要写书评

暂无评论

Mirrors: design principles for meta-level facilities of object-oriented programming languages 04

Mirrors: design principles for meta-level facilities of obje...

引用

Proceedings of the 19th annual acm sigplan conference on Object-oriented programming, systems, languages, and applications

作者： Gilad Bracha David Ungar Sun Microsystems Santa Clara CA Sun Microsystems Mountain View CA

We identify three design principles for reflection and metaprogramming facilities in object oriented programming languages. Encapsulation: meta-level facilities must encapsulate their implementation. Stratification: m... 详细信息

ISBN: (纸本)9781581138313

We identify three design principles for reflection and metaprogramming facilities in object oriented programming languages. Encapsulation: meta-level facilities must encapsulate their implementation. Stratification: meta-level facilities must be separated from base-level functionality. Ontological correspondence: the ontology of meta-level facilities should correspond to the ontology of the language they manipulate. Traditional/mainstream reflective architectures do not follow these precepts. In contrast, reflective APIs built around the concept of mirrors are characterized by adherence to these three principles. Consequently, mirror-based architectures have significant advantages with respect to distribution, deployment and general purpose metaprogramming.

关键词： smalltalk mirrors java metaprogramming reflection self

来源：评论

学校读者我要写书评

暂无评论

language support for lightweight transactions

Language support for lightweight transactions

引用

18th Annual conference on Object-Oriented programming, Systems, languages and Applications (OOPSLA 2003)

作者： Harris, T Fraser, K Univ Cambridge Comp Lab Cambridge CB3 0FD England

Concurrent programming is notoriously difficult. Current abstractions are intricate and make it hard to design computer systems that are reliable and scalable. We argue that these problems can be addressed by moving to a declarative style of concurrency control in which programmers directly indicate the safety properties that they require. In our scheme the programmer demarks sections of code which execute within lightweight software-based transactions that commit atomically and exactly once. these transactions can update shared data, instantiate objects, invoke library features and so on. they can also block, waiting for arbitrary boolean conditions to become true. Transactions which do not access the same shared memory locations can commit concurrently. Furthermore, in general, no performance penalty is incurred for memory accesses outside transactions. We present a detailed design of this proposal along with an implementation and evaluation. We argue that the resulting system (i) is easier for mainstream programmers to use, (ii) prevents lock-based priority-inversion and deadlock problems and (iii) can offer performance advantages.

关键词： concurrency conditional critical regions transactions non-blocking systems

来源：评论

学校读者我要写书评

暂无评论

A first-class approach to genericity

A first-class approach to genericity

引用

18th Annual conference on Object-Oriented programming, Systems, languages and Applications (OOPSLA 2003)

作者： Allen, E Bannet, J Cartwright, R Rice Univ Houston TX 77005 USA

this paper describes how to add first-class generic types including mixins - to strongly-typed 00 languages with nominal subtyping such as Java and C#. A generic type system is "first-class" if generic types can appear in any context where conventional types can appear. In this context, a mixin is simply a generic class that extends one of its type parameters, e.g., a class C that extends T. Although mixins of this form are widely used in C++ (via templates), they are clumsy and error-prone because C++ treats mixins as macros, forcing each mixin instantiation to be separately compiled and type-checked. the abstraction embodied in a mixin is never separately analyzed. Our formulation of mixins using first-class genericity accommodates sound local (class-by-class) type checking. A mixin can be fully type-checked given symbol tables for each of the classes that it directly references-the same context in which Java performs incremental class compilation. To our knowledge, no previous formal analysis of first-class genericity in languages with nominal type systems has been conducted, which is surprising because nominal subtyping has become predominant in mainstream object-oriented programming languages. What makes our treatment of first-class genericity particularly interesting and important is the fact that it can be added to the existing Java language without any change to the underlying Java Virtual Machine. Moreover, the extension is backward compatible with legacy Java source and class files. Although our discussion of a, practical implementation strategy focuses on Java, the same implementation techniques could be applied to other object-oriented languages such as C# or Eiffel that support incremental compilation, dynamic class loading, and nominal subtyping.

关键词： design languages

来源：评论

学校读者我要写书评

暂无评论

language support for connector abstractions 17th

引用

17th European conference on Object-Oriented programming (ECOOP 2003)

作者： Aldrich, J Sazawal, V Chambers, C Notkin, D Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA

ISBN: (纸本)3540405313

Software connectors are increasingly recognized as an important consideration in the design and implementation of object-oriented software systems. Connectors can be used to communicate across a distributed system, coordinate the activities of several objects, or adapt one object's interface to the interface of another. Mainstream object-oriented languages, however, do not provide explicit support for connectors. As a result, connection code is intermingled with application code, making it difficult to understand, evolve, and reuse connection mechanisms. In this paper, we add language support for user-defined connectors to the ArchJava language. Our design enables a wide range of connector abstractions, including caches, events, streams, and remote method calls. Developers can describe both the run-time semantics of connectors and the typechecking semantics. the connector abstraction supported by ArchJava cleanly separates reusable connection code from application logic, making the semantics of connections more explicit and allowing engineers to easily change the connection mechanisms used in a program. We evaluate the expressiveness and the engineering benefits of our design in a case study applying ArchJava to the PlantCare ubiquitous computing application.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

language support for lightweight transactions 03

Language support for lightweight transactions

引用

Proceedings of the 18th annual acm sigplan conference on Object-oriented programing, systems, languages, and applications

作者： Tim Harris Keir Fraser University of Cambridge Computer Laboratory Cambridge UK

ISBN: (纸本)9781581137125

Concurrent programming is notoriously difficult. Current abstractions are intricate and make it hard to design computer systems that are reliable and scalable. We argue that these problems can be addressed by moving to a declarative style of concurrency control in which programmers directly indicate the safety properties that they require. In our scheme the programmer demarks sections of code which execute within lightweight software-based transactions that commit atomically and exactly once. these transactions can update shared data, instantiate objects, invoke library features and so on. they can also block, waiting for arbitrary boolean conditions to become true. Transactions which do not access the same shared memory locations can commit concurrently. Furthermore, in general, no performance penalty is incurred for memory accesses outside *** present a detailed design of this proposal along with an implementation and evaluation. We argue that the resulting system (i) is easier for mainstream programmers to use, (ii) prevents lock-based priority-inversion and deadlock problems and (iii) can offer performance advantages.

关键词： transactions conditional critical regions concurrency non-blocking systems

来源：评论

学校读者我要写书评

暂无评论

Composable and compilable macros -: You want it when?

Composable and compilable macros -: You want it <i>when</i>?

引用

7th International conference on Functional programming

作者： Flatt, M Univ Utah Salt Lake City UT 84112 USA

Many macro systems, especially for Lisp and Scheme, allow macro transformers to perform general computation. Moreover, the language for implementing compile-time macro transformers is usually the same as the language for implementing run-time functions. As a side effect of this sharing, implementations tend to allow the mingling of compile-time values and rum-time values, as well as values from separate compilations. Such mingling breaks programming tools that must parse code without executing it. Macro implementors avoid harmful mingling by obeying certain macro-definition protocols and by inserting phase-distinguishing annotations into the code. However, the annotations are fragile, the protocols are not enforced, and programmers can only reason about the result in terms of the compiler's implementation. MzScheme-the language of the PLT Scheme tool suite-addresses the problem through a macro system that separates compilation without sacrificing the expressiveness of macros.

关键词： languages design macros modules language tower

来源：评论

学校读者我要写书评

暂无评论

Multiple instances and symbolic variables in executable sequence charts 02

Multiple instances and symbolic variables in executable sequ...

引用

17th Meeting on Object-Oriented programming, Systems, languages and Applications (OOPSLA 2002)

作者： Marelly, R Harel, D Kugler, H Weizmann Inst Sci Dept Comp Sci & Appl Math IL-76100 Rehovot Israel

ISBN: (纸本)9781581134711

We extend live sequence charts (LSCs), a highly expressive variant of sequence diagrams, and provide the extension with an executable semantics. the extension involves support for instances that can bind to multiple objects and symbolic variables that can bind to arbitrary values. the result is a powerful executable language for expressing behavioral requirements on the level of inter-object interaction. the extension is implemented in full in our play-engine tool, with which one can execute the requirements directly without the need to build or synthesize an intra-object system model. It seems that in addition to many advantages in testing and requirements engineering, for some kinds of systems this could lead to the requirements actually serving as the final implementation.

关键词： design languages verification

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共32页 << < 23 24 25 26 27 28 29 30 31 32 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：