3 ms·
Just in case you are wondering what it is: http://research.microsoft.com/en-us/um/people/lamport/tla/tla-intro.html http://research.microsoft.com/en-us/um/peop
by mmastrac 13y ago
Just in case you are wondering what it is:
http://research.microsoft.com/en-us/um/people/lamport/tla/tla-intro.html http://research.microsoft.com/en-us/um/people/lamport/tla/tl...
"TLA stands for the Temporal Logic of Actions, but it has become a shorthand for referring to the TLA+ specification language and the PlusCal algorithm language, together with their associated tools."
"TLA+ is based on the idea that the best way to describe things formally is with simple mathematics, and that a specification language should contain as little as possible beyond what is needed to write simple mathematics precisely. TLA+ is especially well suited for writing high-level specifications of concurrent and distributed systems."
and
http://research.microsoft.com/pubs/64074/lamport-actions.pdf http://research.microsoft.com/pubs/64074/lamport-actions.pdf
"The temporal logic of actions (TLA) is a logic for specifying and reasoning about concurrent
systems. Systems and their properties are represented in the same logic, so the assertion that
a system meets its specification and the assertion that one system implements another are both
expressed by logical implication. TLA is very simple; its syntax and complete formal semantics are
summarized in about a page. Yet, TLA is not just a logician’s toy; it is extremely powerful, both
in principle and in practice. This report introduces TLA and describes how it is used to specify
and verify concurrent algorithms. The use of TLA to specify and reason about open systems will
be described elsewhere."
- ForHackernews 13y agoNone of that helps me understand what it is. It's a programming language?
- mmastrac 13y agoFrom 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...