Being correct is not enough: efficient verification using robust linear temporal logic

02/24/2021
by   Tzanis Anevlavis, et al.
0

While most approaches in formal methods address system correctness, ensuring robustness has remained a challenge. In this paper we introduce the logic rLTL which provides a means to formally reason about both correctness and robustness in system design. Furthermore, we identify a large fragment of rLTL for which the verification problem can be efficiently solved, i.e., verification can be done by using an automaton, recognizing the behaviors described by the rLTL formula φ, of size at most 𝒪( 3^ |φ|), where |φ| is the length of φ. This result improves upon the previously known bound of 𝒪(5^|φ|) for rLTL verification and is closer to the LTL bound of 𝒪( 2^|φ|). The usefulness of this fragment is demonstrated by a number of case studies showing its practical significance in terms of expressiveness, the ability to describe robustness, and the fine-grained information that rLTL brings to the process of system verification. Moreover, these advantages come at a low computational overhead with respect to LTL verification.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/25/2017

Verification of Design Decisions in Communication Protocol by Evaluation of Temporal Logic Formulas

During the project of a communication protocol, many design decisions in...
05/29/2021

Formally Validating a Practical Verification Condition Generator (extended version)

A program verifier produces reliable results only if both the logic used...
09/21/2021

Introduction to Neural Network Verification

Deep learning has transformed the way we think of software and what it c...
10/22/2019

Metamath Zero: The Cartesian Theorem Prover

As the usage of theorem prover technology expands, so too does the relia...
11/26/2021

QECV: Quantum Error Correction Verification

Quantum Error Correction (QEC) is essential for fault-tolerant quantum c...
01/25/2020

Verification of a Generative Separation Kernel

We present a formal verification of the functional correctness of the Mu...
09/03/2013

On the Robustness of Temporal Properties for Stochastic Models

Stochastic models such as Continuous-Time Markov Chains (CTMC) and Stoch...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.