We present an automata-based approach for symbolic verification of systems with unbounded string and integer variables. Particularly, we are interested in automatically discovering the relationships among the string and integer variables. The lengths of the strings in a regular language form a semilinear set. We present a novel construction for length automata that accept the unary or binary re...

objects that represent common attributes are not visible to the user and do not relate to logical files themselves. They rather define a subgroup in each of their sub-objects. Concrete super-objects, visible to the user, are candidates for files. Their sub-objects can be visible to the user and are then candidates for files themselves. Otherwise, they are an optional subgroup of their super-obj...

Consider a nearly regular point pattern in which a Delaunay triangulation is comprised of nearly equilateral triangles of the same size. We propose to model this set of points with Gaussian perturbations about a regular mean configuration. By investigating triangle subsets in detail we obtain various distributions of statistics based on size, or squared size of the triangles which is closely re...