- Seminar Calendar
- Seminar Archive
- 2024-2025 Semester 2
- 2024-2025 Semester 1
- 2023-2024 Semester 2
- 2023-2024 Semester 1
- 2022-2023 Semester 2
- 2022-2023 Semester 1
- 2021-2022 Semester 2
- 2021-2022 Semester 1
- 2020-2021 Semester 2
- 2020-2021 Semester 1
- 2019-2020 Semester 2
- 2019-2020 Semester 1
- 2018-2019 Semester 2
- 2018-2019 Semester 1
- 2017-2018 Semester 2
- 2017-2018 Semester 1
- 2016-2017 Semester 2
- 2016-2017 Semester 1
- 2015-2016 Semester 1
- 2015-2016 Semester 2
- 2014-2015 Semester 2
- 2014-2015 Semester 1
- 2013-2014 Semester 2
- 2013-2014 Semester 1
- 2012-2013 Semester 2
- 2012-2013 Semester 1
- 2011-2012 Semester 2
- 2011-2012 Semester 1
- 2010-2011 Semester 2
- 2010-2011 Semester 1
- 2009-2010 Semester 2
- 2009-2010 Semester 1
- 2008-2009 Semester 2
- 2008-2009 Semester 1
- 2007-2008 Semester 2
- 2007-2008 Semester 1
- 2006-2007 Semester 2
- 2006-2007 Semester 1
- 2005-2006 Semester 2
- 2005-2006 Semester 1
- Contact
- Site Map
Seminar: Identifying Bug Signatures Using Discriminative Graph Mining
Seminar
Department of Systems Engineering and Engineering Management
The Chinese University of Hong Kong
Title : Identifying Bug Signatures Using Discriminative Graph Mining
Speaker : Prof. Hong Cheng
Date : Sep. 21st, 2012 (Friday)
Time : 4:30 p.m. - 5:30 p.m.
Venue : Room 513
William M.W. Mong Engineering Building
CUHK
Abstract:
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Although such methods could be very accurate, it is usually very hard for developers to understand the context of the bug, given each bug location in isolation. In our work, we model software executions as graphs at two levels of granularity: methods and basic blocks. An individual node represents a method or basic block and an edge represents a method call, method return or transition (at the method or basic block granularity). Given a set of graphs of correct and faulty executions, we propose to extract the most discriminative subgraphs which contrast the program flow of correct and faulty
executions. The extracted subgraphs not only pinpoint the bug, but also provide an informative context for understanding and fixing the bug. Different from traditional graph mining which mines a very large set of frequent subgraphs, we formulate subgraph mining as an optimization problem and directly generate the top-K most discriminative subgraphs representing distinct locations which may contain bugs. Experimental results and case studies show that our proposed method is both effective and efficient to mine
discriminative subgraphs for bug localization and context identification.
Biography:
Dr. Hong Cheng is an Assistant Professor in the Department of Systems Engineering and Engineering Management at the Chinese University of Hong Kong. She received her Ph.D. degree from University of Illinois at Urbana-Champaign in 2008.
Dr. Cheng\'s research interests include data mining, database systems and machine learning. She also studies analyzing software code and execution using data mining approaches. She has published over 50 research papers in international conferences and journals, including SIGMOD, VLDB, SIGKDD, ICDE, IEEE Transactions on Knowledge and Data Engineering, ACM Transactions on Knowledge Discovery from Data, and Data Mining and Knowledge Discovery, and received research paper awards at ICDE\'07, SIGKDD\'06 and SIGKDD\'05. She received the certificate of recognition for the 2009 SIGKDD Doctoral Dissertation Award.
************************* ALL ARE WELCOME ************************
Host : Prof. Hong Cheng
Tel : (852) 3943-8300
Email : hcheng@se.cuhk.edu.hk
Enquiries : Prof. Hong Cheng
Department of Systems Engineering and Engineering Management
CUHK
Website : http://www.se.cuhk.edu.hk/~seem5201
Email : seem5201@se.cuhk.edu.hk
Date:
Friday, September 21, 2012 - 08:30 to 09:30