Formal constraints on memory management for composite overloaded operations

  • Authors:

  • Damian W. I. Rouson;Xiaofeng Xu;Karla Morris

  • Affiliations:

  • US Naval Research Laboratory, 4555 Overlook Ave. SW, Washington, DC 20375, USA. Tel.: +1 202 767 6965/ Fax: +1 815 572 8203/ E-mail: damian.rouson@nrl.navy.mil;Department of Fire Protection Engineering, University of Maryland, College Park, MD 20742, USA. Tel.: +1 301 405 3990/ Fax: +1 301 405 9383/ E-mail: xxf@umd.edu;-

  • Venue:
  • Scientific Programming
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The memory management rules for abstract data type calculus presented by Rouson, Morris & Xu [15] are recast as formal statements in the Object Constraint Language (OCL) and applied to the design of a thermal energy equation solver. One set of constraints eliminates memory leaks observed in composite overloaded expressions with three current Fortran 95/2003 compilers. A second set of constraints ensures economical memory recycling. The constraints are preconditions, postconditions and invariants on overloaded operators and the objects they receive and return. It is demonstrated that systematic run-time assertion checking inspired by the formal constraints facilitated the pinpointing of an exceptionally hard-to-reproduce compiler bug. It is further demonstrated that the interplay between OCL's modeling capabilities and Fortran's programming capabilities led to a conceptual breakthrough that greatly improved the readability of our code by facilitating operator overloading. The advantages and disadvantages of our memory management rules are discussed in light of other published solutions [11,19]. Finally, it is demonstrated that the run-time assertion checking has a negligible impact on performance.