Applying abstract acceleration to (co-)reachability analysis of reactive programs

  title={Applying abstract acceleration to (co-)reachability analysis of reactive programs},
  author={P. Schrammel and Bertrand Jeannet},
  journal={J. Symb. Comput.},

Unbounded-Time Safety Verification of Guarded LTI Models with Inputs by Abstract Acceleration

This article focuses on sound safety verification of unbounded-time (infinite-horizon) linear time-invariant (LTI) models with inputs with inputs using reachability analysis using counterexample-guided Abstract Acceleration.

Unbounded-Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration

An extension of abstract acceleration to linear loops with inputs, which correspond to discrete-time LTI control systems, is presented and performance increases by several orders of magnitude over alternative approaches in the literature.

Unbounded-time reachability analysis of hybrid systems by abstract acceleration

  • P. Schrammel
  • Computer Science
    2015 International Conference on Embedded Software (EMSOFT)
  • 2015
Linear dynamical systems are ubiquitous in hybrid systems, both as physical models or as software control modules. Therefore we need an unbounded-time reachability analysis that can cope with

Deadlock-free discrete controller synthesis for infinite state systems

Using abstract interpretation techniques involving disjunctive polyhedral over-approximations, effective symbolic algorithms are provided allowing to solve the deadlock-free safety control problem while overcoming previous limitations regarding the non-convexity of the set of states violating the invariant to enforce.

Logico-Numerical Verification Methods for Discrete and Hybrid Systems

A unified approach to the verification of discrete and hybrid logico-numerical systems based on abstract interpretation, which is capable of integrating sophisticated numerical abstract interpretation methods while successfully trading precision for efficiency is proposed.

Abstract acceleration of general linear loops

The approach finds non-trivial invariants to prove useful bounds on the values of variables for such loops, clearly outperforming the existing approaches in terms of precision while exhibiting good performance.

Acceleration in Linear Relation Analysis

Linear relation analysis is a classical abstract interpretation based on an over-approximation of reachable numerical states of a program by convex polyhedra. Since it works with a lattice of infinite

Abstract Acceleration in Linear relation analysis (extended version)

This research report gives a comprehensive tutorial on abstract acceleration: its origins in Presburger-based acceleration including new insights w.r.t. the linear accelerability of linear transformations, methods for simple and nested loops, recent extensions, tools and applications, and a detailed discussion of related methods and future perspectives.

Logico-Numerical Max-Strategy Iteration

This paper proposes a method for applying max-strategy iteration to logico-numerical programs, i.e. programs with numerical and Boolean variables, without explicitly enumerating the Boolean state space, and gives experimental evidence about the efficiency and precision of the approach.

Abstract acceleration in linear relation analysis



Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs

Logico-Numerical Abstract Acceleration and Application to the Verification of Data-Flow Programs

Experimental results show that incorporating logico-numerical abstract acceleration methods in a verification tool based on abstract interpretation provides not only significant advantage in terms of accuracy, but also a gain in performance in comparison to standard techniques.

Flat Acceleration in Symbolic Model Checking

A new framework for symbolic model checking with accelerations is developed and new symbolic algorithms using accelerations to compute reachability sets are proposed.

FASTer Acceleration of Counter Automata in Practice

For functions defined by translations over a polyhedral domain, a new acceleration algorithm is given which is polynomial in the size of the function and exponential in its dimension, while the more generic algorithm is exponential in both the size and its dimension.

Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic

A method combining path decomposition and bottom-up computation features for characterizing the reachability sets of Petri nets within Presburger arithmetic is presented, made of a decomposition module and an arithmetic module, the latter being built upon Boudet-Comon's algorithm for solving the decision problem for PresBurger arithmetic.

Using Forward Reachability Analysis for Verification of Lossy Channel Systems

A novel representation formalism, called simple regular expressions (SREs), for representing sets of states of protocols with lossy FIFO channels is proposed, and it is shown that the class of languages representable by SREs is exactly theclass of downward closed languages that arise in the analysis of such protocols.

Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic

We present a new symbolic model checker which conservatively evaluates safety and liveness properties on infinite-state programs. We use Presburger formulas to symbolically encode a program's

Synchronous Observers and the Verification of Reactive Systems

Synchronous languages are simple and clean, they have been given simple and precise formal semantics, they allow especially elegant programming style and conciliate concurrency with determinism.

A Modular Static Analysis Approach to Affine Loop Invariants Detection

Acceleration in Convex Data-Flow Analysis

This paper investigates acceleration in convex data-flow analysis of systems with real-valued variables where guards are convex polyhedra and assignments are translations and presents a simple and algorithmically efficient characterization of MFP-acceleration for cycles with a unique initial location.