A methodology for designing proof rules for fair parallel programs (Q1377299): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: UNITY / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Countable nondeterminism and random assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair termination revisited - with delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ten Years of Hoare's Logic: A Survey—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining liveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Soundness and Completeness of an Axiom System for Program Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarded commands, nondeterminacy and formal derivation of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3906386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modalities for model checking: Branching time logic strikes back / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5584402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof rule for fair termination of guarded commands / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal verification of parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adequate proof principles for invariance and liveness properties of concurrent programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying properties of parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Liveness Properties of Concurrent Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3906397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3949052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(\mu\)-calculus as an assertion-language for fairness arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Incompleteness Result for Hoare's System / rank
 
Normal rank

Latest revision as of 10:36, 28 May 2024

scientific article
Language Label Description Also known as
English
A methodology for designing proof rules for fair parallel programs
scientific article

    Statements

    A methodology for designing proof rules for fair parallel programs (English)
    0 references
    0 references
    0 references
    11 June 1998
    0 references
    0 references
    formal semantics
    0 references
    program correctness
    0 references
    temporal logic
    0 references