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

36th International Conference on Computer-Aided Verification (CAV)

作者： Cho, Chanhee Zhou, Yi Bosamiya, Jay Parno, Bryan Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9783031656262;9783031656279

Many program verification tools provide automation via SMT solvers, allowing them to automatically discharge many proofs. However, when a proof fails, it can be hard to understand why it failed or how to fix it. The main feedback the developer receives is simply the verification result (i.e., success or failure), with no visibility into the solver's internal state. To assist developers using such tools, we introduce ProofPlumber, a novel and extensible proof-action framework for understanding and debugging proof failures. Proof actions act on the developer's source-level proofs (e.g., assertions and lemmas) to determine why they failed and potentially suggest remedies. We evaluate ProofPlumber by writing a collection of proof actions that capture common proof debugging practices. We produce 17 proof actions, each only 29-177 lines of code.

关键词： program debugging

来源：评论

学校读者我要写书评

暂无评论

ReClues: Representing and Indexing Failures in Parallel debugging with program Variables 24

ReClues: Representing and Indexing Failures in Parallel Debu...

引用

44th ACM/IEEE International Conference on Software Engineering, ICSE 2024

作者： Song, Yi Zhang, Xihao Xie, Xiaoyuan Liu, Quanming Gao, Ruizhi Xing, Chenliang School of Computer Science Wuhan University Wuhan China Sonos Inc. Santa Barbara United States

ISBN: (纸本)9798400702174

Failures with different root causes can greatly disrupt multi-fault localization, therefore, categorizing failures into distinct groups according to the culprit fault is highly important. In such a failure indexing task, the crux lies in the failure proximity, which comprises two points, i.e., how to effectively represent failures (e.g., extract the signature of failures) and how to properly measure the distance between those proxies for failures. Existing research has proposed a variety of failure proximities. The majority of them extract signatures of failures from execution coverage or suspiciousness ranking lists, and accordingly employ the Euclid or the Kendall tau distances, etc. However, such strategies may not properly reflect the essential characteristics of failures, thus resulting in unsatisfactory effectiveness. In this paper, we propose a new failure proximity, namely, the program variable-based failure proximity, and further present a novel failure indexing approach, ReClues. Specifically, ReClues utilizes the run-time values of program variables to represent failures, and designs a set of rules to measure the similarity between them. Experimental results demonstrate the competitiveness of ReClues: it can achieve 44.12% and 27.59% improvements in faults number estimation, as well as 47.56% and 26.27% improvements in clustering effectiveness, compared with the state-of-the-art technique in this field, in simulated and real-world environments, respectively. © 2024 ACM.

关键词： program debugging

来源：评论

学校读者我要写书评

暂无评论

Show Me Why It’s Correct: Saving 1/3 of debugging Time in program Repair with Interactive Runtime Comparison

arXiv

引用

arXiv 2025年

作者： Wang, Ruixin Zhao, Zhongkai Fang, Le Jiang, Nan Lou, Yiling Tan, Lin Zhang, Tianyi Purdue University United States National University of Singapore Singapore Fudan University China

Automated program Repair (APR) holds the promise of alleviating the burden of debugging and fixing software bugs. Despite this, developers still need to manually inspect each patch to confirm its correctness, which is tedious and time-consuming. This challenge is exacerbated in the presence of plausible patches, which accidentally pass test cases but may not correctly fix the bug. To address this challenge, we propose an interactive approach called iFix to facilitate patch understanding and comparison based on their runtime difference. iFix performs static analysis to identify runtime variables related to the buggy statement and captures their runtime values during execution for each patch. These values are then aligned across different patch candidates, allowing users to compare and contrast their runtime behavior. To evaluate iFix, we conducted a within-subjects user study with 28 participants. Compared with manual inspection and a state-of-the-art interactive patch filtering technique, iFix reduced participants’ task completion time by 36% and 33% while also improving their confidence by 50% and 20%, respectively. Besides, quantitative experiments demonstrate that iFix improves the ranking of correct patches by at least 39% compared with other patch ranking methods and is generalizable to different APR tools. © 2025, CC BY.

关键词： program debugging

来源：评论

学校读者我要写书评

暂无评论

Combining mutation and fault localization for automated program debugging

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2014年第1期90卷 45-60页

作者： Debroy, Vidroha Wong, W. Eric Microsoft Redmond WA USA Univ Texas Dallas Dept Comp Sci Dallas TX 75230 USA

This paper proposes a strategy for automatically fixing faults in a program by combining the ideas of mutation and fault localization. Statements ranked in order of their likelihood of containing faults are mutated in the same order to produce potential fixes for the faulty program. The proposed strategy is evaluated using 8 mutant operators against 19 programs each with multiple faulty versions. Our results indicate that 20.70% of the faults are fixed using selected mutant operators, suggesting that the strategy holds merit for automatically fixing faults. The impact of fault localization on efficiency of the overall fault-fixing process is investigated by experimenting with two different techniques, Tarantula and Ochiai, the latter of which has been reported to be better at fault localization than Tarantula, and also proves to be better in the context of fault-fixing using our proposed strategy. Further experiments are also presented to evaluate stopping criteria with respect to the mutant examination process and reveal that a significant fraction of the (fixable) faults can be fixed by examining a small percentage of the program code. We also report on the relative fault-fixing capabilities of mutant operators used and present discussions on future work. (C) 2013 Elsevier Inc. All rights reserved.

