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...
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 ...
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,...
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...
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...