Sciweavers

1492 search results - page 20 / 299
» Testing Properties of Constraint-Graphs
Sort
View
FOCS
2005
IEEE
15 years 9 months ago
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
Noga Alon, Asaf Shapira
FCT
2007
Springer
15 years 9 months ago
The Quantum Query Complexity of Algebraic Properties
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
Sebastian Dörn, Thomas Thierauf
136
Voted
ECCC
2008
122views more  ECCC 2008»
15 years 3 months ago
Every Minor-Closed Property of Sparse Graphs is Testable
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
Itai Benjamini, Oded Schramm, Asaf Shapira
ISSTA
2012
ACM
13 years 5 months ago
Isolating failure causes through test case generation
Manual debugging is driven by experiments—test runs that narrow down failure causes by systematically confirming or excluding individual factors. The BUGEX approach leverages t...
Jeremias Röbetaler, Gordon Fraser, Andreas Ze...
IFL
2004
Springer
15 years 8 months ago
The Feasibility of Interactively Probing Quiescent Properties of GUI Applications
In this paper we explore how application-users can, in an interactive way, test properties about the state of GUI applications that can be classified as local state transition sys...
Peter Achten