Greg Nelson, editor. Systems Programming with Modula-3. Prentic Hall, -1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....most recompilations by examining finer levels of dependency relations between interfaces and implementations. In their methods, if the interface file a module depends on changes, but the set of symbols the module imports does not change, then the module does not need to be recompiled. SRC Modnla 3 [22, 14] implements exactly the same idea: a version stamp which encodes the specification of a symbol is produced for each exported symbol in an interface; modules import the version stamps of the symbols that they import; a module only needs to be recompiled if any of its imported version stamps are no ....

Greg Nelson, editor. Systems programming with Modula-3. Prentice Hall, Englewood Chffs, N J, 1991.

....time in transit. 7.3.4 Data Representation Bit wise Packing Many integer values passed to remote objects will have a limited range of valid values, usually considerably smaller than that provided by the standard integer types. If integer range annotations of the type supported by Modula 3 [46] are supplied in an interface s definition then the IDL compiler can pack values with smaller ranges more tightly within messages. boolean values, for example, are equivalent to unsigned long[0. 1] values, and can be packed into a single bit each. Eight boolean values could therefore be marshalled ....

Greg Nelson, editor. Systems Programming with Modula-3. Innovative Technology. Prentice Hall, 1991.

....mail address: rwh cs.cmu.edu. # Electronic mail address: mdl cs.cmu.edu. 0 programming idioms; the language may be easily restricted to second class modules found in ML like languages. 1 Introduction Modularity is an essential technique for developing and maintaining large software systems [46, 24, 36]. Most modern programming languages provide some form of module system that supports the construction of large systems from a collection of separately defined program units [7, 8, 26, 32] A fundamental problem is the management of the tension between the need to treat the components of a large ....

Greg Nelson, editor. Systems Programming with Modula-3. Prentice-Hall, Englewood Cli#s, NJ, 1991.

....In particular, I wish to show that a functional language such as Scheme is an excellent tool for systems programming. Many of the linguistic points I will make are well known to the members of the systems programming community that employ modern programming languages, such as DEC SRC s Modula 3 [Nelson] In this respect, I will merely be serving to recast these ideas in a different perspective, and perhaps diffuse them more widely. The rest of this paper is divided into four parts: # In part one, I will motivate the design of scsh (section 2) and then give a brief tutorial on the system (3, ....

Greg Nelson, ed. Systems Programming with Modula-3. Prentice Hall, Englewood Cliffs, New Jersey, 1991.

....language itself. This is a criterion to which I give the name security. C. A. R. Hoare, 1973. 13] One of the most pleasant things about ML is that it is safe: programs cannot corrupt the runtime system so that further execution of the program is not faithful to the language semantics. Nelson [32] divides programming languages into three geneological categories: The BCPL family, including C and C , which are not safe; the Algol family, including Pascal and Ada, which are almost safe; and the 1 Thanks to the Modula 3 manual [32] for this phrasing mathematically derived family, ....

....program is not faithful to the language semantics. Nelson [32] divides programming languages into three geneological categories: The BCPL family, including C and C , which are not safe; the Algol family, including Pascal and Ada, which are almost safe; and the 1 Thanks to the Modula 3 manual [32] for this phrasing mathematically derived family, including Lisp, ML, Smalltalk, and CLU, which are safe except when Lisp programmers disable runtime type checking because it s too expensive. There are, of course, languages such as FORTRAN and COBOL that do not fall into these categories. ....

[Article contains additional citation context not shown here]

Greg Nelson, editor. Systems Programming with Modula-3. Prentice Hall, Englewood Cliffs, NJ, 1991.