关键词： program debugging Mutation Fault localization Fault-fixing Software testing

来源：评论

学校读者我要写书评

暂无评论

Replay debugging: Leveraging Record and Replay for program debugging

Replay Debugging: Leveraging Record and Replay for Program D...

引用

ACM/IEEE 41st Annual International Symposium on Computer Architecture (ISCA)

作者： Honarmand, Nima Torrellas, Josep Univ Illinois Champaign IL 61820 USA

ISBN: (纸本)9781479943944

Hardware-assisted Record and Deterministic Replay (RnR) of programs has been proposed as a primitive for debugging hard-to-repeat software bugs. However, simply providing support for repeatedly stumbling on the same bug does not help diagnose it. For bug diagnosis, developers typically want to modify the code, e.g., by creating and operating on new variables, or printing state. Unfortunately, this renders the RnR log inconsistent and makes Replay debugging (i.e., debugging while using an RnR log for replay) dicey at best. This paper presents rdb, the first scheme for replay debugging that guarantees exact replay. rdb relies on two mechanisms. The first one is compiler support to split the instrumented application into two executables: one that is identical to the original program binary, and another that encapsulates all the added debug code. The second mechanism is a runtime infrastructure that replays the application and, without affecting it in any way, invokes the appropriate debug code at the appropriate locations. We describe an implementation of rdb based on LLVM and Pin, and show an example of how rdb's replay debugging helps diagnose a real bug.

关键词： program debugging

来源：评论

学校读者我要写书评

暂无评论

An Active Vibration Isolator for the Space Optical Clock

引用

INSTRUMENTS AND EXPERIMENTAL TECHNIQUES 2024年第2期67卷 431-438页

作者： Li, Wei Li, Qing He, Keda Liu, Lei Northwestern Polytech Univ Sch Astronaut Xian 710072 Peoples R China Shaanxi Aerosp Flight Vehicle Design Key Lab Xian 710072 Peoples R China Tsinghua Univ Sch Aerosp Engn Beijing 100084 Peoples R China

Space optical clock is an important device for future space science experiments. Inevitably, the micro-vibration level in the order of micro-g (mu g) is required for ultra-stable optical reference cavity of space optical clock. However, the existing research on active vibration isolators of space optical clock is still in the laboratory development stage, and their vibration isolation control algorithms still rely on high-performance commercial real-time controllers, making it difficult to meet the application requirements for isolators of space optical clock. On the basis of the previous work, this paper describes the development an active vibration isolator that meets the experimental requirements of the space optical clock. Based on the DSP embedded vibration isolation controller, an anti-saturation control algorithm is designed, which solves the problems of high order of robust controllers, large computing resources and difficult parameter debugging. The active vibration isolation experimental system is further developed, and the experimental results validate the effectiveness of the developed active vibration isolator and anti-saturation control algorithm.

关键词： program debugging

来源：评论

学校读者我要写书评

暂无评论

Fully Autonomous programming Using Iterative Multi-Agent debugging with Large Language Models

引用

ACM Transactions on Evolutionary Learning and Optimization 2025年第1期5卷 1-37页

作者： Grishina, Anastasiia Liventsev, Vadim Härmä, Aki Moonen, Leon Simula Oslo Norway University of Oslo Oslo Norway Department of Mathematics and Computer Science Eindhoven University of Technology Eindhoven Netherlands Philips Research Eindhoven Netherlands

program synthesis with Large Language Models (LLMs) suffers from a "near-miss syndrome": The generated code closely resembles a correct solution but fails unit tests due to minor errors. We address this with a multi-agent framework called Synthesize, Execute, Instruct, Debug, and Repair (SEIDR). Effectively applying SEIDR to instruction-tuned LLMs requires determining (a) optimal prompts for LLMs, (b) what ranking algorithm selects the best programs in debugging rounds, and (c) balancing the repair of unsuccessful programs with the generation of new ones. We empirically explore these tradeoffs by comparing replace-focused, repair-focused, and hybrid debug strategies. We also evaluate lexicase and tournament selection to rank candidates in each generation. On program Synthesis Benchmark 2 (PSB2), our framework outperforms both conventional use of OpenAI Codex without a repair phase and traditional genetic programming approaches. SEIDR outperforms the use of an LLM alone, solving 18 problems in C++ and 20 in Python on PSB2 at least once across experiments. To assess generalizability, we employ GPT-3.5 and Llama 3 on the PSB2 and HumanEval-X benchmarks. Although SEIDR with these models does not surpass current state-of-the-art methods on the Python benchmarks, the results on HumanEval-C++ are promising. SEIDR with Llama 3-8B achieves an average pass@100 of 84.2%. Across all SEIDR runs, 163 of 164 problems are solved at least once with GPT-3.5 in HumanEval-C++, and 162 of 164 with the smaller Llama 3-8B. We conclude that SEIDR effectively overcomes the near-miss syndrome in program synthesis with LLMs. © 2025 Copyright held by the owner/author(s).

