B. Liskov, Russell Atkinson, Toby Bloom, Eliot Moss, J. Craig Schaffert, Robert Scheifler, and Alan Snyder. The CLU Reference Manual. Springer-Verlag, Berlin, 1981. Lecture Notes in Computer Science 114.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Languages, Dynamic Linking, Shared Libraries, Recursive Modules 1. INTRODUCTION Module interconnection languages (MILs) are recognized as an essential tool in managing the complexity of increasingly vast software systems. Languages such as CLU, Mesa, Cedar, Ada, Modula 2 and Modula 3 [Liskov et al. 1981; Lampson 1983; Rovner 1986; Ichbiach et al. 1979; Intermetrics 1995; Nelson 1991] have demonstrated the usefulness of module interconnection languages for organizing software in the large. There has also been more formal work on the design and semantics of MILs [Harper et al. 1990; Harper and ....

....a stream of bytes into a DLL at some point requires a runtime type check that the library provides the interface expected by the application. In recognition of this, dynamic typing is generally provided in statically typed distributed programming languages [Nelson 1991; Birtwistle et al. 1979; Liskov et al. 1981; Lampson 1983; Cardelli 1986; Rovner 1986] Dynamics have been proposed as a general language independent mechanism for incorporating dynamic typing into a statically typed language, based on an explicit type dynamic for dynamically typed values [Abadi et al. 1991] If e is a value with type A, ....

Liskov, B., Atkinson, R., Bloom, T., Moss, E., Schaffert, J. C., Scheifler, R., and Snyder, A. 1981. CLU Reference Manual. Lecture Notes in Computer Science. Springer-Verlag.

....detected are usually restricted to criteria such as bounds checking and erroneous type usage; they do not support complex consistency definitions (e.g. well formedness, up to date requirements, etc. Responses to potential violations are usually limited to raising an exception exception (e.g. [57, 29]) In addition, programming languages typically support only 7 Note that because Pleiades employs an abstract data type model, it is only possible to modify the state of an object, and thus to violate an enforced constraint, by invoking an operation on the object or one of its subcomponents. 8 ....

....satisfaction of sets of constraints. preclusion semantics they will prevent consistency violations from occurring, but they do not support rollforward or roll backward semantics without programmer intervention. Assertion (e.g. 42, 32] and exception handling mechanisms (as in Ada [57] and CLU [29]) are specialized consistency management mechanisms that have been associated with some programming languages. Assertions are intended to describe invariant conditions of a running program and to specify actions to be taken upon detecting a violation of an invariant. Assertions are often used as ....

B. Liskov, R. Atkinson, T. Bloom, E. Moss, C. Schaffert, B. Schiefler, and A. Snyder. Lecture Notes in Computer Science, Vol. 114, chapter CLU Reference Manual. Springer--Verlag, 1981.

....of access to object variables. In many languages, such as for example Smalltalk[GR83] or Eiffel[Mey92] in a given object definition, say X , there can only be access to variables of a single instance of X (namely the variables of the current object) whereas in other languages, such as CLU[Lis81] or C [Str87] for example, in X there can be access to variables of all instances of X . 38 For reasons of simplicity, in A1 we use the first policy. 34 See. e.g. Par71, Par72, LG86, Mey88] 35 The earliest such language was Simula 67[DN66, DH72] 36 cf. e.g. BDMN73, GR83, Mey88, ....

Barbara Liskov. CLU Reference Manual. Lecture Notes in Computer Science, 114, 1981.

....form of dynamic (run time) typing has been proposed for statically typed languages. Modula 3 (Nelson 1991) in particular contains interesting facilities for dynamic typing, benefiting from experience with languages such as Simula 67, CLU, Cedar Mesa, Amber, and Modula 2 (Birtwistle et al. 1979; Liskov et al. 1981; Lampson 1983; Cardelli 1986; Rovner 1986) Traced pointer values may be widened to type REFANY, the type of all traced pointers, under the language s subtyping rules. Modula 3 provides a TYPECASE statement, which allows for run time branching based on the type of a value: PROCEDURE Print (X ....

Liskov, B., R. Atkinson, T. Bloom, E. Moss, J. C. Schaffert, R. Scheifler, and A. Snyder (1981). CLU Reference Manual. Lecture Notes in Computer Science. Springer-Verlag.

....our previous examples, the first step in specifying an object is to provide a trait defining the object s values. This trait provides the sort that replaces E in the atomic object trait, defining the sort of values kept by the atomic object. Argus s built in atomic array data type is like the CLU [Liskov et al. 81] array data type with the additional guarantee of (dynamic) atomicity. A CLU array is a variable length array with arbitrary bounds. In addition to the normal fetch operations, an item can be appended to an array, increasing its length by one. Similarly, the last item can be removed, shrinking ....

Liskov, B. et al. CLU reference manual. Lecture Notes in Computer Science. Number 114. Edited by In Goos and Hartmanis. Springer-Verlag, New York, 1981.

.... but the set of violations that can be detected are restricted to such criteria as bounds checking and erroneous type usage; they do not support complex consistency definitions (e.g. well formedness and up to date) Assertion (e.g. 30, 22, 25] and exception handling mechanisms (e.g. Ada, CLU [19], and Java) are specialized consistency management mechanisms provided by some languages. Assertions describe invariant conditions of a running program and specify actions to be taken upon detecting violations of invariants. They are embedded within the operations in which they should be checked; ....

B. Liskov, et. al. Lecture Notes in Computer Science, volume 114, chapter CLU Reference Manual. SpringerVerlag, 1981.

.... careful reasoning and to ease maintenance, a data structure s implementation may be encapsulated [Parnas71, Parnas72, Liskov Zilles 74] But previous multi method languages do not provide the same support for encapsulation as abstract data type based languages such as CLU [Liskov et al. 77, Liskov et al. 81] or singly dispatched object oriented languages such as C and even Smalltalk. In ADT based or singly dispatched languages, direct access to an object s representation can be limited to a statically determined region of the program. An earlier approach to encapsulation in Cecil suffered from the ....

Barbara Liskov, Russell Atkinson, Toby Bloom, Eliot Moss, J. Craig Schaffert, Robert Scheifler, and Alan Snyder. CLU Reference Manual. Lecture Notes in Computer Science, volume 114, Springer-Verlag, New York, NY, 1981.

.... careful reasoning and to ease maintenance, a data structure s implementation may be encapsulated [Parnas71, Parnas72, Liskov Zilles 74] But previous multi method languages do not provide the same support for encapsulation as abstract data type based languages such as CLU [Liskov et al. 77, Liskov et al. 81] or singly dispatched object oriented languages such as C and even Smalltalk. In ADT based or singly dispatched languages, direct access to an object s representation can be limited to a statically determined region of the program. An earlier approach to encapsulation in Cecil suffered from the ....

Barbara Liskov, Russell Atkinson, Toby Bloom, Eliot Moss, J. Craig Schaffert, Robert Scheifler, and Alan Snyder. CLU Reference Manual. Lecture Notes in Computer Science, volume 114, Springer-Verlag, New York, NY, 1981.

.... careful reasoning and to ease maintenance, a data structure s implementation may be encapsulated [Parnas71, Parnas72, Liskov Zilles 74] But existing multi method languages do not provide the same support for encapsulation as abstract data type based languages such as CLU [Liskov et al. 77, Liskov et al. 81] or singly dispatched object oriented languages such as C and even Smalltalk. In ADT based or singly dispatched languages, direct access to an object s representation can be limited to a statically determined region of the program. An earlier approach to encapsulation in Cecil suffered from the ....

Barbara Liskov, Russell Atkinson, Toby Bloom, Eliot Moss, J. Craig Schaffert, Robert Scheifler, and Alan Snyder. CLU Reference Manual. Lecture Notes in Computer Science, volume 114, Springer-Verlag, New York, NY, 1981.

....works for every type of argument, and a length function which maps a list of arbitrary element type into its integer length. It is also possible to write a generic sorting package that works on any type with an ordering relation. Other languages that used or helped develop these ideas include CLU [Liskov 81] Russell [Demers 79, Hook 84] Hope [Burstall 80] Ponder [Fairbairn 82] and Poly [Matthews 85] Finally, we should mention generic procedures of the kind found in Ada, which are parametrized templates that must be instantiated with actual parameter values before they can be used. The 7 ....

B.H.Liskov: CLU Reference Manual, Lecture Notes in Computer Science, 114, SpringerVerlag, 1981.

....(counter mode encryption) are standard. Algorithm pad is used only to de ne OMAC. Algorithm OMAC [9] is a pseudorandom function (PRF) that is a one key variant of the algorithm XCBC [8] Algorithm OMAC is like OMAC but takes an extra argument, the integer t. This algorithm is a tweakable PRF [15], tweaked in the most simple way possible. We explain the notation used in the de nition of OMAC. The value of iL (line 40: i an integer in f2; 4g and L 2 f0; 1g ) is the n bit string that is obtained by multiplying L by the n bit string that represents the number i. The multiplication is done ....

M. Liskov, R. Rivest, and D. Wagner. Advances in Cryptology { CRYPTO '02, Lecture Notes in Computer Science, vol. 2442, pp. 31-46. Springer-Verlag, 2002. See www.cs.berkeley.edu/daw

No context found.

B. Liskov, Russell Atkinson, Toby Bloom, Eliot Moss, J. Craig Schaffert, Robert Scheifler, and Alan Snyder. The CLU Reference Manual. Springer-Verlag, Berlin, 1981. Lecture Notes in Computer Science 114.

No context found.

B. Liskov, R. Atkinson, T. Bloom, E. Moss, J. C. Schaffert, R. Scheifler, and A. Snyder. CLU Reference Manual. Lecture Notes in Computer Science. Springer-Verlag, 1981.

No context found.

B. Liskov, Russell Atkinson, Toby Bloom, Eliot Moss, J. Craig Schaffert, Robert Scheifler, and Alan Snyder. The CLU Reference Manual. Springer-Verlag, Berlin, 1981. Lecture Notes in Computer Science 114.

No context found.

B. Liskov, R. Atkinson, T. Bloom, E. Moss, J.C. Schaffert, R. Scheifler, A. Snyder, Lecture Notes in Computer Science, Vol. 114; CLU Reference Manual, Springer. Verlag, New York, 1981.

No context found.

Barbara Liskov, Russell Atkinson, Toby Bloom, Eliot Moss, J. Craig Schaffert, Robert Schei er, and Alan Snyder. CLU Reference Manual, Lecture Notes in Computer Science 114. Springer-Verlag, 1981.

No context found.

Liskov, B.H., CLU Reference Manual. Lecture Notes in Computer Science 114. Springer-Verlag. 1981.

No context found.

Liskov, B.H., CLU Reference Manual. Lecture Notes in Computer Science 114. Springer-Verlag. 1981.

No context found.

B. Liskov, CLU Reference Manual, Lecture Notes in Computer Science 114, Springer-Verlag, 1981.

No context found.

B. Liskov, CLU Reference Manual, Lecture Notes in Computer Science 114, Springer-Verlag, 1981.

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