Verifying the correctness of distributed systems via mergeable parallelism

DOI10.1007/978-3-030-91265-9_7zbMath1498.68079OpenAlexW3217179414MaRDI QIDQ2154028

Xingtao Ren, Qing Wang, Teng Long, Chao Wang

Publication date: 13 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-91265-9_7

zbMATH Keywords

distributed systemsasynchronousmessage-passing programsHoare triplesmergeable parallelism

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Paxos consensus, deconstructed and abstracted
• Proof Spaces for Unbounded Parallelism
• Parameterized Verification of Asynchronous Shared-Memory Systems
• Refinement of Trace Abstraction
• Proving Liveness of Parameterized Programs
• A calculus of atomic actions
• Dynamic partial-order reduction for model checking software
• A Shared Memory Computer Display System
• On the completeness of verifying message passing programs under bounded asynchrony
• Layered concurrent programs

This page was built for publication: Verifying the correctness of distributed systems via mergeable parallelism