We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

Multivalued Possibilities Mappings

Thumbnail Image
Download
Name

MIT-LCS-TM-422.pdf

Size

7.39 MB

Format

Adobe PDF

Checksum (MD5)

d32b8df98a61cbf07756426a696d774c

Author(s)
Lynch, Nancy A.
Date Issued
August 1990
Series/Report no.
MIT-LCS-TM-422
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.