Guaranteed inconsistency avoidance during software evolution

  • Authors:

  • Keith Gallagher;Mark Harman;Sebastin Danicic

  • Affiliations:

  • Computer Science Department, Loyola College in Maryland, 4501 N. Charles Street, Baltimore, MD;Department of Information Systems and Computing, Brunel University, Uxbridge, Middlesex UB8 3PH, U.K.;Department of Mathematical and Computing Sciences, Goldsmiths College, University of London, New Cross, London SE14 6NW, U.K.

  • Venue:
  • Journal of Software Maintenance: Research and Practice
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

The attempt to design and integrate consistent changes to an existing system is the essence of software maintenance. Software developers also confront similar problems: there are changes during testing and the release of new system builds. Whether in development or maintenance, changes to evolving systems must be made consistently; that is, without damaging correct computations. It is difficult for the programmer to ascertain the complete effect of a code change; the programmer may make a change to a program that is syntactically and semantically legal, but which has ripples into the parts of the program that were intended to remain unchanged.Using the standard denotational semantics for procedural programming languages, this paper formalizes decomposition slicing, which identifies interferences between software components and isolates the components to be changed. We enumerate the conditions for changing one component in ways that will guarantee that changes to it will not interact inconsistently and prove that changes made under these conditions are sound. Thus, the programmer can then execute changes secure in the knowledge that the semantics of the new system are guaranteed to be consistent with the projection of the semantics of the original for which it behaved correctly. Validating that the changes do not interfere not only guarantees consistency with respect to previous unchanging behaviors, but can also be achieved with a complexity proportional to the size of the change to be made.