No description available.

Diagnostic tests are designed to detect and isolate faults in sequential systems. The problem is to evaluate the effectiveness of the design. For stuck faults a diagnostic model can be used. A fault simulation strategy is presented for generating this model. First, definitions, for identifying critical inputs are derived. A definition is a statement of the conditions to sensitize an input. Then a fault free simulation is used to generate a critical value array. A critical path is traced through the sensitized inputs marked in the array using a critical value array tracing algorithm that is developed. This algorithm traces a path back in time, as required for a sequential system, to identify detectable faults for the model.

Test case generation in software testing is a process of developing a set of test data that satisfies a particular test adequacy criterion. It is desirable to automate this process since doing it manually is not only technically difficult but also tedious and time-consuming. Although there has been considerable research in automatic test case generation directed at imperative languages, we find no research exists addressing the problem for spreadsheet languages. This problem is particularly important for spreadsheet languages, since spreadsheet languages are widely used by end users and most of them lack testing backgrounds. To address this need, in this thesis, we present an automatic test case generation methodology for spreadsheet languages. Based on an analysis of the differences between imperative languages and spreadsheet languages, we developed our methodology by properly adapting existing test case generation techniques for imperative languages. Our methodology is integrated with a previously developed methodology for testing spreadsheets, and supports incremental automatic test case generation and visual feedback. We have conducted a family of empirical studies to assess the effectiveness and the efficiency of the essential techniques underlying our methodology. The results of our studies show that the test cases generated by our methodology can exercise a large percentage of a spreadsheet under test. The results also provide insights into the tradeoffs between two test case generation techniques for spreadsheet languages. / Graduation date: 2001

Indiana University-Purdue University Indianapolis (IUPUI) / The study of this thesis is focused on reducing the link failure detection time in OSPF network. When a link failure occurs, OSPF protocol detects it using RouterDeadInterval time. This timer is fired only after a predefined time interval, thus increasing the time of convergence after the link failure. There are previous studies to reduce the RouterDeadInterval time, but they introduce other effects which are discussed later in the thesis. So, a novel approach is proposed in this thesis to reduce the link failure detection time with the help of emerging network architecture Software Defined Networking (SDN) and OpenFlow Protocol.