DocumentCode
2877408
Title
A theory of conjunction and concurrency
Author
Hoare, C.A.R.
Author_Institution
Comput. Lab., Oxford Univ., UK
fYear
1990
fDate
7-9 Mar 1990
Firstpage
304
Lastpage
309
Abstract
Some general conditions under which the specification of a concurrent system can be expressed as the conjunction of specifications for its component processes are explored. A lattice-theoretic fixed-point theorem about increasing functions is proved, and examples of its application in several areas of computing science are given. Some consequences are drawn for the design of concurrent algorithms, high-level programming languages, and fine-grained concurrent computer architectures
Keywords
computer architecture; concurrency control; high level languages; parallel programming; programming theory; component processes; concurrency; concurrent algorithms; conjunction; fine-grained concurrent computer architectures; high-level programming languages; lattice-theoretic fixed-point theorem; specification; Algorithm design and analysis; Assembly; Computer architecture; Computer languages; Concurrent computing; Design engineering; Equations; Hardware; Laboratories; Software design;
fLanguage
English
Publisher
ieee
Conference_Titel
Databases, Parallel Architectures and Their Applications,. PARBASE-90, International Conference on
Conference_Location
Miami Beach, FL
Print_ISBN
0-8186-2035-8
Type
conf
DOI
10.1109/PARBSE.1990.77155
Filename
77155
Link To Document