The theory of finite automata on finite stings, infinite strings, and trees has had a dis
tinguished history. First, automata were introduced to represent idealized switching circuits …

The first-order theory of the integers with addition and order, commonly known as
Presburger arithmetic, has been a central topic in mathematical logic and computer science …

We develop from first principles an exact model of the behavior of loop nests executing in a
memory hicrarchy, by using a nontraditional classification of misses that has the key property …

We study the trap depth requirement for the realization of an optical clock using atoms
confined in a lattice. We show that site-to-site tunneling leads to a residual sensitivity to the …

It has been known since 1960 that the class of regular languages1 is linked to decidability
questions in formal logics. In particular, WS1S (Weak monadic Second-order theory of 1 …

In this thesis, we introduce a general method for computing the set of reachable states of an
infinite-state system. The basic idea, inspired by well-known state-space exploration …

Thanks to the development of a number of efficiency enhancing techniques, state-space
exploration based verification, and in particular model checking, has been quite successful …

Linear numerical constraints and their first-order theory, whether defined over the reals or
the integers, are basic tools that appear in many areas of Computer Science. This paper …

By definitionTimedAutomata have an infinite state-space, thus for verification purposes, an
exact finite abstraction is required. We propose a locationbased finite zone abstraction …

Fast acceleration of symbolic transition systems (F ast) is a tool for the analysis of systems
manipulating unbounded integer variables. We check safety properties by computing the …