An algorithm for computing links

  • Authors:
  • Cong-Cong Xing

  • Affiliations:
  • Nicholls State University, Thibodaux, LA

  • Venue:
  • Proceedings of the 44th annual Southeast regional conference
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Object type graphs (OTG) [5] are a new typing scheme for objects. It redefines object types by adding object component interdependencies (links) into object type representations. As such, it can prevent, by a more rigorous type-checking, program runtime errors that cannot be avoided under conventional object type systems. Unfortunately, links, as a key concept in the notion of OTG, have not been fully understood in the sense that it is unclear how to compute them. This paper addresses the links issue in the following way: (1) present an initial link computation algorithm; (2) illustrate how this algorithm works by providing some computation examples; (3) carry out a time complexity analysis of this algorithm.