LCS Technical Memos (1974 - 2003): Recent submissions

Now showing items 181-183 of 486

    • Communication Effects for Message-based Concurrency 

      Jouvelot, Pierre; Gifford, David K. (1989-02)
      We describe a new framework for explicity concurrency that uses an effect system to describe the communication behavior of expressions in a typed polymorphic programming language. Concurrency occurs between processes ...

    • Natural Random Numbers 

      Gofford, David K. (1988-09)
      We present a method for generaing random numbers from natural noise sources that is able to produce random numbers to any desired level of perfection. The method works by transducing a physical noise source to generate a ...

    • A Lattice-structured Proof Technique Applied to a Minimum Spanning Tree Algorithm 

      Welch, Jennifer Lundelius; Lamport, Leslie; Lynch, Nancy A. (1988-06)
      Higly-optimized concurrent algorithms are often hard to prove correct because they have no natural decomposition into separately provable parts. This paper presents a proof technique for the modular verification of such ...