A Mathematical Framework for Automated Bug Localization: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 14:2914:29, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,037 bytes +1,037‎ Created page with "Title: A Mathematical Framework for Automated Bug Localization Research Question: How can we develop a mathematical framework for automated bug localization? Methodology: The authors propose a framework for automated bug localization using a rooted acyclic directed graph, which represents an instance of an execution of a program. They define key terms such as execution graph, cut-set, and state. Results: The authors present a pruning algorithm, which is a debugging ta..."
Retrieved from "https://simplesci.org/wiki/A_Mathematical_Framework_for_Automated_Bug_Localization"