On the Frame Problem in Procedure Specifications

  • Authors:
  • Alex Borgida;John Mylopoulos;Raymond Reiter

  • Affiliations:
  • -;-;-

  • Venue:
  • IEEE Transactions on Software Engineering
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paper provides examples of situations where formal specifications of procedures in the standard pre/postcondition style become lengthy, cumbersome and difficult to change, a problem which is particularly acute in the case of object-oriented specifications with inheritance. We identify the problem as the inability to express that a procedure changes only those things it has to, leaving everything else unmodified, and review some attempts at dealing with this 驴frame problem驴 in the Software Specification community. The second part of the paper adapts a recent proposal for a solution to the frame problem in Artificial Intelligence驴the notion of explanation closure axioms驴to provide an approach whereby one can state such conditions succinctly and modularly, with the added advantage of having the specifier be reminded of things that she may have omitted saying in procedure specifications. Since this approach is based on standard Predicate Logic, its semantics is relatively straight-forward. The paper also suggests an algorithm which generates syntactically the explanation closure axioms from the pre/postcondition specifications, provided they are written in a restricted language; it also suggests a model theory supporting it.