2 ms·
From a brief overview of the paper, TLA is a language for proving "good" and "bad" properties for an abstract system. For instance, you can use it to prove that
by mmastrac 13y ago
From a brief overview of the paper, TLA is a language for proving "good" and "bad" properties for an abstract system. For instance, you can use it to prove that an algorithm completes within N seconds, or that an algorithm never reaches a certain unsafe state.
There are examples of using this to prove correctness of distributed algorithms such as Paxos:
http://research.microsoft.com/en-us/um/people/lamport/tla/byzpaxos.html http://research.microsoft.com/en-us/um/people/lamport/tla/by...
http://research.microsoft.com/en-us/um/people/lamport/tla/Consensus.tla http://research.microsoft.com/en-us/um/people/lamport/tla/Co...