On unifying assumption commitment style proof rules for concurrency

Xu, QW;Cau, A;Collette, P.
(1994) 5th International Conference on Theory of Concurrency (CONCUR 94) — Location: UPPSALA(Sweden) (22.August.1994)

Files

pdfdocument.pdf
  • Restricted Access
  • Adobe PDF
  • 767.93 KB
No access

Details

Authors
  • Xu, QW
    Author
  • Cau, A
    Author
  • Collette, P.
    Author
Abstract
Assumption-Commitment paradigms for specification and verification of concurrent programs have been proposed in the past. We show that two typical parallel composition rules for shared variable and message passing programs [8, 12] which hitherto required different formulations are instances of one general rule mainly inspired by Abadi & Lamport's composition theorem [1].
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Xu, Q., Cau, A., & Collette, P. (1994). On unifying assumption commitment style proof rules for concurrency. Lecture Notes in Computer Science, 836, 267-282. https://doi.org/10.1007/BFb0015014 (Original work published 1994)