Finite linear systems are finite sets of linear functions whose guards are defined by
Presburger formulas, and whose the squares matrices associated generate a finite …

Symbolic model checking provides partially effective verification procedures that can handle
systems with an infinite state space. So-called “acceleration techniques” enhance the …

Fast acceleration of symbolic transition systems (F ast) is a tool for the analysis of systems
manipulating unbounded integer variables. We check safety properties by computing the …

Modular static analyzers use procedure abstractions, aka summarizations, to ensure that
their execution time increases linearly with the size of analyzed programs. A similar …

Current modeling techniques are not well equipped to design dynamic software
architectures. In this work we present the basic concepts for a dynamic architecture …

Number decision diagrams (NDD) are the automata-based symbolic representation for
manipulating sets of integer vectors encoded as strings of digit vectors (least or most …

We present a method for the automated verification of temporal properties of infinite state
systems. Our verification method is based on the specialization of constraint logic programs …

The reachability problem is a central decision problem for formal verification based on vector
addition systems with states (VASS), which are equivalent to Petri nets and form one of the …

This paper studies model-checking of fragments and extensions of CTL* on infinitestate
counter systems, where the states are vectors of integers and the transitions are determined …

In this paper, we address the issue of reachability analysis for Petri nets, viewed as
automata with counters. We show that exact reachability analysis can be achieved by …