Publication Date:
2019-06-28
Description:
A logic for reasoning about timing of concurrent programs is presented. The logic is based on proof outlines and can handle maximal parallelism as well as resource-constrained execution environments. The correctness proof for a mutual exclusion protocol that uses execution timings in a subtle way illustrates the logic in action.
Keywords:
COMPUTER SYSTEMS
Type:
NASA-CR-189500
,
NAS 1.26:189500
,
TR-91-1238
Format:
application/pdf
Permalink