Paper Info
Title
GEM: A tool for concurrency specification and verification
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.
Year
DOI
Venue
1983
10.1145/800221.806722
PODC
Keywords
Field
DocType
concurrency specification,possible gem computation,partial ordering.,events,logic formula,concurrency problem,event-oriented method,gem computation,code segment,gem model,verification,concurrent computation,particular concurrent execution,language primitive,specification,concurrency,partial order,availability
Concurrent computation,Synchronization,Programming language,Computer science,Concurrency,Computation,Language primitive
Conference
ISBN
Citations 
PageRank 
0-89791-110-5
5
5.80
References 
Authors
16
2
Name
Order
Citations
PageRank
amy l lansky1494184.77
susan2909419.46