TLC is the model checker that operates on TLA+ specs. TLAPS is a proof system. So, TLA+ has both.
Re:Learn TLA+ (2018)
by strangecasts on Sunday April 14, 2019 @09:35PM
(#19662705)
Yep :) Hence "most" - you can write deductive proofs with TLAPS, but most of the documentation and the community is devoted to model-checking.
In comparison, proof assistants take a deductive approach, requiring you to show - step by step - how the requirements are satisfied by the definition of the system. Dependently typed languages move some of that burden to the type system.