ACM Computing Surveys (CSUR)
A New Approach to Proving the Correctness of Multiprocess Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Communicating sequential processes
Communications of the ACM
Verifying properties of parallel programs: an axiomatic approach
Communications of the ACM
Monitors: an operating system structuring concept
Communications of the ACM
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Operating system principles
On the composition of processes
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The specification of process synchronization by path expressions
Operating Systems, Proceedings of an International Symposium
Consistency and correctness of duplicate database systems
SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
SEMANTICS OF COMMUNICATING PARALLEL PROCESSES
SEMANTICS OF COMMUNICATING PARALLEL PROCESSES
SYNCHRONIZATION MECHANISMS FOR MODULAR PROGRAMMING LANGUAGE
SYNCHRONIZATION MECHANISMS FOR MODULAR PROGRAMMING LANGUAGE
AUTOMATIC VERIFICATION OF SERIALIZES
AUTOMATIC VERIFICATION OF SERIALIZES
Specification and analysis of concurrency
Specification and analysis of concurrency
What it means for a concurrent program to satisfy a specification: why no one has specified priority
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Temporal ontology in natural language
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Localized representation and planning methods for parallel domains
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Localized representation and planning methods for parallel domains
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
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.