On using SMT-solvers for Modeling and Verifying Dynamic Network Emulators

09/21/2020
by   Erick Petersen, et al.
0

A novel model-based approach to verify dynamic networks is proposed; the approach consists in formally describing the network topology and dynamic link parameters. A many sorted first order logic formula is constructed to check the model with respect to a set of properties. The network consistency is verified using an SMT-solver, and the formula is used for the run-time network verification when a given static network instance is implemented. The z3 solver is used for this purpose and corresponding preliminary experiments showcase the expressiveness and current limitations of the proposed approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/16/2023

A Quantum SMT Solver for Bit-Vector Theory

Given a formula F of satisfiability modulo theory (SMT), the classical S...
research
08/25/2021

Toward Formal Data Set Verification for Building Effective Machine Learning Models

In order to properly train a machine learning model, data must be proper...
research
05/07/2021

lazybvtoint at the SMT Competition 2020

lazybvtoint is a new prototype SMT-solver, that will participate in the ...
research
04/26/2021

Improved Bounded Model Checking of Timed Automata

Timed Automata (TA) are a very popular modeling formalism for systems wi...
research
06/07/2022

SMT-Based Model Checking of Industrial Simulink Models

The development of embedded systems requires formal analysis of models s...
research
05/28/2021

Fair and Adventurous Enumeration of Quantifier Instantiations

SMT solvers generally tackle quantifiers by instantiating their variable...
research
07/21/2020

Automated and Sound Synthesis of Lyapunov Functions with SMT Solvers

In this paper we employ SMT solvers to soundly synthesise Lyapunov funct...

Please sign up or login with your details

Forgot password? Click here to reset