Also In This Section
  • Topics

  • Recent Posts

  • Faculty Candidate Vidhya Nagaraju to Present Lecture March 20

    The College of Computing invites the campus community to a lecture by faculty candidate Vidhyashree Nagaraju on Friday, March 20, 2020, at 3:00 p.m. The title of Nagaraju’s talk is “Software Reliability Engineering: Algorithms and Tools.”

    The lecture will be presented online through a Zoom meeting. Link to the meeting here.

    Vidhyashree Nagaraju is a Ph.D. candidate in the Department of Electrical and Computer Engineering at the University of Massachusetts Dartmouth (UMassD), where she received a M.S. in Computer Engineering in 2015. She received a B.E. in electronics and communication engineering from Visvesvaraya Technological University, India, in 2011.

    While there are many software reliability models, there are relatively few tools to automatically apply these models. Moreover, these tools are over two decades old and are difficult or impossible to configure on modern operating systems, even with a virtual machine. To overcome this technology gap, Nagaraju is developing an open source software reliability tool for the software and system engineering community. 

    A key challenge posed by such a project is the stability of the underlying model fitting algorithms, which must ensure that the parameter estimates of a model are indeed those that best characterize the data. If such model fitting is not achieved, users who lack knowledge of the underlying mathematics may inadvertently use inaccurate predictions. This is potentially dangerous if the model underestimates important measures such as the number of faults remaining or overestimates the mean time to failure (MTTF).

    To improve the robustness of the model fitting process, expectation conditional maximization (ECM) algorithms have been developed to compute the maximum likelihood estimates of nonhomogeneous Poisson process (NHPP) software reliability models. Nagaraju ‘s talk will present an implicit ECM algorithm, which eliminates computationally intensive integration from the update rules of the ECM algorithm, thereby achieving a speedup of between 200 and 400 times that of explicit ECM algorithms. The enhanced performance and stability of these algorithms will ultimately benefit the software.

    Download

    Comments Closed