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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Isolation for Nested Task Parallelism 13

Isolation for Nested Task Parallelism

引用

2013 acm sigplan International conference on Object Oriented programming Systems languages

作者： Zhao, Jisheng Lublinerman, Roberto Budimlic, Zoran Chaudhuri, Swarat Sarkar, Vivek Rice Univ Houston TX 77251 USA Google Inc Mountain View CA USA

ISBN: (纸本)9781450323741

Isolation-the property that a task can access shared data without interference from other tasks-is one of the most basic concerns in parallel programming. While there is a large body of past work on isolated task-parallelism, the integration of isolation, task-parallelism, and nesting of tasks has been a difficult and unresolved challenge. In this paper, we present a programming and execution model called Otello where isolation is extended to arbitrarily nested parallel tasks with irregular accesses to heap data. At the same time, no additional burden is imposed on the programmer, who only exposes parallelism by creating and synchronizing parallel tasks, leaving the job of ensuring isolation to the underlying compiler and runtime system. Otello extends our past work on Aida execution model and the delegated isolation mechanism [22] to the setting of nested parallelism. The basic runtime construct in Aida and Otello is an assembly: a task equipped with a region in the shared heap that it owns. When an assembly A conflicts with an assembly B, A transfers-or delegates-its code and owned region to a carefully selected assembly C in a way that will ensure isolation with B, leaving the responsibility of re-executing task A to C. The choice of C depends on the nesting relationship between A and B. We have implemented Otello on top of the Habanero Java (HJ) parallel programming language [8], and used this implementation to evaluate Otello on collections of nested task-parallel benchmarks and non-nested transactional benchmarks from past work. On the nested task-parallel bench-marks, Otello achieves scalability comparable to HJ programs without built-in isolation, and the relative overhead of Otello is lower than that of many published data-race detection algorithms that detect the isolation violations (but do not enforce isolation). For the transactional benchmarks, Otello incurs lower overhead than a state-of-the-art software transactional memory system (Deuce STM).

关键词： languages design Isolation programming abstractions Irregular parallelism Contention

来源：评论

学校读者我要写书评

暂无评论

Component-based DSL development

引用

2nd International conference on Generative programming and Component Engineering

作者： Cleenewerck, T Free Univ Brussels Programming Technol Lab B-1050 Brussels Belgium

ISBN: (纸本)3540201025

Domain specific languages (DSLs) have proven to be a very adequate mechanism to encapsulate and hide the complex implementation details of component-based software development. Since evolution lies at the heart of any software system the DSLs that were built around them must evolve as well. In this paper we identify important issues that cause a DSL implementation to be very rigid in which all phases are tightly coupled and highly dependent upon one another. To increase the poor evolvability of current day DSL development environments a new development environment Keyword based programming (KBP) is proposed where DSLs are built by using a language specification to compose and glue loosely coupled and independent language components (called keywords).

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

DSL implementation using staging and monads 99

DSL implementation using staging and monads

引用

2nd conference on Domain-Specific languages, DSL 1999

作者： Sheard, Tim Benaissa, Zine-El-Abidine Pasalic, Emir Pacific Software Research Center Oregon Graduate Institute P.O. Box 91000 PortlandON97291-1000 United States

ISBN: (纸本)1581132557

The impact of Domain Specific languages (DSLs) on software design is considerable. They allow programs to be more concise than equivalent programs written in a high-level programming languages. They relieve programmers from making decisions about data-structure and algorithm design, and thus allows solutions to be constructed quickly. Because DSL's are at a higher level of abstraction they are easier to maintain and reason about than equivalent programs written in a high-level language, and perhaps most importantly they can be written by domain experts rather than programmers. The problem is that DSL implementation is costly and prone to errors, and that high level approaches to DSL implementation often produce inefficient systems. By using two new programming language mechanisms, program staging and monadic abstraction, we can lower the cost of DSL implementations by allowing reuse at many levels. These mechanisms provide the expressive power that allows the construction of many compiler components as reusable libraries, provide a direct link between the semantics and the low-level implementation, and provide the structure necessary to reason about the implementation.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Randomized implementation of multiple functional arrays

Randomized implementation of multiple functional arrays

引用

Proceedings of the 1994 acm conference on LISP and Functional programming

作者： Chuang, Tyng-Ruey Chalmers Univ of Technology Goteborg Sweden

ISBN: (纸本)0897916433

The array update problem in the implementation of a purely functional language is the following: once an array is updated, both the original array and the newly updated one must be preserved to maintain referential transparency. Previous approaches have mainly based on the detection or enforcement of single-threaded accesses to an aggregate, by means of compiler-time analyses or language restrictions. These approaches cannot deal with aggregates which are updated in a multi-threaded manner. Baker's shallow binding scheme can be used to implement multi-threaded functional arrays. His scheme, however, can be very expensive if there are repeated alternations between long binding paths. We design a scheme that fragments binding paths randomly. The randomization scheme is on-line, simple to implement, and its expected performance comparable to that of the optimal off-line solutions. All this is achieved without using compiler-time analyses, and without restricting the languages. The expected performance of the randomization scheme is analyzed in details, and some preliminary results are shown. Applications of the randomization technique to other functional aggregates, as well as its implications, are briefly outlined.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Communicating reactive processes 93

Communicating reactive processes

引用

20th Annual acm sigplan-SIGACT Symposium on Principles of programming languages, POPL'93

作者： Berry, G. Ramesh, S. Shyamasundar, R.K. Ecole des Mines Sophia-Antipolis France

ISBN: (纸本)0897915607

