{"title":"TDFix：基于模板修复死锁的轻量级工具","authors":"Wangjie Ji, Lili Bo, Yanchi Yuan, Xiaobing Sun","doi":"10.1016/j.scico.2023.103073","DOIUrl":null,"url":null,"abstract":"<div><p>Deadlock is notoriously difficult to detect and fix correctly. Existing approaches aim at fixing deadlocks under the premise of having known the deadlock and the buggy code involved in the deadlock, which leads to a certain gap from the practical multithreaded software development. In this paper, we describe the design and implementation of <em>TDFix</em>, which can detect, localize, and fix deadlocks in Java programs based on the pre-defined deadlock fixing templates. <em>TDFix</em> locates the buggy code by searching for the destination node in the AST of a program and modifying the node information based on the templates. Experimental results show that <em>TDFix</em> can successfully fix 176 out of 198 deadlocks in at most 90 seconds for each large Java project, indicating its effectiveness and efficiency.</p></div>","PeriodicalId":49561,"journal":{"name":"Science of Computer Programming","volume":"233 ","pages":"Article 103073"},"PeriodicalIF":1.5000,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"TDFix: A lightweight tool for fixing deadlocks based on templates\",\"authors\":\"Wangjie Ji, Lili Bo, Yanchi Yuan, Xiaobing Sun\",\"doi\":\"10.1016/j.scico.2023.103073\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Deadlock is notoriously difficult to detect and fix correctly. Existing approaches aim at fixing deadlocks under the premise of having known the deadlock and the buggy code involved in the deadlock, which leads to a certain gap from the practical multithreaded software development. In this paper, we describe the design and implementation of <em>TDFix</em>, which can detect, localize, and fix deadlocks in Java programs based on the pre-defined deadlock fixing templates. <em>TDFix</em> locates the buggy code by searching for the destination node in the AST of a program and modifying the node information based on the templates. Experimental results show that <em>TDFix</em> can successfully fix 176 out of 198 deadlocks in at most 90 seconds for each large Java project, indicating its effectiveness and efficiency.</p></div>\",\"PeriodicalId\":49561,\"journal\":{\"name\":\"Science of Computer Programming\",\"volume\":\"233 \",\"pages\":\"Article 103073\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2023-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Science of Computer Programming\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167642323001557\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Science of Computer Programming","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167642323001557","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
TDFix: A lightweight tool for fixing deadlocks based on templates
Deadlock is notoriously difficult to detect and fix correctly. Existing approaches aim at fixing deadlocks under the premise of having known the deadlock and the buggy code involved in the deadlock, which leads to a certain gap from the practical multithreaded software development. In this paper, we describe the design and implementation of TDFix, which can detect, localize, and fix deadlocks in Java programs based on the pre-defined deadlock fixing templates. TDFix locates the buggy code by searching for the destination node in the AST of a program and modifying the node information based on the templates. Experimental results show that TDFix can successfully fix 176 out of 198 deadlocks in at most 90 seconds for each large Java project, indicating its effectiveness and efficiency.
期刊介绍：
Science of Computer Programming is dedicated to the distribution of research results in the areas of software systems development, use and maintenance, including the software aspects of hardware design.
The journal has a wide scope ranging from the many facets of methodological foundations to the details of technical issues andthe aspects of industrial practice.
The subjects of interest to SCP cover the entire spectrum of methods for the entire life cycle of software systems, including
• Requirements, specification, design, validation, verification, coding, testing, maintenance, metrics and renovation of software;
• Design, implementation and evaluation of programming languages;
• Programming environments, development tools, visualisation and animation;
• Management of the development process;
• Human factors in software, software for social interaction, software for social computing;
• Cyber physical systems, and software for the interaction between the physical and the machine;
• Software aspects of infrastructure services, system administration, and network management.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
