A proof technique for communicating sequential processes (Q1153686): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof System for Communicating Sequential Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deadlock absence proofs for networks of communicating processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs of Networks of Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3871899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment and Procedure Call Proof Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communicating sequential processes / rank
 
Normal rank

Latest revision as of 11:34, 13 June 2024

scientific article
Language Label Description Also known as
English
A proof technique for communicating sequential processes
scientific article

    Statements

    A proof technique for communicating sequential processes (English)
    0 references
    0 references
    0 references
    1981
    0 references
    communicating sequential processes
    0 references
    proof rules
    0 references
    total correctness
    0 references
    deadlock
    0 references

    Identifiers