Abstract. Model-based testing has been proposed as a technique to automatically verify that a system conforms to its specification. A popular approach is to use a model-checker to...
Greedy algorithms for the construction of software interaction test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one ...
—Real-time systems need to use the schedulability test to determine whether or not admitted tasks can meet their deadlines. The utilization based schedulability test is the most ...
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
Lev Nachmanson, Margus Veanes, Wolfram Schulte, Ni...
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...