Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhaoping Zhou

dblp:167/0205 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Debugging and program repair · 50% Program analysis · 50%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Debugging and program repair
automated program repair
0.212015
Safe Memory-Leak Fixing for C Programs · ICSE (1) 2015
Program analysis › static analysis
interprocedural analysis
0.212015
Safe Memory-Leak Fixing for C Programs · ICSE (1) 2015
Debugging and program repair › automated program repair
memory leak repair
0.212015
Safe Memory-Leak Fixing for C Programs · ICSE (1) 2015
Program analysis
static analysis
0.212015
Safe Memory-Leak Fixing for C Programs · ICSE (1) 2015

Methods — techniques the papers use, named apart from their topics

interprocedural analysis · 0.2
YearPublicationVenuePosition
2015 Safe Memory-Leak Fixing for C Programs
abstract
Automatic bug fixing has become a promising direction for reducing manual effort in debugging. However, general approaches to automatic bug fixing may face some fundamental difficulties. In this paper, we argue that automatic fixing of specific types of bugs can be a useful complement. This paper reports our first attempt towards automatically fixing memory leaks in C programs. Our approach generates only safe fixes, which are guaranteed not to interrupt normal execution of the program. To design such an approach, we have to deal with several challenging problems such as inter-procedural leaks, global variables, loops, and leaks from multiple allocations. We propose solutions to all the problems and integrate the solutions into a coherent approach. We implemented our inter-procedural memory leak fixing into a tool named Leak Fix and evaluated Leak Fix on 15 programs with 522k lines of code. Our evaluation shows that Leak Fix is able to successfully fix a substantial number of memory leaks, and Leak Fix is scalable for large applications.
Yingfei Xiong 0001, Yaqing Mi, Lu Zhang 0023, Weikun Yang, Zhaoping Zhou, Hong Mei 0001
ICSE (1)6