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

Detecting Bugs of concurrent programs With program Invariants

IEEE TRANSACTIONS ON RELIABILITY 2017年第2期66卷 425-439页

作者： Wang, Rong Ding, Zuohua Gui, Ning Liu, Yang Zhejiang Sci Tech Univ Sch Informat Sci Hangzhou 310018 Zhejiang Peoples R China Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore

Concurrency bug detection is a time-consuming activity in the debugging process for concurrent programs. Existing techniques mainly focus on detecting data race bugs with pattern analysis;however, the number of interleaving patterns could be huge, only the most suspicious write-read pattern is given, and an oracle is needed, which is not available in the operational phase. This paper proposes a program-invariant-based technique to detect a class of concurrent program bugs. By unit testing of the components of a concurrent program, we obtain a set of program invariants, which can be used as an oracle to obtain "bad" invariants when the program is online. By using the function call graph of the components and applying a reduction technique to the invariants, we find the candidates of suspicious functions and rank them. From the interactions among components, we analyze the causes to the concurrency bugs. Experimental results show that our proposed technique is effective in concurrency bug detection.

关键词： Bug detection concurrent program function call graph program invariants suspicious rate

来源：评论

学校读者我要写书评

暂无评论

A Novel Approach to Efficiently Verify Sequential Consistency in concurrent programs

引用

COMPUTERS 2025年第3期14卷 110-110页

作者： Abdulwahhab, Mohammed H. Abdulla, Parosh Aziz Jacksi, Karwan Univ Zakho Dept Comp Sci Zakho 42002 Iraq Uppsala Univ Dept Informat Technol S-75237 Uppsala Sweden Univ Zakho Res Ctr Semant Web Lab Duhok 42002 Iraq

Verifying sequential consistency (SC) in concurrent programs is computationally challenging due to the exponential growth of possible interleavings among read and write operations. Many of these interleavings produce identical outcomes, rendering exhaustive verification approaches inefficient and computationally expensive, especially as thread counts increase. To mitigate this challenge, this study introduces a novel approach that efficiently verifies SC by identifying a minimal subset of valid event orderings. The proposed method iteratively focuses on ordering write events and evaluates their compatibility with SC conditions, including program order, read-from (rf) relations, and SC semantics, thereby significantly reducing redundant computations. Corresponding read events are subsequently integrated according to program order once the validity of write events has been confirmed, enabling rapid identification of violations to SC criteria. Three algorithmic variants of this approach were developed and empirically evaluated. The final variant exhibited superior performance, achieving substantial improvements in execution time-ranging from 31.919% to 99.992%-compared to the optimal existing practical SC verification algorithms. Additionally, comparative experiments demonstrated that the proposed approach consistently outperforms other state-of-the-art methods in both efficiency and scalability.

关键词： sequential consistency memory model concurrent program verification

来源：评论

学校读者我要写书评

暂无评论

Matching Logic for concurrent programs Based on Rely/Guarantee and Abstract Patterns

引用

INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING 2023年第2期33卷 257-288页

作者： Wang, ShangBei Dong, WeiYu Nanjing Univ Aeronaut & Astronaut Nanjing Peoples R China Informat Engn Univ Dept Zhengzhou Zhengzhou Peoples R China State Key Lab Math Engn & Adv Comp Zhengzhou Peoples R China

This paper combines rely/guarantee, abstract patterns and matching logic to reason about concurrent programs in a modular and compositional manner. According to the separation property, the state can be divided into two disjoint parts, the local state and the shared state. We use matching logic to deal with the local state, and use rely/guarantee and abstract patterns to deal with the shared state. The power of rely/guarantee is to describe interference between concurrent programs. The advantage of abstract patterns is supporting fictional separation, which indicates that we logically consider abstract patterns to represent disjoint elements, although these elements are not disjoint under a certain implementation. By combining the advantages of rely/guarantee, abstract patterns and matching logic, our approach realize that clients of the module can be verified completely according to the specification of the module, regardless of the implementation of the module. In addition, we use several examples to illustrate our approach, define our logic judgments, and prove the soundness of our logic.

关键词： Matching logic rely guarantee abstract pattern concurrent program

来源：评论

学校读者我要写书评

暂无评论

PIChecker: A POR and Interpolation based Verifier for concurrent programs (Competition Contribution) 29th

PIChecker: A POR and Interpolation based Verifier for Concur...

引用

29th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)

