We present regular model checking, a framework for algorithmic verification of infinite-state
systems with, eg, queues, stacks, integers, or a parameterized linear topology. States are …

Most specification languages express only qualitative constraints. However, among two
implementations that satisfy a given specification, one may be preferred to another. For …

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 …

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 …

As a result of a radial velocity follow-up of OGLE planetary transit candidates in Carina, we
report the discovery of two new transiting planets with very short orbital periods: OGLE-TR …

Abstract We show that Constraint Logic Programming (CLP) can serve as a conceptual
basis and as a practical implementation platform for the model checking of infinite-state …

We consider an extension of linear-time temporal logic (LTL) with constraints interpreted
over a concrete domain. We use a new automata-theoretic technique to show PSPACE …

One-counter automata are a fundamental and widely-studied class of infinite-state systems.
In this paper we consider one-counter automata with counter updates encoded in binary …

This paper argues that flatness appears as a central notion in the verification of counter
automata. A counter automaton is called flat when its control graph can be “replaced” …

We delimit the boundary between decidability versus undecidability of the weak monadic
second-order logic of one successor (WS1S) extended with linear cardinality constraints of …