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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

800 篇 会议
131 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

823 篇 工学
- 807 篇 软件工程
- 547 篇 计算机科学与技术...
- 22 篇 控制科学与工程
- 11 篇 信息与通信工程
- 7 篇 电气工程
- 5 篇 电子科学与技术（可...
- 4 篇 化学工程与技术
- 3 篇 机械工程
- 2 篇 材料科学与工程（可...
- 2 篇 建筑学
- 2 篇 交通运输工程
- 2 篇 安全科学与工程
- 1 篇 光学工程
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 纺织科学与工程
102 篇 理学
- 88 篇 数学
- 10 篇 系统科学
- 8 篇 统计学（可授理学、...
- 4 篇 化学
- 2 篇 物理学
- 2 篇 生物学
- 1 篇 地质学
53 篇 管理学
- 35 篇 管理科学与工程(可...
- 21 篇 工商管理
- 21 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
4 篇 教育学
- 4 篇 教育学
3 篇 法学
- 3 篇 社会学

主题

166 篇 design
155 篇 languages
96 篇 performance
74 篇 computer program...
56 篇 algorithms
45 篇 experimentation
42 篇 computer program...
39 篇 verification
36 篇 reliability
34 篇 object oriented ...
27 篇 java programming...
26 篇 functional progr...
25 篇 program synthesi...
24 篇 probabilistic pr...
22 篇 java
19 篇 domain-specific ...
19 篇 theory
19 篇 concurrency
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 washington ...
10 篇 univ calif berke...
9 篇 univ wisconsin m...
9 篇 harvard univ cam...
9 篇 univ penn philad...
9 篇 stanford univ st...
8 篇 yale univ new ha...
8 篇 cornell univ ith...
8 篇 univ chicago il ...
7 篇 mit cambridge ma...
7 篇 northeastern uni...
7 篇 microsoft resear...
6 篇 microsoft res re...
6 篇 microsoft res re...

作者

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

语言

852 篇 英文
78 篇 其他
1 篇 中文

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

共 931 条记录，以下是341-350 订阅

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

详细简洁

排序：

Distributed REScala: An Update Algorithm for Distributed Reactive programming 14

Distributed REScala: An Update Algorithm for Distributed Rea...

引用

2014 acm International conference on Object-Oriented-programming-Systems-languages-and-Applications (OOPSLA 14)

作者： Drechsler, Joscha Salvaneschi, Guido Mogk, Ragnar Mezini, Mira Tech Univ Darmstadt Darmstadt Germany Univ Lancaster Lancaster LA1 4YW England

ISBN: (纸本)9781450325851

Reactive programming improves the design of reactive applications by relocating the logic for managing dependencies between dependent values away from the application logic to the language implementation. Many distributed applications are reactive. Yet, existing change propagation algorithms are not suitable in a distributed setting. We propose Distributed REScala, a reactive language with a change propagation algorithm that works without centralized knowledge about the topology of the dependency structure among reactive values and avoids unnecessary propagation of changes, while retaining safety guarantees (glitch freedom). Distributed REScala enables distributed reactive programming, bringing the benefits of reactive programming to distributed applications. We demonstrate the enabled design improvements by a case study. We also empirically evaluate the performance of our algorithm in comparison to other algorithms in a simulated distributed setting.

关键词： Reactive programming Scala Distributed programming

来源：评论

学校读者我要写书评

暂无评论

Featherweight Swift: A Core Calculus for Swift's Type System 13

Featherweight Swift: A Core Calculus for Swift's Type System

引用

13th acm sigplan International conference on Software language Engineering (SLE) part of SPLASH conference

作者： Racordon, Dimitri Buchs, Didier Univ Geneva Dept Comp Sci Geneva Switzerland

ISBN: (纸本)9781450381765

Swift is a modern general-purpose programming language, designed to be a replacement for C-based languages. Although primarily directed at development of applications for Apple's operating systems, Swift's adoption has been growing steadily in other domains, ranging from server-side services to machine learning. This success can be partly attributed to a rich type system that enables the design of safe, fast, and expressive programming interfaces. Unfortunately, this richness comes at the cost of complexity, setting a high entry barrier to exploit Swift's full potential. Furthermore, existing documentation typically only relies on examples, leaving new users with little help to build a deeper understanding of the underlying rules and mechanisms. This paper aims to tackle this issue by laying out the foundations for a formal framework to reason about Swift's type system. We introduce Featherweight Swift, a minimal language stripped of all features not essential to describe its typing rules. Featherweight Swift features classes and protocol inheritance, supports retroactive modeling, and emulates Swift's overriding mechanisms. Yet its formalization fits on a few pages. We present Featherweight Swift's syntax and semantics. We then elaborate on the usability of our framework to reason about Swift's features, future extensions, and implementation by discussing a bug in Swift's compiler, discovered throughout the design of our calculus.

关键词： protocol oriented programming language semantics language calculus type systems swift

来源：评论

学校读者我要写书评

暂无评论

Can programming be liberated from the two-level style?: Multi-level programming with DeepJava 07

Can programming be liberated from the two-level style?: Mult...

引用

22nd International conference on Object-Oriented programming, Systems, languages and Applications

作者： Kuehne, Thomas Schreiber, Daniel Tech Univ Darmstadt Darmstadt Germany

ISBN: (纸本)9781595937865

Since the introduction of object-oriented programming few programming languages have attempted to provide programmers with more than objects and classes, i.e., more than two levels. Those that did, almost exclusively aimed at describing language properties - i. e., their metaclasses exert linguistic control on language concepts and mechanisms often in order to make the language extensible. In terms of supporting logical domain classification levels, however, they are still limited to two levels. In this paper we conservatively extend the object-oriented programming paradigm to feature an unbounded number of domain classification levels. We can therefore avoid the introduction of accidental complexity into programs caused by accommodating multiple domain levels within only two programming levels. We present a corresponding language design featuring "deep instantiation" and demonstrate its features with a running example. Finally, we outline the implementation of our compiler prototype and discuss the potentials of further developing our language design.

关键词： languages design domain metatypes ontological metamodeling deep characterization

来源：评论

学校读者我要写书评

暂无评论

FaCT: A DSL for Timing-Sensitive Computation 2019

FaCT: A DSL for Timing-Sensitive Computation

引用

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

作者： Cauligi, Sunjay Soeller, Gary Johannesmeyer, Brian Brown, Fraser Wahby, Riad S. Renner, John Gregoire, Benjamin Barthe, Gilles Jhala, Ranjit Stefan, Deian Univ Calif San Diego La Jolla CA 92093 USA INRIA Sophia Antipolis Biot France MPI Secur & Privacy Saarbrucken Germany IMDEA Software Inst Madrid Spain

ISBN: (纸本)9781450367127

Real-world cryptographic code is often written in a subset of C intended to execute in constant-time, thereby avoiding timing side channel vulnerabilities. This C subset eschews structured programming as we know it: if-statements, looping constructs, and procedural abstractions can leak timing information when handling sensitive data. The resulting obfuscation has led to subtle bugs, even in widely-used high-profile libraries like OpenSSL. To address the challenge of writing constant-time cryptographic code, we present FaCT, a crypto DSL that provides high-level but safe language constructs. The FaCT compiler uses a secrecy type system to automatically transform potentially timing-sensitive high-level code into low-level, constant-time LLVM bitcode. We develop the language and type system, formalize the constant-time transformation, and present an empirical evaluation that uses FaCT to implement core crypto routines from several open-source projects including OpenSSL, libsodium, and curve25519-donna. Our evaluation shows that FaCT's design makes it possible to write readable, high-level cryptographic code, with efficient, constant-time behavior.

关键词： domain-specific language program transformation cryptography

来源：评论

学校读者我要写书评

暂无评论

EventScript: An Event-Processing language Based on Regular Expressions with Actions 08

EventScript: An Event-Processing Language Based on Regular E...

引用

conference on languages, Compilers and Tools for Embedded Systems

作者： Cohen, Norman H. Kalleberg, Karl Trygve IBM Thomas J Watson Res Ctr Hawthorne NY USA

ISBN: (纸本)9781605581040

EventScript is a simple but powerful language for programming reactive processes. A stream of incoming events is matched against a regular expression. Actions embedded within the regular expression are executed in response to the matching of patterns of events. These actions include assigning computed values to variables and emitting output events. The definition of EventScript presented a number of novel and interesting language-design choices. EventScript has an efficient implementation, and has been used in a development environment for complex event-based applications. We have used EventScript to program both small examples and large industrial applications. Readers of EventScript programs find them easy to understand, and are comfortable with the familiar model of matching regular expressions.

关键词： event processing regular expressions reactive programs sensors actuators

来源：评论

学校读者我要写书评

暂无评论

The Atomos ∑ transactional programming language 06

The Atomos ∑ transactional programming language

引用

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

作者： Carlstrom, Brian D. McDonald, Austen Chafi, Hassan Chung, Jaewoong Minh, Chi Cao Kozyrakis, Christos Olukotun, Kunle Computer Systems Laboratory Stanford University United States

ISBN: (纸本)1595933743

Atomos is the first programming language with implicit transactions, strong atomicity, and a scalable multiprocessor implementation. Atomos is derived from Java, but replaces its synchronization and conditional waiting constructs with simpler transactional *** Atomos watch statement allows programmers to specify fine-grained watch sets used with the Atomos retry conditional waiting statement for efficient transactional conflict-driven wakeup even in transactional memory systems with a limited number of transactional contexts. Atomos supports open-nested transactions, which are necessary for building both scalable application programs and virtual machine *** implementation of the Atomos scheduler demonstrates the use of open nesting within the virtual machine and introduces the concept of transactional memory violation handlers that allow programs to recover from data dependency violations without rolling *** programming examples are given to demonstrate the usefulness of transactional programming primitives. Atomos and Java are compared through the use of several benchmarks. The results demonstrate both the improvements in parallel programming ease and parallel program performance provided by Atomos. Copyright © 2006 acm.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

GUM: a portable parallel implementation of Haskell

GUM: a portable parallel implementation of Haskell

引用

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

作者： Trinder, P.W. Hammond, K. Mattson Jr., J.S. Partridge, A.S. Jones, S.L.Peyton Glasgow Univ Glasgow United Kingdom

GUM is a portable, parallel implementation of the Haskell functional language. Despite sustained research interest in parallel functional programming, GUM is one of the first such systems to be made publicly available. GUM is message-based, and portability is facilitated by using the PVM communications harness that is available on many multi-processors. As a result, GUM is available for both shared-memory (Sun SPARCserver multiprocessors) and distributed-memory (networks of workstations) architectures. The high message-latency of distributed machines is ameliorated by sending messages asynchronously, and by sending large packets of related data in each message. Initial performance figures demonstrate absolute speedups relative to the best sequential compiler technology. To improve the performance of a parallel Haskell program GUM provides tools for monitoring and visualising the behaviour of threads and of processors during execution.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Supporting Speculative Parallelization in the Presence of Dynamic Data Structures 10

Supporting Speculative Parallelization in the Presence of Dy...

引用

acm sigplan conference on programming language design and implementation

作者： Tian, Chen Feng, Min Gupta, Rajiv Univ Calif Riverside CSE Dept Riverside CA 92521 USA

ISBN: (纸本)9781450300193

The availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization of sequential programs. Isolation of speculative state from non-speculative state forms the basis of such speculative techniques as this separation enables recovery from misspeculations. In our prior work on CorD [35, 36] we showed that for array and scalar variable based programs copying of data between speculative and non-speculative memory can be highly optimized to support state separation that yields significant speedups on multicore machines available today. However, we observe that in context of heap-intensive programs that operate on linked dynamic data structures, state separation based speculative parallelization poses many challenges. The copying of data structures from non-speculative to speculative state (copy-in operation) can be very expensive due to the large sizes of dynamic data structures. The copying of updated data structures from speculative state to non-speculative state (copy-out operation) is made complex due to the changes in the shape and size of the dynamic data structure made by the speculative computation. In addition, we must contend with the need to translate pointers internal to dynamic data structures between their non-speculative and speculative memory addresses. In this paper we develop an augmented design for the representation of dynamic data structures such that all of the above operations can be performed efficiently. Our experiments demonstrate significant speedups on a real machine for a set of programs that make extensive use of heap based dynamic data structures.

关键词： Performance languages design Experimentation Speculative Parallelization Multicore Processors

来源：评论

学校读者我要写书评

暂无评论

Practical dependence testing 91

Practical dependence testing

引用

1991 acm sigplan 1991 conference on programming language design and implementation, PLDI 1991

作者： Goff, Gina Kennedy, Ken Tseng, Chau-Wen Department of Computer Science Rice University HoustonTX77251-1892 United States

ISBN: (纸本)0897914287

Precise and efficient dependence tests are essential to the effectiveness of a parallelizing compiler. This paper proposes a dependence testing scheme based on classifying pairs of subscripted variable references. Exact yet fast dependence tests are presented for certain classes of array references, as well as empirical results showing that these references dominate scientific Fortran codes. These dependence tests are being implemented at Rice University in both PFC, a parallelizing compiler, and ParaScope, a parallel programming environment. © 1991 acm.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共94页 << < 31 32 33 34 35 36 37 38 39 40 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：