The PlusCal Algorithm Language
From MaRDI portal
Publication:3393398
Recommendations
Cited in
(13)- Specifying reversibility with \(\mathrm{TLA}^+\)
- Byzantizing Paxos by refinement
- A high-level language for modeling algorithms and their properties
- A modular framework for verifying versatile distributed systems
- scientific article; zbMATH DE number 7453977 (Why is no real title available?)
- scientific article; zbMATH DE number 3881852 (Why is no real title available?)
- Tutorial on parameterized model checking of fault-tolerant distributed algorithms
- On the diversity of asynchronous communication
- The assignment problem
- Tasks in modular proofs of concurrent algorithms
- The mailbox problem
- Proving a non-blocking algorithm for process renaming with TLA\textsuperscript{+}
- Validating mathematical theorems and algorithms with RISCAL
This page was built for publication: The PlusCal Algorithm Language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3393398)