Distributed systems are complex and difficult to build correctly. Formal verification can
provably rule out bugs in such systems, but finding an inductive invariant that implies the …

We consider the MSO model-checking problem for simple linear loops, or equivalently
discrete-time linear dynamical systems, with semialgebraic predicates (ie, Boolean …

The (left) linear hull of a weighted automaton over a field is a topological invariant. If the
automaton is minimal, the linear hull can be used to determine whether or not the automaton …

This special issue of the Journal on Formal Methods in System Design features extended
and revised versions of select contributions presented at the Conference on Computer …

For many decades, advances in static verification have focused on linear integer arithmetic
(LIA) programs. Many real-world programs are, however, written with non-linear integer …

We introduce the notion of porous invariants for multipath affine loops over the integers.
These are invariants definable in (fragments of) Presburger arithmetic and, as such, lack …

Weighted automata (WA) are an extension of finite automata that defines functions from
words to values in a given semi-ring. An alternative model that is deterministic, called Cost …

The world relies on distributed systems, but these systems are increasingly complex and
hard to design and implement correctly. This is due to the intrinsic non-determinism from …

We consider the following problem: given d× d rational matrices A1,…, Ak and a polyhedral
cone, decide whether there exists a non-zero vector whose orbit under multiplication by …

Invariant relations are used to analyze while loops; while their primary application is to
derive the function of a loop, they can also be used to derive loop invariants, weakest …