Debugging hardware designs using dynamic dependency graphs

TL;DR: A new, more efficient architecture for an effective assertion miner has been developed based on the study in this work, which analyzes assertion miners which are template based and dynamic dependency graph based, respectively.

TL;DR: This paper formally defines the problem of mining latency guarantees and presents a pragmatic approach to mine symbolic conditions that guarantee a latency requirement and uses the approach to infer the optimal transfer conditions for a bus bridge and an SPI-connection in less than a minute using only up to 5,000 clock cycles of simulation data.

TL;DR: Categorization of various source code dependencies is proposed, which can be useful for organizing dependencies based on the applications and also focuses on their computation methodologies and application.

TL;DR: The theory accommodates diagnostic reasoning in a wide variety of practical settings, including digital and analogue circuits, medicine, and database updates, and reveals close connections between diagnostic reasoning and nonmonotonic reasoning.

TL;DR: The delta debugging algorithm generalizes and simplifies the failing test case to a minimal test case that still produces the failure, and isolates the difference between a passing and a failingTest case.

TL;DR: A dynamic program slice is an executable subset of the original program that produces the same computations on a subset of selected variables and inputs that can be handled more precisely and the size of slice can be significantly reduced, leading to a finer localization of the fault.

TL;DR: A method for performing fault localization using similar program spectra and a generic method for establishing the quality of a report, based on the way an "ideal user" would navigate the program using the report to save effort during debugging.