We present a new programming paradigm called Communicating Reactive Processes or CRP that unifies the capabilities of asynchronous and synchronous concurrent programming languages. Asynchronous languages such as CSP, OCCAM, or ADA are well-suited for distributed algorithms;their processes are loosely coupled and communication takes time. The ESTEREL synchronous language is dedicated to reactive systems;its processes are tightly coupled and deterministic, communication being realized by instantaneous broadcasting. Complex applications such as process or robot control require to couple both forms of concurrency, which is the object of CRP. A CRP program consists of independent locally reactive ESTEREL nodes that communicate with each other by CSP rendezvous. CRP faithfully extends both ESTEREL and CSP and adds new possibilities such as precise local watchdogs on rendezvous. We present the design of CRP, its semantics, a translation into classical process calculi for program verification, an application example, and implementation issues.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Using ARM TrustZone to build a Trusted language Runtime for mobile applications 14

Using ARM TrustZone to build a Trusted Language Runtime for ...

引用

19th International conference on Architectural Support for programming languages and Operating Systems, ASPLOS 2014

作者： Santos, Nuno Raj, Himanshu Saroiu, Stefan Wolman, Alec INESC-ID Instituto Superior Técnico University of Lisbon Portugal Microsoft Research Portugal

ISBN: (纸本)9781450323055

paper presents the design, implementation, and evaluation of the Trusted language Runtime (TLR), a system that protects the confidentiality and integrity of .NET mobile applications from OS security breaches. TLR enables separating an application's security-sensitive logic from the rest of the application, and isolates it from the OS and other apps. TLR provides runtime support for the secure component based on a .NET implementation for embedded devices. TLR reduces the TCB of an open source .NET implementation by a factor of 78 with a tolerable performance cost. The main benefit of the TLR is to bring the developer benefits of managed code to trusted computing. With the TLR, developers can build their trusted components with the productivity benefits of modern high-level languages, such as strong typing and garbage collection. Copyright is held by the owner/author(s).

关键词： Trusted computing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Secure Distributed programming with Value-Dependent Types 11

Secure Distributed Programming with Value-Dependent Types

引用

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

作者： Swamy, Nikhil Chen, Juan Fournet, Cedric Strub, Pierre-Yves Bhargavan, Karthikeyan Yang, Jean Microsoft Res Redmond WA 98052 USA

ISBN: (纸本)9781450308656

Distributed applications are difficult to program reliably and securely. Dependently typed functional languages promise to prevent broad classes of errors and vulnerabilities, and to enable program verification to proceed side-by-side with development. However, as recursion, effects, and rich libraries are added, using types to reason about programs, specifications, and proofs becomes challenging. We present F-star, a full-fledged design and implementation of a new dependently typed language for secure distributed programming. Unlike prior languages, F-star provides arbitrary recursion while maintaining a logically consistent core;it enables modular reasoning about state and other effects using affine types;and it supports proofs of refinement properties using a mixture of cryptographic evidence and logical proof terms. The key mechanism is a new kind system that tracks several sub-languages within F-star and controls their interaction. F-star subsumes two previous languages, F7 and Fine. We prove type soundness (with proofs mechanized in Coq) and logical consistency for F-star. We have implemented a compiler that translates F-star to NET bytecode, based on a prototype for Fine. F-star provides access to libraries for concurrency, networking, cryptography, and interoperability with C#, F#, and the other .NET languages. The compiler produces verifiable binaries with 60% code size overhead for proofs and types, as much as a 45x improvement over the Fine compiler, while still enabling efficient bytecode verification. To date, we have programmed and verified more than 20,000 lines of F-star including (1) new schemes for multi-party sessions;(2) a zero-knowledge privacy-preserving payment protocol;(3) a provenance-aware curated database;(4) a suite of 17 web-browser extensions verified for authorization properties;and (5) a cloud-hosted multi-tier web application with a verified reference monitor.

关键词： Security type systems refinement types

来源：评论

学校读者我要写书评

暂无评论

User-changeable visibility: Resolving unanticipated name clashes in traits 07

User-changeable visibility: Resolving unanticipated name cla...

引用

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

作者： Ducasse, Stephane Wuyts, Roel Bergel, Alexandre INRIA Futurs LISTIC Univ Savoie Language & Software evolut Le Bourget Du Lac France IMEC Louvain Belgium Univ Libre Bruxelles Brussels Belgium LERO Trinity Coll Dublin Ireland

ISBN: (纸本)9781595937865

A trait is a unit of behaviour that can be composed with other traits and used by classes. Traits offer an alternative to multiple inheritance. Conflict resolution of traits, while flexible, does not completely handle accidental method name conflicts: if a trait with method m is composed with another trait defining a different method m then resolving the conflict may prove delicate or infeasible in cases where both versions of m are still needed. In this paper we present freezeable traits, which provide an expressive composition mechanism to support unanticipated method composition conflicts. Our solution introduces private trait methods and lets the class composer change method visibility at composition time (from public to private and vice versa). Moreover two class composers may use different composition policies for the same trait, something which is not possible in mainstream languages. This approach respects the two main design principles of traits: the class composer is empowered and traits can be flattened away. We present an implementation of freezable traits in Smalltalk. As a side-effect of this implementation we introduced private (early-bound and invisible) methods to Smalltalk by distinguishing object-sends from self-sends. Our implementation uses compile-time bytecode manipulation and, as such, introduces no run-time penalties.

关键词： languages dynamic typing traits encapsulation information hiding composition

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共92页 << < 63 64 65 66 67 68 69 70 71 72 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：