The following pages link to TLAPS (Q21509):
Displaying 13 items.
- How to write a 21\(^{\text{st}}\) century proof (Q692371) (← links)
- Improving automation for higher-order proof steps (Q831930) (← links)
- A deductive approach towards reasoning about algebraic transition systems (Q1666122) (← links)
- Checking cache-coherence protocols with TLA\(^+\) (Q1870224) (← links)
- Fast Paxos (Q1954195) (← links)
- Certification of an exact worst-case self-stabilization time (Q2680867) (← links)
- Automatic Verification of TLA + Proof Obligations with SMT Solvers (Q2891459) (← links)
- A High-Level Language for Modeling Algorithms and Their Properties (Q2999308) (← links)
- Checking a Multithreaded Algorithm with + CAL (Q3524302) (← links)
- TLA + Proofs (Q4647839) (← links)
- (Q4934623) (← links)
- Extracting Symbolic Transitions from TLA$$^{+}$$+ Specifications (Q5881447) (← links)
- A case study on parametric verification of failure detectors (Q5883746) (← links)