We introduce Hyper2LTL, a temporal logic for the specification of hyperproperties that allows
for second-order quantification over sets of traces. Unlike first-order temporal logics for …

We propose abstract regular model checking as a new generic technique for verification of
parametric and infinite-state systems. The technique combines the two approaches of …

Regular model checking is being developed for algorithmic verification of several classes of
infinite-state systems whose configurations can be modeled as words over a finite alphabet …

We give a simple and efficient method to prove safety properties for parameterized systems
with linear topologies. A process in the system is a finite-state automaton, where the …

Checking infinite-state systems is frequently done by encoding infinite sets of states as
regular languages. Computing such a regular representation of, say, the reachable set of …

We consider the analysis of infinite half-duplex systems made of finite state machines that
communicate over unbounded channels. The half-duplex property for two machines and two …

We present a simple and efficient framework for automatic verification of systems with a
parameteric number of communicating processes. The processes may be organized in …

We present a simple and efficient framework for automatic verification of systems with a
parametric number of communicating processes. The processes may be organized in …

In this paper, we present an approach for algorithmic verification of infinite-state systems
with a parameterized tree topology. Our work is a generalization of regular model checking …

Wepresent a new technique for computing the transitive closure of a regular relation
characterized by a finite-state transducer. The construction starts from the original …