Mark Lillibridge. Personal communication. July 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....easily be overlooked by someone modifying the code. Additionally, it is possible that an administrator could reconfigure BIND to use a value for the server version string large enough to make the code unsafe. The BIND developers agreed that a bounds check should be inserted to eliminate this risk [Andrews01]. BIND uses extensive run time bounds checking. This type of defensive programming is important for writing secure programs, but does not guarantee that a program is secure. LCLint detected a known buffer overflow in a function that used run time checking but specified buffer sizes incorrectly. ....

Mark Andrews. Personal communication, May 2001.

....relevant to the way programming languages should be designed and implemented. Two of Greg s students, Karl Crary and Stephanie Weirich, contributed greatly to the theoretical aspects of this work (specifically Chapters 5 and 6) and in the process taught me a lot about the area. Insup Lee and Mark Segal provided excellent suggestions drawing from their own research experience in dynamic updating. Working in the Distributed Systems Lab has been a wonderful experience, both personally and professionally. I have made so many friends, each of whom contributed in iii varying levels to this work ....

....in the running process. In addition, depending on how the state is encoded and transferred, restarting the program with that state can be overly time consuming; for example, when state information is stored incrementally in a log format, the entire log must be replayed to regenerate the state [Seg] While application specific state encoding and decoding to transfer state can get the job done, we would prefer to use a more general purpose approach, ignoring points 1 and 2, focusing on the truly application specific task of state transformation. That is, we prefer to assume that all state ....

[Article contains additional citation context not shown here]

Mark Segal. Personal communication.

.... 5 currently requires a minimum of 66 ms to render two low resolution images [Ellsworth92] Tracker latencies vary widely; our optical ceiling tracker [Ward92] typically has 20 30 ms lag, whereas the Polhemus Isotrack and Ascension Bird trackers average about 55 ms and 85 ms respectively [Mine92]. And even if the graphics engine runs at 60 Hz, there is a minimum 16 ms scanout delay for the video signal alone, irrespective of the image being drawn. Since the end to end system latency is the sum of the all of these latencies, plus any communication delays, all reasonably powerful augmented ....

Mine, Mark. Personal communication, March 1992.

....corresponds to the undefined value bot in Rec f, defined by bot = bot. The strictness pragma in the definition of Rec f is not currently permitted in Gofer. However, a number of Haskell implementations permit such constraints in datatype definitions (e.g. 2] as will future releases of Gofer [18]. Consider a simple datatype of arithmetic expressions, built out of numbers and binary addition: data Expr = Num Int Add Expr Expr To express this datatype as the fixed point of a functor, we first define a functor E which captures the recursive structure of arithmetic expressions: data E ....

Mark Jones. Personal communication, May 1994.

.... s destination. HTML The Hypertext markup language, used in the World Wide Web project. See markup language. hypermedia Hypermedia is similar to hypertext but includes media other than text, e.g. a hypermedia document could include text and graphics, or sound and animation. Mark Bernstein [Ber97] has pointed out that, in practice, many hypertext documents have some graphical content (just as ordinary texts often include illustrations) The distinction between hypertext and hypermedia is so blurry that some authors call them both hypertext. hypertext Text which does not form a single ....

Mark Bernstein. Personal communication. e-mail, 3 February 1997.

....all keys into the same address space (typically a one dimensional array) Bernstein s method is to compare the dot product of vectors thus generated from two passages. The higher the magnitude of the product the greater the similarity. He also normalizes the results with respect to passage length [Ber93] 2.2.5 Related work Automatic methods of text categorization [Lew92] concept identification [PJ93] and text analysis based on models of text structure [OLB 92] 4 The authors do not supply a definition of text tokens . 12 may be used to generate hypertext links between related parts of ....

Mark Bernstein. Personal communication. e-mail, 8 June 1993. 110

....(if any) and was on the verge of releasing it. In either case it is safe to free the spin lock. Boris Lubachevsky and Mark Dilman have used a verification tool to generate an independent, mechanized proof of correctness for the case where only two processes are attempting to acquire the spin lock [DL94] 7 Extensions The correctness of our algorithm depends on an a limited assumption of progress on the part of processes. It is conceivable that this will not be the case, and some process will not make progress during this system provided code, yet will not die and be cleaned up either. For ....

....instruction must be available for the architecture in question. For SPARC processors, we have used a call to test and set on a dummy variable. Other architectures may have an explicit fence instruction. Our implementation incorporates several optimizations, including one suggested by Mark Dilman [DL94] where the acquisition code first checks if the spin lock is busy and, if so does not even set the wants pointer. Other possible optimizations were discussed in Section 6. We tested the performance of our implementation against operating system semaphores and against spin locks without the ....

Mark Dilman and Boris Lubachevsky. Personal communication, 1994.

.... framework (e.g. Simonis and Dincbas, 1993 ] In particular, CLP systems where binary decision diagrams themselves have been used to represent Boolean constraints have proved to be effective for a wide range of problems, including encouraging preliminary results for the quasigroup ones [ Wallace, 1993 ] However, a comparison of the two methods described here and such others is beyond the scope and main intentions of this paper (see Section 5 for more on related work) 2 Ordered Binary Decision Diagrams Ordered Binary Decision Diagrams (hereafter referred to as obdds) were introduced by ....

Mark Wallace. Personal communication. ECRC, Munich, Germany, July 1993.

....1. Anti aliased line segments. square s corners are those corresponding to the corners of the texture image. This method has the advantage that any point shape may be accommodated simply by varying the texture image. A similar technique can be used to draw anti aliased, line segments of any width[Gro90] The texture image is a filtered circle as used above. Instead of a line segment, a texture mapped rectangle, whose width is the desired line width, is drawn centered on and aligned with the line segment. If line segments with round ends are desired, these can be added by drawing an additional ....

Mark Grossman. Personal Communication, 1990.

....many of the fault types in Section 3. 1 were inspired by the major error categories from [Sullivan91] and [Lee93a] However, these studies do not provide data on how often system crashes corrupt the file cache, which may have different failure characteristics than randomly accessed data structures [Sullivan95]. Software fault injection is a popular technique for evaluating the behavior of prototype systems in the presence of hardware and software faults. See [Iyer95] for an excellent introduction to the overall area and a summary of much of the past work on fault injection, such as FINE [Kao93] FIAT ....

Mark Sullivan, December 1995. personal communication.

....provide a technique for identifying mechanically what formulas must be proved to determine the exact effects of change. This approach proved impractical because the formulas to be proved were in an undecidable theory, causing this problem to be no easier than the verification problem in general [20]. Inscape embodies a similar conceptual framework, but attempts to overcome the practical shortcomings of Moriconi s approach by a number of restrictions that are discussed subsequently in this paper. 1.1 Problems Addressed Inscape addresses two fundamental problems in building software ....

Mark S. Moriconi. Personal communication.

No context found.

Mark Lillibridge. Personal communication. July 1991.

No context found.

Mark Verber. Personal communication. TellMe Networks, Inc., 2003.

No context found.

Mark Wegman. Personal communication, 2002.

No context found.

Sarita Adve and Mark Hill. Personal communication. March 1990.

No context found.

740-0218. Swinson, Mark. 2001. Personal Communication. Former acting Director, DARPA ITO,

No context found.

Freudenberger, Mark Schoonmaker. 1994a. Personal communication.

No context found.

Mark Holland and Rachad Youssef. Personal communication, October 1994.

No context found.

Mine, Mark. 1995. Personal communication.

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