User menu

Accès à distance ? S'identifier sur le proxy UCLouvain

On unifying assumption commitment style proof rules for concurrency

Primary tabs

Xu, QW Cau, A Collette, P.

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

Document type Communication à un colloque (Conference Paper) – Présentation orale avec comité de sélection
Access type Accès restreint
Publication date 1994
Language Anglais
Conference "5th International Conference on Theory of Concurrency (CONCUR 94)", UPPSALA(Sweden) (Aug 22-25, 1994)
Journal information "Lecture Notes in Computer Science" - Vol. 836, p. 267-282 (1994)
Peer reviewed yes
issn 0302-9743
e-issn 1611-3349
Publisher Springer-verlag Berlin (Berlin 33)
Affiliation UCL - Autre
Links
Bibliographic reference Xu, QW ; Cau, A ; Collette, P.. On unifying assumption commitment style proof rules for concurrency.5th International Conference on Theory of Concurrency (CONCUR 94) (UPPSALA(Sweden), Aug 22-25, 1994). In: Lecture Notes in Computer Science, Vol. 836, p. 267-282 (1994)
Permanent URL http://hdl.handle.net/2078.1/62927