作者： Su, Jie Yang, Zuchao Xing, Hengrui Yang, Jiyu Tian, Cong Duan, Zhenhua Xidian Univ ICTT Xian 710071 Peoples R China Xidian Univ ISN Lab Xian 710071 Peoples R China

ISBN: (纸本)9783031308192;9783031308208

PIChecker is a tool for verifying reachability properties of concurrent C programs. It moderates the trace-space explosion problem, aggravated by thread alternation, through utilizing the PC-DPOR and C-Intp techniques. The PC-DPOR technique constructs a constrained dependency graph to refine dependencies between transitions. With this basis, the inherent imprecision of the dependence over-approximation can be overcome. Thereby, many redundant equivalent traces are prevented from being explored. On the other hand, the C-Intp technique performs conditional interpolation to confine the reachable regions of states, so that infeasible conditional branches which occur more frequently in concurrent verification tasks could be pruned automatically. We have implemented the above techniques on top of the open-source program analysis framework CPAchecker

关键词： Partial-Order Reduction Interpolation concurrent program Model Checking

来源：评论

学校读者我要写书评

暂无评论

Information Retrieval-based Fault Localization for concurrent programs 38

Information Retrieval-based Fault Localization for Concurren...

引用

38th IEEE/ACM International Conference on Automated Software Engineering (ASE)

作者： Shao, Shuai Yu, Tingting Univ Connecticut Dept Comp Sci & Engn Storrs CT 06269 USA

ISBN: (纸本)9798350329964

Information retrieval-based fault localization (IRFL) techniques have been proposed as a solution to identify the files that are likely to contain faults that are root causes of failures reported by users. These techniques have been extensively studied to accurately rank source files, however, none of the existing approaches have focused on the specific case of concurrent programs. This is a critical issue since concurrency bugs are notoriously difficult to identify. To address this problem, this paper presents a novel approach called BLCoiR, which aims to reformulate bug report queries to more accurately localize source files related to concurrency bugs. The key idea of BLCoiR is based on a novel knowledge graph (KG), which represents the domain entities extracted from the concurrency bug reports and their semantic relations. The KG is then transformed into the IR query to perform fault localization. BLCoiR leverages natural language processing (NLP) and concept modeling techniques to construct the knowledge graph. Specifically, NLP techniques are used to extract relevant entities from the bug reports, such as the word entities related to concurrency constructs. These entities are then linked together based on their semantic relationships, forming the KG. We have conducted an empirical study on 692 concurrency bug reports from 44 real-world applications. The results show that BLCoiR outperforms existing IRFL techniques in terms of accuracy and efficiency in localizing concurrency bugs. BLCoiR demonstrates effectiveness of using a knowledge graph to model the domain entities and their relationships, providing a promising direction for future research in this area.

关键词： concurrent program fault localization information retrieval

来源：评论

学校读者我要写书评

暂无评论

Dynamic Model Checking for Real-time Embedded Systems concurrent program

Dynamic Model Checking for Real-time Embedded Systems Concur...

引用

第十一届中国通信学会学术年会

作者： Fu xiufeng Ai Yunfeng Institute 706 Second of China Aerospace Science and Industry Corporation College of Engineering & Information Technology University of Chinese Academy of Sciences

In recent years, the complexity of designing real-time embedded systems continues to increase with their growing automation. concurrent programming methods have been widely used in designing. However, due to real-time embedded system interrupts and threads overlap, there is always a lack of effective program testing tools. Therefore we design a testing tool for real-time embedded systems dynamic concurrent programs, in which we use Labeled Transition Systems as a system model of concurrent programs, give formal definition for common concurrency errors, and use partial order reduction algorithm to reduce the state space of programs. Finally we realize the testing tool which can detect multi-threaded and multi-interrupt concurrent program errors.

关键词： concurrent program Multiple Interrupts Multithread Concurrency Errors

来源：评论

学校读者我要写书评

暂无评论

RaceHunter Dynamic Data Race Detector

引用

programMING AND COMPUTER SOFTWARE 2024年第6期50卷 467-481页

作者： Gerlits, E. A. Russian Acad Sci Ivannikov Inst Syst Programming Ul Solzhenitsyna 25 Moscow 109004 Russia

Data races represent a class of concurrency errors when two threads access a shared memory location without proper synchronization. Data races are hard to reveal and debug. This paper presents RaceHunter, a dynamic data race detection technique, which monitors executions of shared-memory concurrent programs, discovers pairs of conflicting memory accesses, and systematically checks them for data races. RaceHunter does not report false data races when the target software exploits nonstandard synchronization primitives or unknown synchronization protocols, and it can also detect data races missed by other approaches. Dynamic data race detectors can monitor continuous, e.g., real-life, program executions or they can verify relatively short program executions, e.g., organized by system tests. The latter is the primary use case scenario for RaceHunter.

