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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

236 篇 期刊文献
147 篇 会议
11 篇 学位论文
2 册 图书

馆藏范围

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

日期分布

学科分类号

352 篇 工学
- 303 篇 计算机科学与技术...
- 170 篇 软件工程
- 90 篇 电气工程
- 14 篇 控制科学与工程
- 13 篇 信息与通信工程
- 4 篇 电子科学与技术（可...
- 3 篇 材料科学与工程（可...
- 2 篇 机械工程
- 2 篇 仪器科学与技术
- 1 篇 核科学与技术
- 1 篇 生物医学工程（可授...
26 篇 理学
- 21 篇 数学
- 5 篇 物理学
- 1 篇 化学
13 篇 管理学
- 12 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...
11 篇 教育学
- 11 篇 教育学
3 篇 医学
- 2 篇 临床医学
- 1 篇 基础医学(可授医学...

主题

396 篇 concurrent progr...
26 篇 parallel program...
23 篇 synchronization
19 篇 transactional me...
16 篇 distributed prog...
14 篇 parallel process...
11 篇 threads
11 篇 verification
10 篇 java
10 篇 semantics
9 篇 message passing
9 篇 petri nets
9 篇 functional progr...
9 篇 programming lang...
8 篇 reliability
8 篇 software transac...
7 篇 performance
7 篇 actors
7 篇 mutual exclusion
7 篇 distributed syst...

机构

6 篇 purdue univ dept...
5 篇 digital equipmen...
5 篇 univ calif davis...
4 篇 univ calif santa...
3 篇 microsoft corp r...
3 篇 george mason uni...
3 篇 univ cambridge c...
3 篇 ecole polytech f...
3 篇 tula state univ ...
3 篇 kth royal inst t...
2 篇 swiss fed inst t...
2 篇 salzburg univ de...
2 篇 georgia inst tec...
2 篇 univ glasgow dep...
2 篇 univ fed pelotas...
2 篇 hebei univ sci &...
2 篇 virtuslab smolen...
2 篇 univ lisbon ines...
2 篇 univ porto fac s...
2 篇 inst super tecn ...

作者

8 篇 lamport l
7 篇 olsson ra
5 篇 gehani nh
5 篇 haller philipp
5 篇 jagannathan sure...
4 篇 ricci alessandro
4 篇 nanz sebastian
4 篇 silva josep
4 篇 ziarek lukasz
4 篇 meyer bertrand
4 篇 tamarit salvador
4 篇 hansen pb
3 篇 oliver j.
3 篇 abadi m
3 篇 silva j.
3 篇 ivutin alexey n.
3 篇 llorens marisa
3 篇 raynal michel
3 篇 morandi benjamin
3 篇 troshina anna g.

语言

363 篇 英文
30 篇 其他
2 篇 中文
1 篇 西班牙文

检索条件"主题词=Concurrent Programming"

共 396 条记录，以下是271-280 订阅

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

详细简洁

排序：

Prototyping a Concurrency Model

Prototyping a Concurrency Model

引用

13th International Conference on Application of Concurrency to System Design (ACSD)

作者： Morandi, Benjamin Schill, Mischael Nanz, Sebastian Meyer, Bertrand Swiss Fed Inst Technol Chair Software Engn Zurich Switzerland

ISBN: (纸本)9780769550350

Many novel programming models for concurrency have been proposed in the wake of the multicore computing paradigm shift. They aim to raise the level of abstraction for expressing concurrency and synchronization in a program, and hence to help developers avoid programming errors. Because of this goal, the semantics of the models themselves becomes ever more complex, increasing the risk of design flaws. We propose a methodology for prototyping concurrency models using executable formal specifications. The prototype can be used to test and correct the model at an early stage. Once the development is completed, the executable formal specification serves as an unambiguous reference. We apply this methodology to SCOOP, an object-oriented concurrency model. Using this approach, we were able to uncover and fix three major flaws in the model.

关键词： formal specification prototyping testing concurrent programming SCOOP Maude

来源：评论

学校读者我要写书评

暂无评论

On Using Ada to Solve Problems in Computational Economics and Related Disciplines with concurrent, Multiagent Algorithms 09

On Using Ada to Solve Problems in Computational Economics an...

引用

ACM International Conference on Ada and Related Technologies

作者： Barkstrom, Bruce R. self Asheville NC USA

ISBN: (纸本)9781605584751

Multiagent algorithms are widely used in computational economics and other social sciences to solve theoretical and practical problems. Because such algorithms are inherently concurrent and multithreaded, Ada's constructs for handling communications between concurrent processes and avoiding interference between them make the language very well suited to solving these problems, particularly given developments in multi-core CPU chip-making. This paper provides a concrete example of how Ada assists in solving problems in computational economics and related disciplines that work with multiagent systems. Solving a simple problem illustrates visualizing the agents as Ada tasks, using UML use cases and synchronization diagrams to design the communications patterns between agents, and applying protected objects and functions to avoid computational indeterminacy.

关键词： Multiagent Systems Computational Economics Computational and Mathematical Organization Theory concurrent programming Multithreaded programming

来源：评论

学校读者我要写书评

暂无评论

STRAB: State Recovery using Reverse Execution at IR Level for concurrent Programs 21

STRAB: State Recovery using Reverse Execution at IR Level fo...

引用

36th Annual ACM Symposium on Applied Computing (SAC)

作者： Hoshino, Shinji Arahori, Yoshitaka Gondow, Katsuhiko Tokyo Inst Technol Tokyo Japan

ISBN: (纸本)9781450381048

Debugging failures of deployed concurrent software is important for quality assurance. However, such failures are difficult to debug because their behavior is non-deterministic and limited information can be obtained with conventional means. Reverse debuggers such as REPT [10] assists with debugging by recovering data values before the failure. This is achieved by using a hardware-tracer to log control-flowinformation, then using the information and a conventional coredump to recover data values via reverse-execution at machine-level. REPT's algorithm for data value recovery is reliable and fast. But the implementation cost is high because of its dependence on architecture. Applying REPT to more abstract IR (Intermediate Representation) level instructions in an attempt to counter this yielded limited results with low accuracy compared to the original x86_64 implementation. In this paper, we present STRAB (State Recovery at Abstract-level), a collection of our proposed methods to solve these problems. STRABworks in two phases. First, the data values in the core-dump are lifted from machine-level to IR-level using rich debug information and mid-recovery lifting. Second, REPT modified with our hybrid memory location resolving algorithm to solve problems that occur only at IR-level is used to recover data values with higher accuracy than REPT. Experimental results on a variety of real-world concurrent programs show that STRAB has significantly higher accuracy compared to REPT at IR-level (+40% on average) with only minor slowdowns (x2.7 on average), while also achieving architecture-independence.

关键词： reverse debugging concurrent programming state recovery data value inference intermediate representation

来源：评论

学校读者我要写书评

暂无评论

A Graph Transformation System formalism for correctness of Transactional Memory algorithms 21

A Graph Transformation System formalism for correctness of T...

引用

25th Brazilian Symposium on programming Languages (SBLP)

作者： Cardoso, Diogo J. Foss, Luciana Du Bois, Andre R. Univ Fed Pelotas Programa Posgrad Comp Pelotas RS Brazil

ISBN: (纸本)9781450390620

With the constant research and development of Transactional Memory (TM) systems, various algorithms have been proposed, and their correctness is always an important aspect to take into account. When analyzing TM algorithms, one of the most commonly used correctness criterion is opacity, which infers that the algorithm only generates executions that observe consistent states of the shared memory. In this work we present a formal definition to demonstrate that a given TM algorithm only generates opaque histories using a Graph Transformation System (GTS). We achieve that by introducing a methodology of translating an algorithm into production rules that manipulate the state of a graph. With a set initial state of transactions, the result of this method consists of a state space that includes every possible order of execution of transactional operations that are automatically checked for opacity, therefore all possible histories the algorithm can generate are checked for the safety property. As a case study we demonstrate our approach using the algorithm CaPR+.

关键词： Formal Semantics Graph Grammar Transactional Memory concurrent programming Model Checking

来源：评论

学校读者我要写书评

暂无评论

Transactions on Mergeable Objects 13th

Transactions on Mergeable Objects

引用

13th Asian Symposium on programming Languages and Systems (APLAS)

作者： Akkoorath, Deepthi Devaki Bieniusa, Annette Univ Kaiserslautern D-67663 Kaiserslautern Germany

ISBN: (纸本)9783319265292;9783319265285

Destructible updates on shared objects require careful handling of concurrent accesses in multi-threaded programs. Paradigms such as Transactional Memory support the programmer in correctly synchronizing access to mutable shared data by serializing the transactional reads and writes. But under high contention, serializable transactions incur frequent aborts and limit parallelism. This can lead to a severe performance degradation. In this paper, we propose mergeable transactions which provide a consistency semantics that allows for more scalability even under contention. Instead of aborting and re-executing, object versions from conflicting updates on shared objects are merged using data-type specific semantics. The evaluation of our prototype implementation in Haskell shows that mergeable transactions outperform serializable transactions even under low contention while providing a structured and type-safe interface.

关键词： concurrent programming Transactional memory Mergeable objects Relaxed consistency

来源：评论

学校读者我要写书评

暂无评论

Semantic Petri-Markov Nets for Automotive Algorithms Transformations 28

Semantic Petri-Markov Nets for Automotive Algorithms Transfo...

引用

28th International Conference on Radioelektronika (RADIOELEKTRONIKA)

作者： Ivutin, Alexey N. Troshina, Anna G. Tula State Univ Dept Comp Technol Tula Russia

ISBN: (纸本)9781538624852

The approach of automatic algorithms transformation into concurrent form is proposed. One is based on mathematical apparatus of stochastic Petri nets with additional semantic relations (semantic Petri-Markov nets). The authors propose the method of definition the independent blocks in the algorithm that can be executed in parallel based on the semantic and control relations between elements in the algorithm. The article describes the rules of the sequential algorithm transformation into strictly parallel implementation and implementation with taking into account the actual number of executive units. The proposed method allows making the algorithm transformation in automatic mode and could escape errors of half-automatic or manual transformation.

关键词： concurrent programming Petri nets semantic relations simulation paralleling technology semantic net equivalent transformation parallelization

来源：评论

学校读者我要写书评

暂无评论

Design Efficient Schemes of Applied Algorithms Parallelization Based on Semantic Petri-Markov Net 27

Design Efficient Schemes of Applied Algorithms Parallelizati...

引用

27th International Conference on Radioelektronika (RADIOELEKTRONIKA)

作者： Ivutin, Alexey N. Troshina, Anna G. Kotov, Vladislav V. Tula State Univ Dept Comp Technol Tula Russia Tula State Univ Dept Robot & Ind Mechanizat Tula Russia

The article discusses the possibility of the use of mathematical apparatus of semantic Petri-Markov nets for simulation and evaluation of parallel algorithms for computing the orthogonal transformation algorithms base... 详细信息

ISBN: (纸本)9781509045914

关键词： concurrent programming Petri-Markov nets semantic relations semi-Markov process simulation transition function paralleling technology semantic net orthogonal transformation DFT

来源：评论

学校读者我要写书评

暂无评论

Forkfuzz: Leveraging the Fork-Awareness in Coverage-Guided Fuzzing

Forkfuzz: Leveraging the Fork-Awareness in Coverage-Guided F...

引用

28th European Symposium on Research in Computer Security (ESORICS)

作者： Maugeri, Marcello Daniele, Cristian Bella, Giampaolo Univ Catania Catania Italy Radboud Univ Nijmegen Nijmegen Netherlands

ISBN: (纸本)9783031541285;9783031541292

Fuzzing is a widely adopted technique for automated vulnerability testing due to its effectiveness and applicability throughout the Software Development Life Cycle. Nevertheless, applying fuzzing "out of the box" to any system can prove to be a challenging endeavour. Consequently, the demand for target-specific solutions necessitates a substantial amount of manual intervention, which diverges from the automated nature typically associated with fuzzing. For example, prior research identified the lack of a solution for testing multi-process systems effectively. The problem is that coverage-guided fuzzers do not consider the possibility of having a system with more than one process. In this paper, we present Forkfuzz, a "fork-aware" fuzzer able to deal with multi-process systems. To the best of our knowledge, Forkfuzz is the first fork-aware fuzzer. It is built on top of Honggfuzz, one of the most popular and effective coverage-guided fuzzers, as reported by the Fuzzbench benchmark. To show its effectiveness, we tested our fuzzer over two classical programming problems: the Dining Philosophers Problem and a version of the Producer-Consumer Problem where the consumer (the child) process crashes for specific inputs. Furthermore, we evaluated Forkfuzz against a real and more complex scenario involving an HTTP server that handles multiple connections through multiple processes. The results of our evaluation demonstrate the effectiveness of Forkfuzz in identifying crashes and timeouts. Finally, we discuss possible improvements and challenges for the development and application of fork-aware fuzzing techniques.

关键词： fuzzing automated vulnerability testing multi-process system security testing concurrent programming

来源：评论

学校读者我要写书评

暂无评论

A Comparison of Lock-based and Lock-free Taskpool Implementations in Haskell

A Comparison of Lock-based and Lock-free Taskpool Implementa...

引用

International Conference on Computational Science (ICCS) on the Ascent of Computational Excellence

作者： Lesniak, Michael Univ Kassel Res Grp Programming Languages Methodol Kassel Germany

Today, synchronization of shared data structures in multithreaded software is mostly implemented using locks, which leads to difficult to understand and error-prone programs. Software Transactional Memory allows lock-free concurrent programming by handling the synchronization of shared variables implicitly. We show how to implement different instances of the widely-used taskpool pattern (global and private taskpools with and without task stealing) using both lock-based and lock-free synchronization mechanisms in the functional programming language Haskell. We examine their performance using two synthetic algorithms and LU decomposition and report our observations about parallel performance and the complexity of the implementation. Our results show that lock-free taskpools are not only on par with lock-based implementations concerning parallel performance but are also easier to comprehend and develop.

关键词： concurrent programming Taskpools Haskell

来源：评论

学校读者我要写书评

暂无评论

Context sensitive dynamic slicing of concurrent aspect-oriented programs 21

Context sensitive dynamic slicing of concurrent aspect-orien...

引用

21st Asia-Pacific Software Engineering Conference, APSEC 2014

作者： Singh, Jagannath Munjal, Dishant Mohapatra, Durga Prasad National Institute of Technology Rourkela India

ISBN: (纸本)9781479974252

This paper presents a context-sensitive dynamic slicing technique for concurrent AOPs having multiple threads. To effectively represent the concurrent AOP, we propose an intermediate graph called Multithreaded Aspect-Oriented Dependence Graph (MAODG). Based on this intermediate representation, we design a precise and accurate dynamic slicing algorithm for concurrent AOPs. This algorithm takes the MAODG of the concurrent AOP and a slicing criterion as input and computes the dynamic slice for the given concurrent AOP. © 2014 IEEE.

关键词： concurrent Aspect concurrent programming Context Sensitive slicing Dynamic Slicing Program Slicing Parallel programming program slicing slicing Debris aspect-oriented programming advanced oxidation processes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：