BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CSL-TR-83-251
       ENTRY:: November 08, 1994
ORGANIZATION:: Stanford University, Computer Systems Laboratory
       TITLE:: GEM: A TOOL FOR CONCURRENCY SPECIFICATION AND VERIFICATION
        TYPE:: Technical Report
      AUTHOR:: Lansky, Amy
      AUTHOR:: Owicki, Susan
        DATE:: November 1983
       PAGES:: 16
    ABSTRACT:: The GEM model of concurrent computation is presented. Each
               GEM computation consists of a set of partially ordered
               events, and represents a particular concurrent execution.
               Language primitives for concurrency, code segments, as well
               as concurrency problems may be described as logic formulae
               (restrictions) on the domain of possible GEM computations. An
               event-oriented method of program verification is also
               presented. GEM is unique in its ability to easily describe
               and reason about synchronization properties.
       NOTES:: [Adminitrivia V1/Prg/19941108]
         END:: STAN//CSL-TR-83-251