Parameterized model checking is an active research field that considers automated
verification of distributed or concurrent systems, for all numbers of participating processes. 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 …

Induction is a successful approach for verification of hardware and software systems. A
common practice is to model a system using logical formulas, and then use a decision …

We consider the problem of verifying liveness for systems with a finite, but unbounded,
number of processes, commonly known as parameterised systems. Typical examples of …

I am very grateful to my supervisor Prof. Dr. Thomas Schwentick for all his support and
advises during my time as a research associate at the computer science department of the …

We address the problem of automatically establishing correctness for programs generating
an arbitrary number of concurrent processes and manipulating variables ranging over an …

Abstract We introduce Lazy Constrained Monotonic Abstraction (lazy CMA for short) for lazily
and soundly exploring well structured abstractions of infinite state non-monotonic systems …

We consider the problem of verifying liveness for systems with a finite, but unbounded,
number of processes, commonly known as parameterised systems. Typical examples of …

Formal specification is a vital ingredient to scalable verification of software systems. In the
case of efficient implementations of concurrent objects like atomic registers, queues, and …

Formal specification is a vital ingredient to scalable verification of software systems. In the
case of efficient implementations of concurrent objects like atomic registers, queues, and …