关键词： data race dynamic analysis thread synchronization race condition concurrent program and multithreaded program

来源：评论

学校读者我要写书评

暂无评论

Information Retrieval-Based Fault Localization for concurrent programs 23

Information Retrieval-Based Fault Localization for Concurren...

引用

Proceedings of the 38th IEEE/ACM International Conference on Automated Software Engineering

作者： Shuai Shao Tingting Yu Department of Computer Science and Engineering University of Connecticut Storrs CT USA

ISBN: (纸本)9798350329964

关键词： concurrent program

来源：评论

学校读者我要写书评

暂无评论

Effective fault localization and context-aware debugging for concurrent programs

引用

SOFTWARE TESTING VERIFICATION & RELIABILITY 2022年第1期32卷

作者： Chu, Justin Yu, Tingting Hayes, Jane Huffman Han, Xue Zhao, Yu Univ Kentucky Dept Comp Sci Lexington KY USA Univ Cincinnati Dept Elect Engn & Comp Sci Cincinnati OH 45221 USA Univ Southern Indiana Comp Sci Dept Evansville IN USA Univ Cent Missouri Sch Comp Sci & Math Warrensburg MO USA

concurrent programs are difficult to debug because concurrency faults usually occur under specific inputs and thread interleavings. Fault localization techniques for sequential programs are often ineffective because the root causes of concurrency faults involve memory accesses across multiple threads rather than single statements. Previous research has proposed techniques to analyse passing and failing executions obtained from running a set of test cases for identifying faulty memory access patterns. However, stand-alone access patterns do not provide enough contextual information, such as the path leading to the failure, for developers to understand the bug. We present an approach, Coadec, to automatically generate interthread control flow paths that can link memory access patterns that occurred most frequently in the failing executions to better diagnose concurrency bugs. Coadec consists of two phases. In the first phase, we use feature selection techniques from machine learning to localize suspicious memory access patterns based on failing and passing executions. The patterns with maximum feature diversity information can point to the most suspicious pattern. We then apply a data mining technique and identify the memory access patterns that occurred most frequently in the failing executions. Finally, Coadec identifies faulty program paths by connecting both the frequent patterns and the suspicious pattern. We also evaluate the effectiveness of fault localization using test suites generated from different test adequacy criteria. We introduce and have evaluated Coadec on 10 real-world multithreaded Java applications. Results indicate that Coadec outperforms state-of-the-art approaches for localizing concurrency faults and that Coadec's context debugging can help developers understand concurrency fault by inspecting a small percentage of code.

关键词： concurrent program fault localization software debugging

来源：评论

学校读者我要写书评

暂无评论

A Search-Based Test Data Generation Method for concurrent programs

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS 2020年第1期13卷 1161-1175页

作者： Mirhosseini, Seyed Mohsen Haghighi, Hassan Shahid Beheshti Univ Fac Comp Sci & Engn GC Tehran Iran

concurrent programs are being widely adopted]. a development of multi-core and many-core processors. However., these types of programs present some features such as concurrency, communication and synchronization which make their testing more challenging than sequential programs. Search-based techniques, which use meta-heuristic search algorithms, have frequently been used for testing sequential programs, especially in the test data generation activity. However, application of search-based techniques in test data generation for concurrent programs has seldom been covered in the literature. The first contribution of this paper is to present a search-based test data generation framework for concurrent programs. Additionally, a hybrid meta-heuristic algorithm, called SFLA-VND, is proposed, which could be used in the mentioned framework as well as other meta-heuristic algorithms. SFLA-VND is a combination of the shuffled frog leaping algorithm (SFLA) and the variable neighborhood descent (VND). The proposed framework has been experimented on five concurrent benchmark programs by applying genetic algorithm (GA), ant colony optimization (ACO), particle swarm optimization (PSO), SFLA and SFLA-VND. Experimental results demonstrate the effectiveness and efficiency of this framework. Also, the results confirm the superiority of SFLA-VND in comparison With some popular meta-heuristic algorithms, When they are used for test data generation. (C) 2020 The authors. Published by Atlantis Press B.V.

关键词： Software testing Test data generation concurrent program Hybrid meta-heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：