conference paper · ACM Symposium on Principles of Distributed Computing (PODC) · 1983
GEM: A tool for concurrency specification and verification
Amy L. Lansky, Susan S. Owicki
Cited by 8Open access
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.
Cite this paper
Lansky, A. L., & Owicki, S. S. (1983). GEM: A tool for concurrency specification and verification. ACM Symposium on Principles of Distributed Computing (PODC), 198–212. https://doi.org/10.1145/800221.806722
Lansky, Amy L., and Susan S. Owicki. “GEM: A tool for concurrency specification and verification.” ACM Symposium on Principles of Distributed Computing (PODC), 1983, pp. 198–212, https://doi.org/10.1145/800221.806722.
Lansky, Amy L., and Susan S. Owicki. 1983. “GEM: A tool for concurrency specification and verification.” ACM Symposium on Principles of Distributed Computing (PODC): 198–212. https://doi.org/10.1145/800221.806722.
Lansky, A.L. and Owicki, S.S. (1983) ‘GEM: A tool for concurrency specification and verification’, ACM Symposium on Principles of Distributed Computing (PODC), pp. 198–212. Available at: https://doi.org/10.1145/800221.806722.
@article{lansky1983tool,
title = {{GEM: A tool for concurrency specification and verification}},
author = {Lansky, Amy L. and Owicki, Susan S.},
journal = {ACM Symposium on Principles of Distributed Computing (PODC)},
pages = {198--212},
year = {1983},
doi = {10.1145/800221.806722}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Verification and design aspects of "true concurrency"
David Mizell · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 1978
Cited by 1Open access
Workshop on Partial Order Methods in Verification
Doron Peled, Vaughan Pratt, Gerard J. Holzmann · 1996
Cited by 4
Modeling Concurrent Behaviors as Words
Yohan Boichut, Jean‐Michel Couvreur, Xavier Ferry et al. · Lecture notes in computer science · 2019
Cited by 0
The geometry of semaphore programs
Scott D. Carson, Paul F. Reynolds · ACM Transactions on Programming Languages and Systems · 1987
Cited by 38Open access
Verification of Concurrent Programs. Part I. The Temporal Framework,
Zohar Manna, Amir Pnueli · Defense Technical Information Center (DTIC) · 1981
Cited by 325
Concurrency model and its application to formal protocol specifications
M.C. Kim, Samuel T. Chanson, Son T. Vuong · IEEE Conference on Computer Communications (INFOCOM) · 2002
Cited by 6