Conference paper Closed Access
Yiqun Chen; Stefan Winter; Neeraj Suri
<?xml version='1.0' encoding='UTF-8'?> <record xmlns="http://www.loc.gov/MARC21/slim"> <leader>00000nam##2200000uu#4500</leader> <datafield tag="260" ind1=" " ind2=" "> <subfield code="c">2020-01-05</subfield> </datafield> <controlfield tag="005">20210219002704.0</controlfield> <datafield tag="773" ind1=" " ind2=" "> <subfield code="n">doi</subfield> <subfield code="i">isVersionOf</subfield> <subfield code="a">10.5281/zenodo.3598077</subfield> </datafield> <controlfield tag="001">3598078</controlfield> <datafield tag="909" ind1="C" ind2="O"> <subfield code="o">oai:zenodo.org:3598078</subfield> </datafield> <datafield tag="711" ind1=" " ind2=" "> <subfield code="d">Oct 28 - 31, 2019</subfield> <subfield code="g">ISSRE</subfield> <subfield code="a">International Symposium on Software Reliability Engineering</subfield> <subfield code="c">Berlin, Germany</subfield> </datafield> <datafield tag="520" ind1=" " ind2=" "> <subfield code="a"><p>Performance bugs, i.e., program source code that&nbsp;is unnecessarily inefficient, have received significant attention&nbsp;by the research community in recent years. A number of&nbsp;empirical studies have investigated how these bugs differ from&nbsp;&ldquo;ordinary&rdquo; bugs that cause functional deviations and several&nbsp;approaches to aid their detection, localization, and removal have&nbsp;been proposed. Many of these approaches focus on certain subclasses&nbsp;of performance bugs, e.g., those resulting from redundant&nbsp;computations or unnecessary synchronization, and the evaluation&nbsp;of their effectiveness is usually limited to a small number of&nbsp;known instances of these bugs. To provide researchers working&nbsp;on performance bug detection and localization techniques with&nbsp;a larger corpus of performance bugs to evaluate against, we&nbsp;conduct a study of more than 700 performance bug fixing&nbsp;commits across 13 popular open source projects written in C&nbsp;and C++ and investigate the relative frequency of bug types as&nbsp;well as their complexity. Our results show that many of these&nbsp;fixes follow a small set of bug patterns, that they are contributed&nbsp;by experienced developers, and that the number of lines needed&nbsp;to fix performance bugs is highly project dependent.</p></subfield> </datafield> <datafield tag="700" ind1=" " ind2=" "> <subfield code="u">DEEDS Group, Dept. of Computer Science Technische Universit¨at Darmstadt</subfield> <subfield code="a">Stefan Winter</subfield> </datafield> <datafield tag="700" ind1=" " ind2=" "> <subfield code="u">DEEDS Group, Dept. of Computer Science Technische Universit¨at Darmstadt</subfield> <subfield code="a">Neeraj Suri</subfield> </datafield> <datafield tag="542" ind1=" " ind2=" "> <subfield code="l">closed</subfield> </datafield> <datafield tag="856" ind1="4" ind2=" "> <subfield code="y">Conference website</subfield> <subfield code="u">http://2019.issre.net/node/79</subfield> </datafield> <datafield tag="980" ind1=" " ind2=" "> <subfield code="a">publication</subfield> <subfield code="b">conferencepaper</subfield> </datafield> <datafield tag="100" ind1=" " ind2=" "> <subfield code="u">DEEDS Group, Dept. of Computer Science Technische Universit¨at Darmstadt</subfield> <subfield code="a">Yiqun Chen</subfield> </datafield> <datafield tag="024" ind1=" " ind2=" "> <subfield code="a">10.5281/zenodo.3598078</subfield> <subfield code="2">doi</subfield> </datafield> <datafield tag="245" ind1=" " ind2=" "> <subfield code="a">Inferring Performance Bug Patterns from Developer Commits</subfield> </datafield> <datafield tag="536" ind1=" " ind2=" "> <subfield code="c">830927</subfield> <subfield code="a">Cyber security cOmpeteNCe fOr Research anD InnovAtion</subfield> </datafield> </record>
All versions | This version | |
---|---|---|
Views | 78 | 78 |
Downloads | 40 | 40 |
Data volume | 12.4 MB | 12.4 MB |
Unique views | 69 | 69 |
Unique downloads | 40 | 40 |