Hiindex LOGO

Research Article

Bugloc: Bug Localization In Multi Threaded Application Via Graph Mining Approach


Author(s): A. Adhiselvam , E. Kirubakaran,R. Sukumar
Affiliation: Assistant Professor, Department of MCA, S.T.E.T Women’s College, Mannargudi
Year of Publication: 2016
Source: International Journal of Computing Algorithm
     
×

Scholarly Article Identity Link


HTML:

<a href="http://www.hindex.org/2016/article.php?page=888"><img src="http://www.hindex.org/sai.php/2016SCIA316F0888" alt="SAI"></a>


File:

http://www.hindex.org/2016/p888.pdf


Citation: A. Adhiselvam, E. Kirubakaran,R. Sukumar. "Bugloc: Bug Localization In Multi Threaded Application Via Graph Mining Approach." International Journal of Computing Algorithm 5.1 (2016): 5-11.

Abstract:
Detection of software bugs and its occurrences, repudiation and its root cause is a very difficult process in large multi threaded applications. It is a must for a software developer or software organization to identify bugs in their applications and to remove or overcome them. The application should be protected from malfunctioning. Many of the compilers and Integrated Development Environments are effectively identifying errors and bugs in applications while running or compiling, but they fail in detecting actual cause for the bugs in the running applications. The developer has to reframe or recreate the package with the new one without bugs. It is time consuming and effort is wasted in Software Development Life Cycle.


Keywords Graph Mining, Pattern Mining, Heuristic Approach, Frequent Subgraph, Bug Localization


  • BibTex
  • Reference
  • XML
  • JSON
  • Dublin Core
  • CSL

