Sciweavers

168 search results - page 15 / 34
» Random testing of interrupt-driven software
Sort
View
FSTTCS
2004
Springer
14 years 23 days ago
Testing Geometric Convexity
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
Luis Rademacher, Santosh Vempala
ESA
2008
Springer
92views Algorithms» more  ESA 2008»
13 years 9 months ago
How Reliable Are Practical Point-in-Polygon Strategies?
We experimentally study the reliability of geometric software for point location in simple polygons. As expected, the code we tested works very well for random query points. Howeve...
Stefan Schirra
KBSE
2002
IEEE
14 years 9 days ago
What Makes Finite-State Models More (or Less) Testable?
Finite-state machine (FSM) models are commonly used to represent software with concurrent processes. Established model checking tools can be used to automatically test FSM models,...
David Owen, Tim Menzies, Bojan Cukic
ICCS
2005
Springer
14 years 27 days ago
Model-Based Statistical Testing of a Cluster Utility
Abstract. As High Performance Computing becomes more collaborative, software certification practices are needed to quantify the credibility of shared applications. To demonstrate q...
W. Thomas Swain, Stephen L. Scott
CODES
2008
IEEE
13 years 9 months ago
Specification-based compaction of directed tests for functional validation of pipelined processors
Functional validation is a major bottleneck in microprocessor design methodology. Simulation is the widely used method for functional validation using billions of random and biase...
Heon-Mo Koo, Prabhat Mishra