[PDF] Top 20 SRC RR 6 pdf

... CFS uses a form of symbolic links between le names, an idea introduced in CTSS [6] and developed in Multics [1], to make it inexpensive to give a local name to a remote le. CFS forms an attachment between a local ... See full document

... Our study is intended as a formal basis for parts of a security architecture, and for the Digital Distributed Systems Security Architecture (DSSA) in particular [11]; this architecture is currently under implementation. ... See full document

... Experience gained since shared-memory mutual exclusion algorithms were first studied seems to indicate that the early solutions were judged by criteria that are not relevant in practice. A great deal of effort went into ... See full document

... The trie memory scheme is inefficient for small memories, but it be- comes increasingly efficient in using available storage space as memory size increases. The attractive features of the scheme are these: 1) The ... See full document

... Garbage collection originated in the Lisp environment [9] and most applications of garbage collection have been in Lisp or in Lisp-like environments such as Smalltalk [6]. Garbage collection can greatly simplify ... See full document

... [6] R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovasz and C. Racko, \Random walks, universal traversal sequences, and the complexity of maze problems," Proceedings of the 20th IEEE Symposium on Foundations of ... See full document

... In this paper, we describe a range of public-key smart-card authentica- tion protocols, with dierent compromises between cost and security. The protocols were developed in the context of the Digital Distributed System ... See full document

... With the first implementation of Autopilot, reconfiguration took about 5 seconds in our 30-switch service network. The 30 switches are arranged as an approximate 4 x 8 torus, with a maximum switch-to-switch distance of ... See full document

... In [8], Lipton proved a reduction theorem similar to ours for reasoning about partial correctness and deadlock-freedom properties of nondistributed pro- grams, concentrating on programs that use semaphores. His result ... See full document

... The claims allowed in Larch specifications are undecidable in the general case, so it is impossible to build a tool that will automatically certify an arbitrary specification. However, it is feasible to build tools that ... See full document

... Open procedure, 23 open2, 6 open-file object, see file Close procedure, 30 creating, 23 defined, 14 File type, 21 OpenControlTerminal procedure, 26 OpenDir procedure, 5, 21, 38 OpenFlags[r] ... See full document

... Theorem 7 The algorithm stConn runs in time O . m 2 log 5 n = p / using space O . p / . Proof: Choosing a random set of p vertices according to the stationary distribution can be done in O . m / steps using O . p log n / ... See full document

... Thus far, we have used win to reason about statements with an unspecified grain of atomicity. In our final example, we use sin to replace behavioral reasoning with assertional reasoning. The example may seem contrived, ... See full document

... DEC has a strong commitment to communicating the results and experience gained through pursuing these activities. The Company values the improved understanding that comes with exposing and testing our ideas within the ... See full document

... imports employee; constant int eref_maxPrintSize = employee_maxPrintSize + 27; abstract type employee ref eref; uses sprinteref, char[]; int eref_sprintchar s[], eref er { requires maxIn[r] ... See full document

... 4.3 Soundness and Completeness of the Algorithm We now show that the subtyping algorithm described in the previous section is sound and complete with respect to the infinite-tree interpr[r] ... See full document

... SRC began recruiting its rst research scientists in l984|their charter, to advance the state of knowledge in all aspects of computer systems research. Our current work includes exploring high-performance personal ... See full document

... DEC has a strong commitment to communicating the results and experience gained through pursuing these activities. The Company values the improved understanding that comes with exposing and testing our ideas within the ... See full document

... To restrict attention to the computations that start from the expected initial states, we de ne the predicate Init: Init = lS ^ lR A computation satis es Init ^ 2[N ] if it is a computat[r] ... See full document

... DEC's business and technology objectives require a strong research program. The Systems Research Center (SRC) and three other research laboratories are committed to filling that need. SRC began recruiting ... See full document