Gary Leavens. Verifying Object-Oriented Prograsm That Use Subtypes. Technical Report 439, MIT Lab. for Computer Science, February, 1989. Ph.D. thesis. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Behavioral Notion of Subtyping - Liskov, Wing (1994) (84 citations) (Correct)
....mutators nor the preservation of history properties. Therefore, they allow certain subtype relations that we forbid (e.g. intset could be a subtype of fat set in these approaches) The emphasis on semantics of abstract types is a prominent feature of the work by Leavens. In his Ph.D. thesis Leavens [1989] defines types in terms of algebras and subtyping in terms of a simulation relation between them. His simulation relations are a more general form of our abstraction functions. However, for most practical purposes, abstraction functions are adequate (compared to relations) and have the advantage ....
Leavens, G. 1989. Verifying object-oriented prograsm that use subtypes. Technical Report 439 (Feb.), MIT Laboratory for Computer Science. Ph.D. thesis.
Family Values: A Behavioral Notion of Subtyping - Liskov, Wing (1994) (1 citation) (Correct)
....extra mutators nor the preservation of history properties. Therefore, they allow certain subtype relations that we forbid (e.g. intset could be a subtype of fat set in these approaches) The emphasis on semantics of abstract types is a prominent feature of the work by Leavens. In his Ph.D. thesis [21] Leavens defines types in terms of algebras and subtyping in terms of a simulation relation between them. The work by Bruce and Wegner [4] is similar; like Leavens, they base their work on algebras. Leavens considered only immutable types. Dhara [10, 11, 23] extends Leavens thesis work to deal ....
Gary Leavens. Verifying object-oriented prograsm that use subtypes. Technical Report 439, MIT Lab. for Computer Science, February 1989. Ph.D. thesis.
Behavioral Subtyping Using Invariants and Constraints - Liskov, Wing (1999) (3 citations) (Correct)
....be explained in terms of existing behavior, through existing methods. We believe the use of constraints is simpler and easier to reason about than this explanation approach. The emphasis on semantics of abstract types is a prominent feature of the work by Leavens. In his Ph.D. thesis Leavens [Lea89] defines types in terms of algebras and subtyping in terms of a simulation relation between them. His simulation relations are a more general form of our abstraction functions. Leavens considered only immutable types. Dhara [Dha92, DL92, LD92] extends Leavens thesis work to deal with mutable ....
Leavens, G. Verifying object-oriented prograsm that use subtypes. Technical Report 439, MIT Laboratory for Computer Science, February 1989. Ph.D. thesis.
Family Values: A Semantic Notion of Subtyping - Barbara Liskov And (1992) (5 citations) (Correct)
No context found.
Gary Leavens. Verifying Object-Oriented Prograsm That Use Subtypes. Technical Report 439, MIT Lab. for Computer Science, February, 1989. Ph.D. thesis.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC