News for hackers. Stuff that matters.
Re:Learn TLA+ (2018) by strangecasts on Sunday April 14, 2019 @07:16PM (#19662258)
Very broadly: model checkers (which most TLA+ users use) verify systems by induction, by enumerating possible states a system can take on, and showing that the none of the states violate the system requirements.

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.

Re:Learn TLA+ (2018) by duality on Sunday April 14, 2019 @09:26PM (#19662679)
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.