Sciweavers

204 search results - page 12 / 41
» Parameterizations of Test Cover with Bounded Test Sizes
Sort
View
ISSTA
2004
ACM
15 years 4 months ago
Verifying process models built using parameterized state machines
Software process and workflow languages are increasingly used to define loosely-coupled systems of systems. These languages focus on coordination issues such as data flow and c...
Barbara Staudt Lerner
ESA
2008
Springer
153views Algorithms» more  ESA 2008»
15 years 14 days ago
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, S...
TOC
2008
122views more  TOC 2008»
14 years 10 months ago
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
Avi Wigderson, David Xiao
SIGSOFT
2007
ACM
15 years 11 months ago
Parallel test generation and execution with Korat
We present novel algorithms for parallel testing of code that takes structurally complex test inputs. The algorithms build on the Korat algorithm for constraint-based generation o...
Sasa Misailovic, Aleksandar Milicevic, Nemanja Pet...
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
15 years 8 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...