Reasoning about object-oriented programs that use subtypes

  • Authors:
  • Gary T. Leavens;William E. Weihl

  • Affiliations:
  • Department of Computer Science, Iowa State University, Ames, Iowa;Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Mass.

  • Venue:
  • OOPSLA/ECOOP '90 Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

Programmers informally reason about object-oriented programs by using subtype relationships to classify the behavior of objects of different types and by letting supertypes stand for all their subtypes. We describe formal specification and verification techniques for such programs that mimic these informal ideas. Our techniques are modular and extend standard techniques for reasoning about programs that use abstract data types. Semantic restrictions on subtype relationships guarantee the soundness of these techniques.