Microsoft Research Blog

English

  1. A Simple Approach to Specifying Concurrent Systems 

    January 1, 1989 | Leslie Lamport

    This is a "popular" account of the transition-axiom method that I introduced in [50]. To make the ideas more accessible, I wrote it in a question-answer style that I copied from the dialogues of Galileo. The writing in this paper may be the best I've…

  2. An Intelligent Shell for the Toroidal Pinch 

    January 1, 1989 | C. M. Bishop and Christopher Bishop

    Reversed field pinches are conventionally stabilised by surrounding the plasma with a thick metallic shell. This suppresses flux penetration but only for times shorter than the shell's resistive diffusion time. To improve on this we propose replacing the thick shell with an intelligent shell which…

  3. Games People Play 

    November 7, 1988 | Yuri Gurevich

    Buchi's approach to the determinacy of infinite games was original and not without a controversy. He resented determinacy proofs that did not live up to his standards of constructivity. We describe the infinite games in question, discuss the constructivity of determinacy proofs and comment on…

  4. Editable Graphical Histories 

    October 2, 1988 | David Kurlander and Steven Feiner

    Graphical interfaces typically provide their users with little idea of a session's history, except insofar as it is reflected in the current state of the sytem. If undo and redo commands are provided, they are often the only way to review the actions performed, cycling…

  5. Autonomy or interdependence in distributed systems 

    September 1, 1988 | Mike Schroeder

    You want your own processors and memory because 1) you want administrative control over its scheduling policy and 2) having your own makes it potentially more private. Having administrative control means you can optimize for low latency rather than high throughput and that you can…

  6. Stashing 

    September 1, 1988 | Andrew Birrell

    Why build a distributed system? Why not spend the same money and effort on a centralized system? There are several attractions to sticking with a centralized system. a) It's easier to build. It doesn't need much research to build powerful centralized systems. The technologies are…

  7. Generalized Secret Sharing and Monotone Functions 

    September 1, 1988 | Jerry Leichter and Josh Benaloh

    Secret Sharing from the perspective of threshold schemes has been well-studied over the past decade. Threshold schemes, however, can only handle a small fraction of the secret sharing functions which we may wish to form For example, if it is desirable to divide a secret…

  8. A Lattice-Structured Proof of a Minimum Spanning Tree Algorithm 

    August 8, 1988 | Jennifer Lundelius Welch, Leslie Lamport, and Nancy Lynch

    In 1983, Gallager, Humblet, and Spira published a distributed algorithm for computing a minimum spanning tree. For several years, I regarded it as a benchmark problem for verifying concurrent algorithms. A couple of times, I attempted to write an invariance proof, but the invariant became…

  9. An Empirical Comparison of Three Inference Methods 

    August 1, 1988 | David Heckerman

    In this paper, an empirical evaluation of three inference methods for uncertain reasoning is presented in the context of Pathfinder, a large expert system for the diagnosis of lymph-node pathology. The inference procedures evaluated are (1) Bayes' theorem, assuming evidence is conditionally independent given each…

  10. Another Position Paper on Fairness 

    July 8, 1988 | Fred B. Schneider and Leslie Lamport

    This is a more traditional response to Dijkstra's EWD 1013 (see [79]). We point out that Dijkstra's same argument can be applied to show that termination is a meaningless requirement because it can't be refuted by looking at a program for a finite length of…