Dynamic software updating (DSU) systems patch programs on the fly without incurring downtime. To avoid failures due to the updating process itself, many DSU systems employ timing restrictions. However, timing restrictions are theoretically imperfect, and their practical effectiveness is an open question.

This paper presents the first significant empirical evaluation of three popular timing restrictions: activeness safety (AS), which prevents updates to active functions; con-freeness safety (CFS), which only allows modifications to active functions when doing so is provably type-safe; and manual identification of the event-handling loops during which an update may occur.

We evaluated these timing restrictions using a series of DSU patches to three programs: OpenSSH, vsftpd, and ngIRCd. We systematically applied updates at each distinct update point reached during execution of a suite of system tests for these programs to determine which updates pass and which fail. We found that all three timing restrictions prevented most failures, but only manual identification allowed none. Further, although CFS and AS allowed many more update points, manual identification still supported updates with minimal delay. Finally, we found that manual identification required the least developer effort. Overall, we conclude that manual identification is most effective.

[ DOI | .pdf ]

@article{hayden12testing-journal,
  author = {Christopher M. Hayden and Edward K. Smith and Eric A. Hardisty and Michael Hicks and Jeffrey S. Foster},
  title = {Evaluating Dynamic Software Update Safety Using Efficient Systematic Testing},
  journal = {IEEE Transactions on Software Engineering},
  volume = {38},
  number = {6},
  pages = {1340--1354},
  year = 2012,
  month = dec,
  note = {Accepted September 2011},
  doi = {http://doi.ieeecomputersociety.org/10.1109/TSE.2011.101}
}

This file was generated by bibtex2html 1.99.