Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Physical Sciences and Mathematics
Separate Computation Of Alias Information Fior Reuse, Mary Jean Harrold, Gregg Rothermel
Separate Computation Of Alias Information Fior Reuse, Mary Jean Harrold, Gregg Rothermel
School of Computing: Faculty Publications
Interprocedural data flow information IS useful for many software testing and analysis techniques, including data flow testing, regression testing, program slicing, and impact analysis. For programs with aliases, these testing and analysis techniques can yield invalid results, unless the data flow information accounts for aliasing effects. Recent research provides algorithms for performing interprocedural data flow analysis in the presence of aliases; however, these algorithms are expensive, and achieve precise results only on complete programs. This paper presents an algorithm for performing alias analysis on incomplete programs that lets individual software components such as library routines, subroutines, or subsystems be independently …
Analyzing Regression Test Selection Techniques, Gregg Rothermel, Mary Jean Harrold
Analyzing Regression Test Selection Techniques, Gregg Rothermel, Mary Jean Harrold
School of Computing: Faculty Publications
Regression testing is a necessary but expensive maintenance activity aimed at showing that code has not been adversely affected by changes. Regression test selection techniques reuse tests from an existing test suite to test a modified program. Many regression test selection techniques have been proposed; however, it is difficult to compare and evaluate these techniques because they have different goals. This paper outlines the issues relevant to regression test selection techniques, and uses these issues as the basis for a framework within which to evaluate the techniques. We illustrate the application of our framework by using it to evaluate existing …
Elimination Of All-Optical Cycles In Wavelength-Routed Optical Networks, Jason Iness, Byrav Ramamurthy, Biswanath Mukherjee, Krishna Bala
Elimination Of All-Optical Cycles In Wavelength-Routed Optical Networks, Jason Iness, Byrav Ramamurthy, Biswanath Mukherjee, Krishna Bala
School of Computing: Faculty Publications
A transparent (wide-area) wavelength-routed optical network may be constructed by using wavelength cross-connect switches connected together by fiber to form an arbitrary mesh structure. The network is accessed through electronic stations that are attached to some of these cross-connects. These wavelength cross-connect switches have the property that they may configure themselves into unspecified states. Each input port of a switch is always connected to some output port of the switch whether or not such a connection is required for the purpose of information transfer. Due to the presence of these unspecified states, there exists the possibility of setting up unintended …
Improving Circuit Testability By Clock Control, Kent L. Einspahr, Sharad C. Seth, Vishwani D. Agrawal
Improving Circuit Testability By Clock Control, Kent L. Einspahr, Sharad C. Seth, Vishwani D. Agrawal
CSE Conference and Workshop Papers
The testability of a sequential circuit can be improved by controlling the clocks of individual storage elements during testing. We propose several clock control strategies derived from an analysis of the circuit, its S-graph structure, and its function. Through examples we show how the number of clocks affects the circuit’s testability. It is shown that if certain flip-flops (FFs) are scanned (or otherwise initialized), the remaining FFs can be controlled and initialized to any arbitrary state using the clock control. We derive a controllability graph and use it to assign clocks to FFs and to schedule the clocks to set …