Liskov, B., et al. Argus Reference Manual . Technical Report MIT/LCS/TR-400, M.I.T. Laboratory for Computer Science, Cambridge, Ma., 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Persistent Shared Object Support in the Guide.. - Hagimont.. (1994) (Correct)
....in the same cluster reduces the location cost. Moreover, this solution has the advantage to reduce the size of object identifiers, since they only need to name objects that reside in the same cluster (a lot less than the whole universe ) This naming scheme is used in the Mneme [Moss90] Thor [Day92] and Amadeus [Cahill93b] projects with 32 bit local identifiers. However, this scheme has a serious drawback: two different local identifiers in two different clusters can point to the same object, and the same local identifier in two different clusters can point to different objects. Then, at ....
Mark Day, Barbara Liskov, Umesh Maheshwari and Andrew C. Myers, Naming and Locating Objects in Thor, Laboratory of Computer Science, MIT, 1992.
Functions, Frames, and Interactions - completing a.. - Reinke (1998) (Correct)
....by the set of operations defined on the data and the observable relationships between those operations . Liskov and Zilles [LZ74] coined the term abstract data type and introduced special modules, called operation clusters , to support programming with these types in the language CLU [Lis92] A cluster had three parts: a storage representation for objects of the new type in terms of existing types, a collection of procedures and a header defining which of these procedures could be called from outside of the cluster. Many programming languages designed in the 1970s provided explicit ....
.... today) The predominant factor in the development of language support for modular programming since 1980 has been the type system. The precursor in this direction probably was the introduction of abstract data types as special modules or, as Liskov put it in her account of the history of CLU [Lis92] I noticed that many of the modules discussed in the papers on modularity were defining data types . Combined with Zilles idea that a data type is completely characterized by the set of operations defined on the data (see above) this describes the atmosphere in which more radical approaches ....
Barbara Liskov. A History of CLU. Technical report, Laboratory for Computer Science, MIT, April 1992.
Programming Notations for Expressing Error Recovery in a.. - Issarny (1993) (1 citation) (Correct)
....developed. Recovery mechanisms for distributed programming languages have been paid much attention in the framework of transaction processing. As a well known example, the Argus language permits the programmer to make processes atomic in order to support applications that need consistent data [Liskov et al..87, Liskov88] An atomic process is called an action and is both serializable and recoverable. An action may either return an object through a normal return or return an exception and then abort. In Argus, atomicity is enforced by the objects shared among actions rather than by the individual ....
Liskov (B.), Day (M.), Herlihy (M.), Johnson (P.), G. Leavens (ed.), Scheifler (R.) and Weihl (W.). -- Argus Reference Manual. -- Research report MIT/LCS/TR-400, MIT. Laboratory for Computer Science, 1987.
Data Abstraction and Hierarchy - This Research Was Self-citation (Liskov) (Correct)
....simply pass the needed operations as procedure arguments, e.g. sort actually takes two arguments, the array, and the routine used to determine ordering. This method is general, but can be inconvenient. Methods that avoid the inconvenience in conjunction with the grouping approach exist in Argus [10] and Ada. In summary, when related types are discovered early in design, hierarchy is a good way to express the relationship. Otherwise, either the grouping approach (with suitable language support) or procedures as arguments may be better. 5.2. Multiple Implementations It is often useful to ....
Liskov, B., et al. Argus Reference Manual . Technical Report MIT/LCS/TR-400, M.I.T. Laboratory for Computer Science, Cambridge, Ma., 1987.
Code Importing Techniques for Fast, Safe Client/Server Access - Bank (1996) (Correct)
No context found.
Barbara Liskov, Dorothy Curtis, Mark Day, Sanjay Ghemawhat, Robert Gruber, Paul Johnson, and Andrew C. Myers. Theta reference manual. Technical Report 88, Laboratory for Computer Science, MIT, February 1994. Also available at http://www.pmg.lcs.mit.edu/papers/thetaref/.
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