Incremental regression testing

Agrawal, Hiralal; Horgan, J.R.; Krauser, E.W.; London, S.

doi:10.1109/icsm.1993.366927

Cited by 180 publications

(187 citation statements)

References 17 publications

Supporting

Mentioning

184

Contrasting

Unclassified

Order By: Relevance

“… Slicing Algorithms (SLI): do Agrawal và cộng sự [22] đã đề xuất giải thuật chọn lựa ca kiểm thử mà đầu ra của chúng có thể bị ảnh hưởng bởi chương trình đó.…”

Section: B Chọn Lựa Ca Kiểm Thử Hồi Qui (Rts)unclassified

Kỹ Thuật Kiểm Thử Hồi Qui Hiệu Quả Cho Phát Triển Ứng Dụng Di Động

Thắng¹,

Mận²,

Trang³

et al. 2017

Fair - Nghiên Cứu Cơ Bản Và Ứng Dụng Công Nghệ Thông Tin - 2016

View full text Add to dashboard Cite

Section: B Chọn Lựa Ca Kiểm Thử Hồi Qui (Rts)unclassified

Kỹ Thuật Kiểm Thử Hồi Qui Hiệu Quả Cho Phát Triển Ứng Dụng Di Động

Thắng¹,

Mận²,

Trang³

et al. 2017

Fair - Nghiên Cứu Cơ Bản Và Ứng Dụng Công Nghệ Thông Tin - 2016

View full text Add to dashboard Cite

“…Static Slicing [21] identifies a subset of program statements that may influence the value of a variable at a particular program location. The related concepts of Dynamic Slicing [1,13,24] and Relevant Slicing [2,7] have also been studied. In general, slicing identifies all statements that influence or are influenced by a variable at a program point.…”

Section: Related Workmentioning

confidence: 99%

Identifying the root causes of memory bugs using corrupted memory location suppression

Jeffrey

Gupta

2008

2008 IEEE International Conference on Software Maintenance

View full text Add to dashboard Cite

We present a general approach for automatically isolating the root causes of memory-related bugs in software. Our approach is based on the observation that most memory bugs involve uses of corrupted memory locations. By iteratively suppressing (nullifying) the effects of these corrupted memory locations during program execution, our approach gradually isolates the root cause of a memory bug. Our approach can work for common memory bugs such as buffer overflows, uninitialized reads, and double frees. However, our approach is particularly effective in finding root causes for memory bugs in which memory corruption propagates during execution until an observable failure such as a program crash occurs.

show abstract

“…Dynamic slicing [53][54][55] finds the statements that actually do influence a variable value in a particular execution. Relevant Slicing [56,57] is similar to dynamic slicing, but additionally finds statements that can potentially influence a variable value in an execution, if a predicate were to evaluate to a different outcome. All slicing-based approaches identify a subset of program statements that must be examined by a user to locate a bug.…”

Section: Related Workmentioning

confidence: 99%

Isolating bugs in multithreaded programs using execution suppression

et al. 2011

View full text Add to dashboard Cite

SUMMARYMemory-related program failures in multithreaded programs can be caused by a variety of bugs. Concurrency bugs can occur due to unexpected or incorrect thread interleavings during execution. Other kinds of memory bugs, such as buffer overflows and uninitialized reads, may also occur in multithreaded as well as single-threaded programs. Most prior techniques for isolating these bugs are specialized, addressing only one type of concurrency bug or certain types of other memory bugs. The memory corruption caused by these bugs can also undergo significant propagation during program execution. When a program failure finally occurs due to memory corruption, the true root cause of the failure may be effectively concealed as significant portions of memory may have become corrupted. We propose a general framework that can isolate the root cause of any failure in a multithreaded program that involves memory corruption and reveals at least a subset of this memory corruption. This includes three important types of concurrency bugs-data races, atomicity violations, and order violations-as well as other kinds of memory bugs. To account for propagation of memory corruption, our approach uses a dynamic technique called 'execution suppression' that iteratively reveals memory corruption in a failing execution to isolate the true root cause of the failure.

show abstract

Incremental regression testing

Cited by 180 publications

References 17 publications

Kỹ Thuật Kiểm Thử Hồi Qui Hiệu Quả Cho Phát Triển Ứng Dụng Di Động

Kỹ Thuật Kiểm Thử Hồi Qui Hiệu Quả Cho Phát Triển Ứng Dụng Di Động

Identifying the root causes of memory bugs using corrupted memory location suppression

Isolating bugs in multithreaded programs using execution suppression

Contact Info

Product

Resources

About