Specification and Verification with the TLA+ Trifecta: TLC, Apalache, and TLAPS

11/14/2022
by   Igor Konnov, et al.
0

Using an algorithm due to Safra for distributed termination detection as a running example, we present the main tools for verifying specifications written in TLA+. Examining their complementary strengths and weaknesses, we suggest a workflow that supports different types of analysis and that can be adapted to the desired degree of confidence.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/15/2020

Verified Rust Monitors for Lola Specifications

The safety of cyber-physical systems rests on the correctness of their m...
research
04/23/2021

Decision Tree Learning in CEGIS-Based Termination Analysis

We present a novel decision tree-based synthesis algorithm of ranking fu...
research
08/08/2018

On the Monitoring of Decentralized Specifications Semantics, Properties, Analysis, and Simulation

We define two complementary approaches to monitor decentralized systems....
research
07/10/2012

On Formal Specification of Maple Programs

This paper is an example-based demonstration of our initial results on t...
research
04/15/2019

Formalization of Automated Trading Systems in a Concurrent Linear Framework

We present a declarative and modular specification of an automated tradi...
research
04/15/2019

Bounded and Approximate Strong Satisfiability in Workflows

There has been a considerable amount of interest in recent years in the ...
research
07/20/2023

Structural Analysis of GRAFCET Control Specifications

The graphical modeling language GRAFCET is used as a formal specificatio...

Please sign up or login with your details

Forgot password? Click here to reset