Cited in
(18)- Extracting Symbolic Transitions from TLA$$^{+}$$+ Specifications
- Improving automation for higher-order proof steps
- Checking cache-coherence protocols with TLA\(^+\)
- Automatic verification of TLA\(^{ + }\) proof obligations with SMT solvers
- Fast Paxos
- A deductive approach towards reasoning about algebraic transition systems
- A high-level language for modeling algorithms and their properties
- Checking a Multithreaded Algorithm with + CAL
- IMITATOR
- TLC
- FOOL
- DiskPaxos
- Certification of an exact worst-case self-stabilization time
- TLA + Proofs
- How to write a 21\(^{\text{st}}\) century proof
- A case study on parametric verification of failure detectors
- Ivy
- scientific article; zbMATH DE number 1390334 (Why is no real title available?)
This page was built for software: TLAPS
