TLAPS

swMATH9528MaRDI QIDQ21509FDOQ21509

Author name not available (Why is that?)

Cited In (13)

• A deductive approach towards reasoning about algebraic transition systems
• Improving automation for higher-order proof steps
• How to write a 21\(^{\text{st}}\) century proof
• Checking cache-coherence protocols with TLA\(^+\)
• A case study on parametric verification of failure detectors
• A high-level language for modeling algorithms and their properties
• Extracting Symbolic Transitions from TLA$$^{+}$$+ Specifications
• Title not available (Why is that?)
• Fast Paxos
• Certification of an exact worst-case self-stabilization time
• Automatic verification of TLA\(^{ + }\) proof obligations with SMT solvers
• Checking a Multithreaded Algorithm with  + CAL
• TLA +  Proofs

This page was built for software: TLAPS