In the era of the internet of things (IoT), software-enabled inter-connected devices are of
paramount importance. The embedded systems are very frequently used in both security …

We present a new technique for exploiting static analysis to guide dynamic automated test
generation for binary programs, prioritizing the paths to be explored. Our technique is a …

The degree of ambiguity counts the number of accepting computations of a nondeterministic
finite automaton (NFA) on a given input. Alternatively, the nondeterminism of an NFA can be …

We present a novel approach to termination analysis. In a first step, the analysis uses a
program as a black-box which exhibits only a finite set of sample traces. Each sample trace …

In this paper, we explore the potential of the theory of nested words for partial correctness
proofs of recursive programs. Our conceptual contribution is a simple framework that allows …

The present paper proposes a new investigation area in automata theory—jumping finite
automata. These automata work like classical finite automata except that they read input …

We propose a generalization of results on the decidability of emptiness for several restricted
classes of sequential and distributed automata with auxiliary storage (stacks, queues) that …

This paper presents Arvada, an algorithm for learning context-free grammars from a set of
positive examples and a Boolean-valued oracle. Arvada learns a context-free grammar by …

The wealth of model-based techniques in software engineering—such as model checking or
model-based testing—is starkly contrasted with a frequent lack of formal models in practical …

The selection of bearing steel surfaces for use with silicon nitride rolling elements within
hybrid bearings is critical to the performance and life of such components, which have …