Multivalued Possibilities Mappings
| dc.contributor.author | Lynch, Nancy A. | en_US |
| dc.date.accessioned | 2023-03-29T14:33:41Z | |
| dc.date.available | 2023-03-29T14:33:41Z | |
| dc.date.issued | 1990-08 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149157 | |
| dc.description.abstract | Abrastraction mappings are one of the major tools used to construct correctness proofs for concurrent algorithms. Several examples are given of situations in which it is useful to allow the abstraction mappings to be multivalued. The examples involve algorithm optimization, algorithm distribution, and proofs of time bounds. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-422 | |
| dc.title | Multivalued Possibilities Mappings | en_US |
| dc.identifier.oclc | 22302982 |