@article{Bug1688851, author = {A. Adhiselvam,E. Kirubakaran,R. Sukumar}, title = {Bugloc: Bug Localization In Multi Threaded Application Via Graph Mining Approach}, journal={International Journal of Computing Algorithm}, volume={5}, issue={1}, issn = {2278-2397}, year = {2016}, publisher = {Scholarly Citation Index Analytics-SCIA}

  • [1] Elseidy, Mohammed, Ehab Abdelhamid, Spiros Skiadopoulos, and Panos Kalnis. "Grami: Frequent subgraph and pattern mining in a single large graph." Proceedings of the VLDB Endowment 7, no. 7 2014: 517-528.
  • [2] Huan, Jun, Wei Wang, and Jan Prins. "Efficient mining of frequent subgraphs in the presence of isomorphism." In Data Mining, 2003. ICDM 2003. Third IEEE International Conference on, pp. 549-552. IEEE, 2003.
  • [3] Schaeffer, Satu Elisa. "Graph clustering." Computer Science Review 1, no. 1 2007: 27-64.
  • [4] Lin, Chuan, Young-rae Cho, Woo-chang Hwang, Pengjun Pei, and Aidong Zhang. "Clustering methods in protein-protein interaction network." Knowledge Discovery in Bioinformatics: techniques, methods and application 2007: 1-35.
  • [5] Kim, Jinha, Hyungyu Shin, Wook-Shin Han, Sungpack Hong, and Hassan Chafi. "Taming subgraph isomorphism for RDF query processing."Proceedings of the VLDB Endowment 8, no. 11 2015: 1238-1249.
  • [6] Bringmann, Björn, and Siegfried Nijssen. "What is frequent in a single graph?." In Advances in Knowledge Discovery and Data Mining, pp. 858-863. Springer Berlin Heidelberg, 2008.
  • [7] Lakshmi, K. "Frequent Subgraph Mining Algorithms--A Survey And Framework For Classification." 2012.
  • [8] Cleve, Jürgen, Uwe Lämmel, and Stefan Wissuwa. "Data Mining on Transaction Data." Global Markets in Dynamic Environments, Lisboa 2005.
  • [9] Silvestri, Claudio, and Salvatore Orlando. "Approximate mining of frequent patterns on streams." Intelligent Data Analysis 11, no. 1 2007: 49-73.
  • [10] Cheng, Jiefeng, Jeffrey Xu Yu, and Bolin Ding. "Multi Reachability Query Processing." 2008. [11] Woeginger, Gerhard J. "Exact algorithms for NP-hard problems: A survey." InCombinatorial Optimization—Eureka, You Shrink!, pp. 185-207. Springer Berlin Heidelberg, 2003.

  • <?xml version='1.0' encoding='UTF-8'?> <record> <language>eng</language> <journalTitle>International Journal of Computing Algorithm</journalTitle> <eissn>2278-2397 </eissn> <publicationDate>2016</publicationDate> <volume>5</volume> <issue>1</issue> <startPage>5</startPage> <endPage>11</endPage> <documentType>article</documentType> <title language='eng'>Bugloc: Bug Localization In Multi Threaded Application Via Graph Mining Approach</title> <authors> <author> <name>A. Adhiselvam</name> </author> </authors> <abstract language='eng'>Detection of software bugs and its occurrences, repudiation and its root cause is a very difficult process in large multi threaded applications. It is a must for a software developer or software organization to identify bugs in their applications and to remove or overcome them. The application should be protected from malfunctioning. Many of the compilers and Integrated Development Environments are effectively identifying errors and bugs in applications while running or compiling, but they fail in detecting actual cause for the bugs in the running applications. The developer has to reframe or recreate the package with the new one without bugs. It is time consuming and effort is wasted in Software Development Life Cycle.</abstract> <fullTextUrl format='pdf'>http://www.hindex.org/2016/p888.pdf</fullTextUrl> <keywords language='eng'> <keyword>Graph Mining, Pattern Mining, Heuristic Approach, Frequent Subgraph, Bug Localization</keyword> </keywords> </record>

    { "@context":"http://schema.org", "@type":"publication-article","identifier":"http://www.hindex.org/2016/article.php?page=888", "name":"Bugloc: Bug Localization In Multi Threaded Application Via Graph Mining Approach", "author":[{"name":"A. Adhiselvam "}], "datePublished":"2016", "description":"Detection of software bugs and its occurrences, repudiation and its root cause is a very difficult process in large multi threaded applications. It is a must for a software developer or software organization to identify bugs in their applications and to remove or overcome them. The application should be protected from malfunctioning. Many of the compilers and Integrated Development Environments are effectively identifying errors and bugs in applications while running or compiling, but they fail in detecting actual cause for the bugs in the running applications. The developer has to reframe or recreate the package with the new one without bugs. It is time consuming and effort is wasted in Software Development Life Cycle.", "keywords":["Graph Mining, Pattern Mining, Heuristic Approach, Frequent Subgraph, Bug Localization"], "schemaVersion":"https://schema.org/version/3.3", "includedInDataCatalog":{ "@type":"DataCatalog", "name":"Scholarly Citation Index Analytics-SCIA", "url":"http://hindex.org"}, "publisher":{"@type":"Organization", "name":"Scientific Communications Research Academy" } }

    <?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"> <dc:contributor>E. Kirubakaran</dc:contributor> <dc:contributor>R. Sukumar</dc:contributor> <dc:contributor></dc:contributor> <dc:creator>A. Adhiselvam</dc:creator> <dc:date>2016</dc:date> <dc:description>Detection of software bugs and its occurrences, repudiation and its root cause is a very difficult process in large multi threaded applications. It is a must for a software developer or software organization to identify bugs in their applications and to remove or overcome them. The application should be protected from malfunctioning. Many of the compilers and Integrated Development Environments are effectively identifying errors and bugs in applications while running or compiling, but they fail in detecting actual cause for the bugs in the running applications. The developer has to reframe or recreate the package with the new one without bugs. It is time consuming and effort is wasted in Software Development Life Cycle.</dc:description> <dc:identifier>2016SCIA316F0888</dc:identifier> <dc:language>eng</dc:language> <dc:title>Bugloc: Bug Localization In Multi Threaded Application Via Graph Mining Approach</dc:title> <dc:type>publication-article</dc:type> </oai_dc:dc>

    { "identifier": "2016SCIA316F0888", "abstract": "Detection of software bugs and its occurrences, repudiation and its root cause is a very difficult process in large multi threaded applications. It is a must for a software developer or software organization to identify bugs in their applications and to remove or overcome them. The application should be protected from malfunctioning. Many of the compilers and Integrated Development Environments are effectively identifying errors and bugs in applications while running or compiling, but they fail in detecting actual cause for the bugs in the running applications. The developer has to reframe or recreate the package with the new one without bugs. It is time consuming and effort is wasted in Software Development Life Cycle.", "author": [ { "family": "A. Adhiselvam,E. Kirubakaran,R. Sukumar" } ], "id": "888", "issued": { "date-parts": [ [ 2016 ] ] }, "language": "eng", "publisher": "Scholarly Citation Index Analytics-SCIA", "title": " Bugloc: Bug Localization In Multi Threaded Application Via Graph Mining Approach", "type": "publication-article", "version": "3" }