Leavens, G. T. and Dhara, K. K. 1992. A foundation for the model theory of abstract data types with mutation and aliasing (preliminary version). Technical Report 92-35 (Nov.), Department of Computer Science, Iowa State University, Ames, Iowa.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....advantage that we can freely use equality in assertions. The work by Bruce and Wegner [1990] is similar; like Leavens, they base their work on algebras, but like us, they use coercion functions with the substitution property. Leavens considered only immutable types. Dhara [Dhara 1992; Dhara and Leavens 1992; Leavens and Dhara 1992] extends Leavens thesis work to deal with mutable types, but rules out the cases where extra methods cause problems; the rules are defined just for individual programs that have no aliasing between objects of related types, and therefore state changes caused by a ....

....we can freely use equality in assertions. The work by Bruce and Wegner [1990] is similar; like Leavens, they base their work on algebras, but like us, they use coercion functions with the substitution property. Leavens considered only immutable types. Dhara [Dhara 1992; Dhara and Leavens 1992; Leavens and Dhara 1992] extends Leavens thesis work to deal with mutable types, but rules out the cases where extra methods cause problems; the rules are defined just for individual programs that have no aliasing between objects of related types, and therefore state changes caused by a subtype s extra methods cannot be ....

[Article contains additional citation context not shown here]

Leavens, G. T. and Dhara, K. K. 1992. A foundation for the model theory of abstract data types with mutation and aliasing (preliminary version). Technical Report 92-35 (Nov.), Department of Computer Science, Iowa State University, Ames, Iowa.

....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 with mutable types, but rules out the cases where extra methods cause problems; the rules are defined just for individual programs that have no aliasing between objects of related types, and therefore state changes caused by a subtype s extra methods cannot be ....

Gary T. Leavens and Krishna Kishore Dhara. A foundation for the model theory of abstract data types with mutation and aliasing (preliminary version). Technical Report 92-35, Department of Computer Science, Iowa State University, Ames, Iowa, November 1992.

....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 types, but rules out the cases where extra methods cause problems, e.g. aliasing. Because of their restrictions they allow some subtype relations to hold where we do not. For example, they allow mutable pairs to be a subtype of immutable pairs ....

Leavens, G. T. and Dhara, K. K. A foundation for the model theory of abstract data types with mutation and aliasing (preliminary version). Technical Report 92-35, Department of Computer Science, Iowa State University, Ames, Iowa, November 1992.

....in real OO Programming Languages has became an important discussion and research issue in the field. Some interesting theoretical studies appeared treating the formal characterization of the subtype relation and subtype relation preserving refinement calculi.Examples of these are the works [LW90, LD92, LW93, UR93]. Strictly related to this work we can find [Ier92, Coo92] On the more practical aspects of the field however, programming languages seem not to be evolving at the same rate and only few wors are worth to mention. Sather[Omo93] is a promising OO language that already supports the two distinct ....

Gary T. Leavens and Krishna K. Dhara. A foundation for the model theory of abstract data types with mutation and aliasing. Technical Report 92-35, Iowa State University, 1992.

....methods that behave differently; thus, finer subtyping distinctions can be made when behavioral information is used in addition to signature information. The inclusion of the type constraint is what distinguishes the Liskov and Wing work from all others (e.g. America [1] Cusack [3] Leavens [4, 7]) that also include some kind of behavioral information. To foreshadow what is coming in the next section: Not only must a supertype s type invariant and methods be preserved by the subtype s, but so must its type constraint. The type constraint is intended to capture certain kinds of properties ....

Gary T. Leavens and Krishna Kishore Dhara. A foundation for the model theory of abstract data types with mutation and aliasing (preliminary version). Technical Report 92-35, Department of Computer Science, Iowa State University, Ames, Iowa, November 1992.

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