One approach to model checking software is based on the abstract-check-refine paradigm:
build an abstract model, then check the desired property, and if the check fails, refine the …

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 …

The decidability and complexity of reachability problems and model-checking for flat counter
machines have been explored in detail. However, only few results are known for flat (lossy) …

Verification of complex systems cannot be achieved without combining several analysis
methods and techniques. A widely adopted approach consists in combining abstraction …

We consider verification of safety properties for concurrent real-timed systems modelled as
timed Petri nets, by performing symbolic forward reachability analysis. We introduce a …

We consider verification of safety properties for concurrent real-timed systems modelled as
timed Petri nets, by performing symbolic forward reachability analysis. We introduce a …

This dissertation proposes new methods for the Safety Verification problem, which is, given
a program, an initial state 1 from which the program begins execution, and a set of error …

The model checking of counters systems often reduces to the effective computation of the set
of predecessors Pre*(X′) of a Presburger-definable set X′. Because there often exists an …

The model checking of a counters system S often reduces to the effective computation of the
set of predecessors \rmPre_S^*(X) of a set of integer vectors X. Because the exact …

This paper is a survey of the BLAST, which is a software model checker for C programs
developed at Berkeley. Based on the popular abstract-check-refine paradigm, the concept of …