Sciweavers

204 search results - page 9 / 41
» Parameterizations of Test Cover with Bounded Test Sizes
Sort
View
ENTCS
2007
115views more  ENTCS 2007»
14 years 10 months ago
A Global Algorithm for Model-Based Test Suite Generation
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...
Anders Hessel, Paul Pettersson
ICSE
2005
IEEE-ACM
15 years 10 months ago
A framework of greedy methods for constructing interaction test suites
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 ...
Charles J. Colbourn, Myra B. Cohen, Renée C...
RTAS
2005
IEEE
15 years 4 months ago
On Schedulability Bounds of Static Priority Schedulers
—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 ...
Jianjia Wu, Jyh-Charn Liu, Wei Zhao
ISSTA
2004
ACM
15 years 3 months ago
Optimal strategies for testing nondeterministic systems
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...
SIAMDM
2008
79views more  SIAMDM 2008»
14 years 10 months ago
Testing Triangle-Freeness in General Graphs
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...