The PlusCal Algorithm Language
From MaRDI portal
Publication:3393398
DOI10.1007/978-3-642-03466-4_2zbMATH Open1250.68284DBLPconf/ictac/Lamport09OpenAlexW2153773928WikidataQ56686624 ScholiaQ56686624MaRDI QIDQ3393398FDOQ3393398
Authors: Leslie Lamport
Publication date: 20 August 2009
Published in: Theoretical Aspects of Computing - ICTAC 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03466-4_2
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of algorithms (68W01)
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
Uses Software
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)