Date: 04 Jun 2005

Multivalued possibilities mappings

* Final gross prices may vary according to local VAT.

Get Access


Abstraction 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.

This work was supported by ONR contract N0014-85-K-0168, by NSF contract CCR-8611442, and by DARPA contract N00014-83-K-0125.