Parallel Programming: an Axiomatic Approach. AIM-219
Abstract/Contents
- Abstract
This paper develops some ideas expounded in [1]. It distinguishes a
number of ways of using parallelism, including disjoint processes,
competition, cooperation, communication and "colluding". In each
case an axiomatic proof rule is given. Some light is thrown on traps
or ON conditions. Warning: the program structuring methods described
here are not suitable for the construction of operating systems.
Description
| Type of resource | text |
|---|---|
| Form | memorandums |
| Extent | 1 text file |
| Place | Stanford (Calif.) |
| Date created | October 1973 |
| Language | English |
| Digital origin | reformatted digital |
Creators/Contributors
| Author | Hoare, C. A. R. |
|---|
Subjects
| Subject | Stanford Artificial Intelligence Laboratory |
|---|---|
| Subject | Memo (Stanford Artificial Intelligence Laboratory) |
| Subject | Artificial intelligence |
| Genre | Memorandums |
Bibliographic information
| Finding Aid | |
|---|---|
| Memo | AIM-219 |
| Location | https://purl.stanford.edu/st301gt1653 |
| Location | SC1041 |
| Repository | Stanford University. Libraries. Department of Special Collections and University Archives |
Access conditions
- Use and reproduction
- The materials are open for research use and may be used freely for non-commercial purposes with an attribution. For commercial permission requests, please contact the Stanford University Archives (universityarchives@stanford.edu).
- Copyright
- Copyright © The Board of Trustees of the Leland Stanford Junior University. All rights reserved.
Collection
Stanford Artificial Intelligence Laboratory records, 1963-2009
View other items in this collection in SearchWorksAlso listed in
Loading usage metrics...