关键词： program debugging

来源：评论

学校读者我要写书评

暂无评论

FormatAEG: a framework for bypassing ASLR defense and automated exploitation of format string vulnerability

引用

COMPUTER JOURNAL 2024年第11期67卷 3056-3066页

作者： Xu, Shenglin Jiang, Zhiyuan Wang, Yongjun Xie, Peidai Natl Univ Def Technol Sch Comp 137 Yanwachi St Changsha 410073 Hunan Peoples R China

The format string vulnerability is a common software vulnerability. A well-constructed format string can read and modify arbitrary memory addresses, causing serious system problems. Existing automated exploit generation solutions for format string vulnerability are unable to cope with the limitations imposed by the vulnerability defense mechanism Address Space Layout Randomization (ASLR) and the program itself on vulnerability exploitation. In this paper, to address the above challenges, we propose FormatAEG, the first automatic exploitation framework for format string vulnerabilities that can bypass ASLR defense and the program's own constraints. Specifically, we first proposed an arbitrary address reading and writing method based on a format string vulnerability, which can modify the target address data by directly arranging the target address or automatically searching and utilizing the pointer chain in the stack. Then, we propose a vulnerability reentry method based on global offset table (GOT) hijacking, which hijacks the program control flow by modifying function addresses in the GOT, making the vulnerability reentrant. In the experimental section, we evaluated FormatAEG using 20 Capture The Flag programs from top international tournaments and two real-world programs with format string vulnerabilities. The evaluation results show that with ASLR defense turned on, FormatAEG successfully detects format string vulnerability in 19 of these programs and generates exploit code for 15 of them. Compared with existing tools, FormatAEG detected 11 more format string vulnerabilities and generated 13 more exploit codes.

关键词： program debugging

来源：评论

学校读者我要写书评

暂无评论

Variable-based Fault Localization via Enhanced Decision Tree

引用

ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY 2024年第2期33卷 1-32页

作者： Jiang, Jiajun Wang, Yumeng Chen, Junjie Lv, Delin Liu, Mengjiao Tianjin Univ Coll Intelligence & Comp Tianjin 300350 Peoples R China

Fault localization, aiming at localizing the root cause of the bug under repair, has been a longstanding research topic. Although many approaches have been proposed in past decades, most of the existing studies work at coarse-grained statement or method levels with very limited insights about how to repair the bug (granularity problem), but few studies target the finer-grained fault localization. In this article, we target the granularity problem and propose a novel finer-grained variable-level fault localization technique. Specifically, the basic idea of our approach is that fault-relevant variables may exhibit different values in failed and passed test runs, and variables that have higher discrimination ability have a larger possibility to be the root causes of the failure. Based on this, we propose a program-dependency-enhanced decision tree model to boost the identification of fault-relevant variables via discriminating failed and passed test cases based on the variable values. To evaluate the effectiveness of our approach, we have implemented it in a tool called VarDT and conducted an extensive study over the Defects4J benchmark. The results show that VarDT outperforms the state-of-the-art fault localization approaches with at least 268.4% improvement in terms of bugs located at Top-1, and the average improvement is 351.3%. Besides, to investigate whether our finer-grained fault localization result can further improve the effectiveness of downstream APR techniques, we have adapted VarDT to the application of patch filtering, where we use the variables located by VarDT to filter incorrect patches. The results denote that VarDT outperforms the state-of-the-art PATCH-SIM and BATS by filtering 14.8% and 181.8% more incorrect patches, respectively, demonstrating the effectiveness of our approach. It also provides a new way of thinking for improving automatic program repair techniques.

关键词： Fault localization program debugging decision tree

来源：评论

学校读者我要写书评

暂无评论

Assisting Tools for Formulating Enbugging Quiz Problems Based on Code Minimization and Syntax-Driven Code Generation.

Computer Software

引用

Computer Software 2025年第1期42卷 3-22页

作者： Tsunoda, Kazuhiro Masuhara, Hidehiko Cong, Youyou Dept. of Mathematical and Computing Science Tokyo Institute of Technology Institute of Science Tokyo since October 2024 Japan

Enbugging quiz is a format of programming exercises that let learners edit a given program so that it yields a designated error message. In order to formulate a quiz problem with less ambiguity and reasonable difficulty, one needs to consider many variants of a program and the produced errors. In this article, we propose two methods of assisting the problem formulation processes, namely a code minimization method that preserves error messages and an efficient method of searching alternative answers based on syntax-directed code generation. We also report the results of the application of the methods to the quiz problems that the authors composed for a university course in order to assess the effectiveness of the methods. © 2025 Japan Society for Software Science and Technology. All rights reserved.

关键词： program debugging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：