Sciweavers

854 search results - page 13 / 171
» Abstracting from Failure Probabilities
Sort
View
KBSE
2008
IEEE
15 years 6 months ago
Random Test Run Length and Effectiveness
Abstract—A poorly understood but important factor in random testing is the selection of a maximum length for test runs. Given a limited time for testing, it is seldom clear wheth...
James H. Andrews, Alex Groce, Melissa Weston, Ru-G...
CJ
2010
150views more  CJ 2010»
14 years 9 months ago
Program Analysis Probably Counts
Abstract. Semantics-based program analysis uses an abstract semantics of programs/systems to statically determine run-time properties. Classic examples from compiler technology inc...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
RV
2010
Springer
172views Hardware» more  RV 2010»
14 years 10 months ago
Recovery Tasks: An Automated Approach to Failure Recovery
Abstract. We present a new approach for developing robust software applications that breaks dependences on the failed parts of an application’s execution to allow the rest of the...
Brian Demsky, Jin Zhou, William Montaz
WDAG
2010
Springer
218views Algorithms» more  WDAG 2010»
14 years 10 months ago
Anonymous Asynchronous Systems: The Case of Failure Detectors
Abstract: Due the multiplicity of loci of control, a main issue distributed systems have to cope with lies in the uncertainty on the system state created by the adversaries that ar...
François Bonnet, Michel Raynal
COLT
2001
Springer
15 years 4 months ago
Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries
We present results concerning the learning of Monotone DNF (MDNF) from Incomplete Membership Queries and Equivalence Queries. Our main result is a new algorithm that allows effici...
Nader H. Bshouty, Nadav Eiron