On Invariant Synthesis for Parametric Systems

05/29/2019
by   Dennis Peuter, et al.
0

We study possibilities for automated invariant generation in parametric systems. We use (a refinement of) an algorithm for symbol elimination in theory extensions to devise a method for iteratively strengthening certain classes of safety properties to obtain invariants of the system. We identify conditions under which the method is correct and complete, and situations in which the method is guaranteed to terminate. We illustrate the ideas on various examples.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/11/2019

Parametric Systems: Verification and Synthesis

In this paper we study possibilities of using hierarchical reasoning, sy...
research
07/06/2021

Symbol Elimination for Parametric Second-Order Entailment Problems (with Applications to Problems in Wireless Network Theory)

We analyze possibilities of second-order quantifier elimination for form...
research
01/26/2023

Differential Elimination and Algebraic Invariants of Polynomial Dynamical Systems

Invariant sets are a key ingredient for verifying safety and other prope...
research
05/25/2018

Checking Deadlock-Freedom of Parametric Component-Based Systems

We propose an automated method for computing inductive invariants applie...
research
08/16/2019

How to Win First-Order Safety Games

First-order (FO) transition systems have recently attracted attention fo...
research
09/20/2022

Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming

A barrier certificate often serves as an inductive invariant that isolat...
research
04/18/2013

Feature Elimination in Kernel Machines in moderately high dimensions

We develop an approach for feature elimination in statistical learning w...

Please sign up or login with your details

Forgot password? Click here to reset