....end of the 1970s as a new way that people might effectively and joyfully use computing power [Goldberg83] In Smalltalk 80 this is realized in a pure class based object oriented programming language [Krasner84] 1 . Unlike impure object oriented languages (such as C [Stroustrup97] Modula3 [Nelson, editor91] or Java [Gosling97a] all computation is notionally performed by dynamic method invocation or equivalently, in the terminology of Smalltalk, by message send operations. This includes simple arithmetic operations such as integer addition and also control flow operations on objects ....

....bytecode operations (such as direct access to memory locations) may only be used in un checked code because their use cannot generally be verified. There are mechanisms to control how un verified code may come to be executed on a particular instance of the clr. Previous systems, such as Modula 3 [Nelson, editor91] have provided similar facilities to allow a single language to be used to write both safe and unsafe portions of an application. A further innovation of the Microsoft Intermediate Language (il) compared with Java bytecode, is the introduction of hints from the il generator to subsequent ....

[Article contains additional citation context not shown here]

Greg Nelson, editor. Systems Programming with Modula-3. Prentice-Hall, 1991. (pp 11, 22, 29)

....in more detail in the backstage section on sharing. Still, the X sharing engine that we ve chosen is acceptable to our users. We are exploring window system level sharing for Windows NT[9] Toolkit based replication The window applications that we write at SRC use Trestle[17] a Modula 3 based[20], window system independent, objectoriented toolkit, currently implemented on top of X[26] and Windows NT. Trestle was designed to make it easy for applications to handle screen layout, and to facilitate teleportation. Because more of the program semantics are available at the toolkit level than ....

Greg Nelson (Ed.). Systems Programming with Modula--3. Prentice Hall, Englewood Cliffs, NJ, 1991.

....that is spoken by both analyses, and this may be of help when trying to identify similarities and di erences. 4. TOOLS THAT USE TYPE BASED ANALYSIS We now survey some of the tools that successfully use type based analysis. The tools work on programs written in C [17] Java [23] Modula 3 [11, 45], and Standard ML [39] 4.1 Method Inlining In an object oriented program we may have a virtual call site e:m( If a static analysis can determine a conservative approximation of the set of methods that can be invoked, then a compiler may be able to inline the call. One of the fundamental ....

Greg Nelson. Systems Programming with Modula-3. Prentice Hall, 1991.

....its exception system makes it easier to build robust applications; garbage collection prevents memory leaks, making it easier to write long running programs; and language level thread support makes it easier to write multi threaded programs. Java shares all of these attributes with Modula 3 [15], which has been our systems programming language of choice up until now. By sampling the hardware performance counters of the Alpha processor, we discovered that our system spends 63 of its cycles in the runtime or in native methods, and in fact 50 in the Unix kernel. We conclude that for ....

Greg Nelson (editor). Systems Programming with Modula-3. Prentice Hall, 1991.

....use. It is therefore no surprise that even though C and C do not mandate GC as part of the language definition, many C and C programmers are now using it either for reclaiming memory or for leak detection. It is also no surprise that many newer programming languages (e.g. Java [14] Modula 3 [21], SML [20] require garbage collection. This increased popularity of garbage collection makes it more important than ever to fully understand the tradeoffs between different garbage collection alternatives. 0 This work was supported by NSF ITR grant CCR 0085792. Any opinions, findings and ....

Greg Nelson, editor. Systems Programming with Modula-3. Prentice Hall, New Jersey, 1991.

....connecting it to the Back End, and then terminates. The Back End, noticing that its incoming communication channel has been closed, then terminates as well. 6. 2 The Second Implementation The second implementation of the Cube system consists of a single program, written entirely in Modula 3 [60]. We chose this language, as it is almost as efficient as C, but at the same time offers a rich set of features that make development much easier. Modula 3 is an offspring of Modula 2. It offers modules, object oriented features, generics (known as templates in C ) exceptions, preemptive ....

Greg Nelson, editor. Systems Programming with Modula-3. Prentice-Hall, 1991.

....formal proofs in all these stages. Larch [GH93] is a system consisting of several axiomatic specification languages. One group of languages is designed for the specification of interfaces between program components. Such interface languages exist for example for C (LCL [GH91] and Modula 3 (LM3 [Nel91] Then there is the language LSL, the Larch Shared Language which all interface languages have in common. It is independent from any programming language and intended to specify the meaning of the interface languages given in the interface specifications. The Larch Prover, LP, serves as a proof ....

Greg Nelson, editor. Systems Programming with Modula-3. Prentice Hall, 1991.

.... of method signature refinement: a type may compatibly modify the argument and return types of a method derived from its supertypes, in accordance with the usual subtyping rules [Car84] This feature is regrettably missing from other statically compiled languages like C or Modula 3 [Nel91] The technique described here allows a class to refine superclass method signatures yet retain fast method dispatch. The bidirectional object layout has been implemented for the programming language Theta [DGLM95, LCD 94, Mye94] a separately compiled, staticallytyped language which separates ....

Greg Nelson, editor. Systems Programming with Modula-3. Prentice-Hall, 1991.

....information hiding in the way our units do was Mesa [38] with its definition modules and implementation modules. The Mesa designers appear to have been influenced by Parnas s classic paper on decomposing systems into modules [46] Mesa in turn influenced Modula [50] Modula 2 [51] Modula 3 [44], Oberon 2 [40] and Ada [4] Ernst, Hookway, and Ogden have studied the problem of specifying Modula 2 programs where the objects of a module may share some global state [12] These authors share our concern for modular verification, but the possible scopes they consider are not rich enough to ....

Greg Nelson, editor. Systems Programming with Modula-3. Series in Innovative Technology. Prentice-Hall, Englewood Cliffs, NJ, 1991.

No context found.

Greg Nelson, editor. Systems Programming with Modula-3. Prentic Hall, -1991.

No context found.

Greg Nelson. Systems Programming with Modula 3. Prentice Hall, 1991. ISBN: 0-13-5904641.

No context found.

Greg Nelson (Editor). Systems Programming with Modula-3. Prentice-Hall, 1991.

No context found.

Greg Nelson, editor. Systems Programming with Modula-3. Prentice Hall, 1991.

No context found.

Greg Nelson, editor. Systems Programming with Modula-3. Prentice Hall, New Jersey, 1991.

No context found.

Greg Nelson, editor. Systems Programming with Modula-3. Prentice Hall, New Jersey, 1991.

No context found.

Greg Nelson, editor. Systems Programming with Modula-3. Prentice Hall, 1991.

No context found.

Greg Nelson. Systems Programming with Modula-3. Prentice Hall, Englewood Cli#s, New Jersey, 1991. 49

No context found.

Greg Nelson, editor. Systems Programming with Modula-3. Prentice Hall, New Jersey, 1991.

No context found.

Greg Nelson. Systems Programming with Modula-3. Prentice-Hall, 1991.

No context found.

Greg Nelson (Editor): Systems Programming with Modula-3. Prentice Hall. 1991. ISBN 0-13-590464-1.

First 50 documents  Next 50

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