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:
- Modern development with Java (in London on 15th - 17th July 2019)
- Lightbend Scala Language - Professional (in London on 9th - 10th September 2019)
- Scala eXchange London 2019 (in London on 12th - 13th December 2019)
- Keynote by Dick Wall on Why API Design Matters, and Why Yours Sucks! (and mine sucks too!) (in London on 24th June 2019)
- London Java Community June (in London on 25th June 2019)
- The Elements of Tagless Final Style (SkillsCast recorded in May 2019)
- Scala 2.13 and Beyond! (SkillsCast recorded in April 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.