Paper Info
Title
Reasoning about object-oriented programs that use subtypes
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.
Year
DOI
Venue
1990
10.1145/97945.97970
OOPSLA/ECOOP
Keywords
Field
DocType
semantic restriction,informal idea,standard technique,use subtypes,formal specification,subtype relationship,object-oriented program,abstract data type,different type,verification technique,subtype,verification,polymorphism,object oriented programming,modularity,specification,message passing
Abstract data type,Programming language,Object-oriented programming,Type checking,Computer science,Theoretical computer science,Formal specification,Soundness,Modular design,Modularity,Message passing
Conference
Volume
Issue
ISSN
25
10
0362-1340
ISBN
Citations 
PageRank 
0-89791-411-2
40
9.78
References 
Authors
13
2
Name
Order
Citations
PageRank
Gary T. Leavens12593211.29
William E. Weihl22614903.11