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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2 篇 学位论文
2 篇 会议

馆藏范围

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

日期分布

学科分类号

2 篇 工学
- 2 篇 软件工程
- 1 篇 计算机科学与技术...

主题

4 篇 concurrency debu...
2 篇 static happens-b...
2 篇 data races
2 篇 deadlocks
1 篇 programming lang...
1 篇 record and repla...
1 篇 scalability
1 篇 incremental poin...
1 篇 software enginee...
1 篇 differential poi...
1 篇 stateless model ...
1 篇 thesis
1 篇 parallel differe...
1 篇 multi-threaded p...
1 篇 parallel increme...
1 篇 software verific...
1 篇 graph processing
1 篇 real time

机构

2 篇 texas a&m univer...
1 篇 texas a&m univ p...
1 篇 huazhong univ sc...

作者

2 篇 liu bozhen
1 篇 wang qinggang
1 篇 zheng long
1 篇 huang jeff
1 篇 liao xiaofei
1 篇 jin hai
1 篇 huang shiyou
1 篇 zhao jieshan

语言

4 篇 英文

检索条件"主题词=concurrency debugging"

共 4 条记录，以下是1-10 订阅

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

详细简洁

排序：

D4: Fast concurrency debugging with Parallel Differential Analysis 2018

D4: Fast Concurrency Debugging with Parallel Differential An...

引用

39th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

作者： Liu, Bozhen Huang, Jeff Texas A&M Univ Parasol Lab College Stn TX 77843 USA

ISBN: (纸本)9781450356985

We present D4, a fast concurrency analysis framework that detects concurrency bugs (e.g., data races and deadlocks) interactively in the programming phase. As developers add, modify, and remove statements, the code changes are sent to D4 to detect concurrency bugs in real time, which in turn provides immediate feedback to the developer of the new bugs. The cornerstone of D4 includes a novel system design and two novel parallel differential algorithms that embrace both change and parallelization for fundamental static analyses of concurrent programs. Both algorithms react to program changes by memoizing the analysis results and only recomputing the impact of a change in parallel. Our evaluation on an extensive collection of large real-world applications shows that D4 efficiently pinpoints concurrency bugs within 100ms on average after a code change, several orders of magnitude faster than both the exhaustive analysis and the state-of-the-art incremental techniques.

关键词： concurrency debugging Real Time Data Races Deadlocks Parallel Differential Analysis Differential Pointer Analysis Static Happens-Before Analysis

来源：评论

学校读者我要写书评

暂无评论

Scalable concurrency debugging with Distributed Graph Processing 2018

Scalable Concurrency Debugging with Distributed Graph Proces...

引用

16th International Symposium on Code Generation and Optimization (CGO)

作者： Zheng, Long Liao, Xiaofei Jin, Hai Zhao, Jieshan Wang, Qinggang Huazhong Univ Sci & Technol Serv Comp Technol & Syst Lab Big Data Technol & Syst Lab Cluster & Grid Comp Lab Wuhan 430074 Hubei Peoples R China

ISBN: (纸本)9781450356176

Existing constraint-solving-based technique enables an efficient and high-coverage concurrency debugging. Yet, there remains a significant gap between the state of the art and the state of the programming practices for scaling to handle long-running execution of programs. In this paper, we revisit the scalability problem of state-of-the-art constraint-solving-based technique. Our key insight is that concurrency debugging for many real-world concurrency bugs can be turned into a graph traversal problem. We therefore present GraphDebugger, a novel debugging framework to enable the scalable concurrency analysis on program graphs via a tailored graph-parallel analysis in a distributed environment. It is verified that GraphDebugger is more capable than CLAP in reproducing the real-world bugs that involve a complex concurrency analysis. Our extensive evaluation on 7 real-world programs shows that, GraphDebugger (deployed on an 8-node EC2 like cluster) is significantly efficient to reproduce concurrency bugs within 1 similar to 8 minutes while CLAP does so with 1 similar to 30 hours, or even fails to return the solutions.

关键词： concurrency debugging graph processing scalability multi-threaded programs

来源：评论

学校读者我要写书评

暂无评论

Fast and Effective Approaches for Verifying and debugging Concurrent Programs

Fast and Effective Approaches for Verifying and Debugging Co...

引用

作者： Huang, Shiyou Texas A&M University

学位级别：Ph.D., Doctor of Philosophy

Concurrent programs are ubiquitous, from the high-end servers to personal machines, due to the fact of multi-core hardware. Unfortunately, it is difficult to write correct concurrent programs. Stateless Model Checking (SMT) and Deterministic Replay are powerful techniques for systematic testing and reproducing concurrent failures. However, it is challenging to develop efficient and practical SMT and bug reproduction systems due to the exponentially large thread interleaving space which can be exacerbated when it comes to relaxed memory models. In this work, I introduce my research efforts to address the challenges in developing fast and effective SMT and deterministic replay techniques. I present a new model checking technique based on maximal causality reduction for verifying concurrent programs under different memory models. I also optimize the model checker by using static dependency analysis to reduce the constraints size and introducing a new equivalence for checking the seed interleavings, which I call switch equivalence to further reduce the redundant *** debug heisenbugs more efficiently, I presents a new concurrency failure reproduction technique, H3, that enables reproducing concurrency bugs in production runs on commercial off-the-shelf hardware for the first time. H3 integrates the hardware control flow tracing capability provided in recent Intel processors, Processor Tracing (PT), with symbolic constraint analysis. Compared to a state-of-the-art solution, CLAP, this integration allows H3 to reproduce failures with much lower runtime overhead and much more compact control-flow trace. Moreover, it allows us to develop a highly effective core-based constraint reduction technique that reduces the complexity of the generated symbolic constraints from exponential in the trace size to exponential in the number of cores.

关键词： Software verification concurrency debugging Programming language Record and Replay Software engineering Stateless Model Checking

来源：评论

学校读者我要写书评

暂无评论

An Instantaneous Framework For concurrency Bug Detection

An Instantaneous Framework For Concurrency Bug Detection

引用

作者： Liu, Bozhen Texas A&M University

concurrency bug detection is important to guarantee the correct behavior of multithread programs. However, existing static techniques are expensive with false positives, and dynamic analyses cannot expose all potential bugs. This thesis presents an ultra-efficient concurrency analysis framework, D4, that detects concurrency bugs (e.g., data races and deadlocks) “instantly” in the programming phase. As developers add, modify, and remove statements, the changes are sent to D4 to detect concurrency bugs on-the-fly, which in turn provides immediate feedback to the developer of the new bugs. D4 includes a novel system design and two novel parallel incremental algorithms that embrace both change and parallelization for fundamental static analyses of concurrent programs. Both algorithms react to program changes by memoizing the analysis results and only recomputing the impact of a change in parallel without any redundant computation. Our evaluation on an extensive collection of large real-world applications shows that D4 efficiently pinpoints concurrency bugs within 10ms on average after a code change, several orders of magnitude faster than both the exhaustive analysis and the state-of-the-art incremental techniques.

关键词： concurrency debugging Data Races Deadlocks Parallel Incremental Analysis Incremental Pointer Analysis Static Happens-Before Analysis Thesis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共1页 << < 1 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：