Please log in to watch this conference skillscast.
Designing interactions across systems can be complex. Microservices, actors, threads: anything involving communication or sharing can lead to complex state machines that are then hard to test and reason about. TLA+ is a formal specification language created by Leslie Lamport (Paxos, LaTeX, Turing award) to design, model and verify systems. With it you can help uncover latent edge cases in our design, as well as prevent deadlocks and race conditions. In this short talk Ruben will share with you how you can model a real system as a PlusCal (pseudocode-like language that can be machine-translated into TLA+) algorithm, and how it compares to roughly equivalent Akka code.
YOU MAY ALSO LIKE:
- Lightbend Akka for Scala - Professional (in London on 11th - 12th November 2019)
- Modern development with Java (in London on 9th - 11th December 2019)
- Scala eXchange London 2019 (in London on 12th - 13th December 2019)
- Scalax2gether Community Day 2019 (in London on 14th December 2019)
- Code Kata: Yilin Wei - Optics with Monocle (in London on 22nd October 2019)
- Don’t keep it to yourself - openness and honesty in the workplace (in London on 30th October 2019)
- Abstract Data Types In The Region Of Abysmal Pain, And How To Navigate Them (SkillsCast recorded in September 2019)
- The Last Frontier and Beyond (SkillsCast recorded in August 2019)
Lightning Talk: Formally Verifying Complex Systems Using TLA+
Ruben Berenguel is a senior big data engineer consultant and occasional contributor for Spark (especially PySpark). PhD in Mathematics, he moved to data engineering where he works mostly with Scala, Python and Go designing and implementing big data pipelines in London and Barcelona.