Sciweavers

314 search results - page 17 / 63
» The Complexity of Coverage
Sort
View
APSEC
2005
IEEE
15 years 6 months ago
An Integrated Solution for Testing and Analyzing Java Applications in an Industrial Setting
Testing a large-scale, real-life commercial software application is a very challenging task due to the constant changes in the software, the involvement of multiple programmers an...
W. Eric Wong, J. Jenny Li
ENTCS
2008
95views more  ENTCS 2008»
15 years 12 days ago
Coverage-biased Random Exploration of Models
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
Marie-Claude Gaudel, Alain Denise, Sandrine-Domini...
APPROX
2004
Springer
116views Algorithms» more  APPROX 2004»
15 years 5 months ago
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Net
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag
CORR
2011
Springer
195views Education» more  CORR 2011»
14 years 7 months ago
Simplicial Homology of Random Configurations
Given a Poisson process on a d-dimensional torus, its random geometric simplicial complex is the complex whose vertices are the points of the Poisson process and simplices are give...
Laurent Decreusefond, Eduardo Ferraz, Hugues Randr...
DATE
2007
IEEE
155views Hardware» more  DATE 2007»
15 years 6 months ago
Design fault directed test generation for microprocessor validation
Functional validation of modern microprocessors is an important and complex problem. One of the problems in functional validation is the generation of test cases that has higher p...
Deepak Mathaikutty, Sandeep K. Shukla, Sreekumar V...