LCS Publications: Recent submissions

Now showing items 265-267 of 1152

    • A Process Algebraic View of I/O Automata 

      Segala, Roberto (1992-06)
      The Input/Output Automata formalism of Lynch and Tuttle is a widely used framework for the specification and verification of concurrent algorithms. Unfortunately, it has never been provided with an algebraic characterization, ...

    • Concurrent Timestamping Made Simple 

      Gawlick, Rainer (1992-09)
      Concurrent Timestamp Systems (CTSS) allow processes to temporally order concurrent events in an asynchronous shared memory system. Bounded memory constructions of a CTSS are extremely powerful tools for concurrency control, ...

    • Compiler-directed Storage Reclamation Using Object Lifetime Analysis 

      Hicks, James Edward, Jr. (1992-11)
      Many heap-oriented languages such as Lisp and Id depend on run-time garbage collection to reclaim storage. Garbage collection can be a significant run-time expense, especially for functional languages that tend to allocate ...