We use cookies to improve your experience with our site.
Feng Li, Guo-Qing Wang, Meng Wang, Dan Hao. Coverage-based Fault Localization in Haskell[J]. Journal of Computer Science and Technology. DOI: 10.1007/s11390-024-2967-1
Citation: Feng Li, Guo-Qing Wang, Meng Wang, Dan Hao. Coverage-based Fault Localization in Haskell[J]. Journal of Computer Science and Technology. DOI: 10.1007/s11390-024-2967-1

Coverage-based Fault Localization in Haskell

  • Fault localization is to identify faulty program elements. Among a large number of fault localization approaches in the literature, coverage-based fault localization, especially spectrum-based fault localization (SBFL), has been intensively studied due to its effectiveness and lightweightness. Despite the rich literature, almost all existing fault localization approaches and studies are conducted on imperative programming languages such as Java and C, leaving a gap in other programming paradigms. In this paper, we aim to study fault localization approaches for the functional programming paradigm, using Haskell language as a representative. To the best of our knowledge, we build up the first dataset on real Haskell projects, including both real and seeded faults, which enables the research of fault localization for functional languages. With this dataset, we explore fault localization techniques for Haskell. In particular, as typically for SBFL approaches, we study methods for coverage collection and formulae for suspiciousness score computation, and carefully adapt these two components to Haskell considering the language features and characteristics, resulting in a series of adaption approaches. Moreover, we also design a learning-based approach and a transfer-learning-based approach to take advantage of data from imperative languages, which are evaluated on our dataset to demonstrate the promises of the direction.
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return