NASA NTRS · 19920004491
Putting time into proof outlines
Abstract
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.
Keep this discovery
Explore connections, maps & timelines
Schneider, Fred B., Bloom, Bard, Marzullo, Keith. 1991-09-01. Putting time into proof outlines. https://ntrs.nasa.gov/citations/19920004491
Cite the original work for its findings. Save a collection to share your selection of sources.