Results 261 to 270 of about 24,229,753 (306)

An adaptivity hierarchy theorem for property testing

Computational Complexity, 2017
Adaptivity is known to play a crucial role in property testing. In particular, there exist properties for which there is an exponential gap between the power of adaptive testing algorithms, wherein each query may be determined by the answers received to ...
C. Canonne, Tom Gur
semanticscholar   +1 more source

Partial Function Extension with Applications to Learning and Property Testing

International Symposium on Algorithms and Computation, 2018
In partial function extension, we are given a partial function consisting of $n$ points from a domain and a function value at each point. Our objective is to determine if this partial function can be extended to a function defined on the domain, that ...
U. Bhaskar, G. Kumar
semanticscholar   +1 more source

White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing

IEEE Annual Symposium on Foundations of Computer Science, 2017
Ramsey theory assures us that in any graph there is a clique or independent set of a certain size, roughly logarithmic in the graph size. But how difficult is it to find the clique or independent set? If the graph is given explicitly, then it is possible
Ilan Komargodski, M. Naor, E. Yogev
semanticscholar   +1 more source

Property Testing

Algorithms for Big Data, 2020
openaire   +2 more sources

Property-based Testing of Quantum Programs in Q#

International Conference on Software Engineering, 2020
Property-based testing is a structured method for automated testing using program specifications. We report on the design and implementation of what is to our knowledge the first property-based framework for quantum programs. We review various aspects of
Shahin Honarvar, M. Mousavi, R. Nagarajan   +2 more
semanticscholar   +1 more source

Testing graphs for colorability properties*

Random Structures & Algorithms, 2004
AbstractLet P be a property of graphs. An ϵ‐test for P is a randomized algorithm which, given the ability to make queries whether a desired pair of vertices of an input graph G with n vertices are adjacent or not, distinguishes, with high probability, between the case of G satisfying P and the case that it has to be modified by adding and removing more
openaire   +2 more sources

Testing for the Church-Rosser Property

Journal of the ACM, 1974
The central notion in a replacement system is one of a transformation on a set of objects. Starting with a given object, in one “move” it is possible to reach one of a set of objects. An object from which no move is possible is called irreducible. A replacement system is Church-Rosser if starting with any object a unique irreducible object
openaire   +2 more sources

Property-based testing

ACM SIGSOFT Software Engineering Notes, 1997
The goal of software testing analysis is to validate that an implementation satisfies its specifications. Many errors in software are caused by generalizable flaws in the source code. Property-based testing assures that a given program is free of specified generic flaws.
George Fink, Matt Bishop
openaire   +1 more source

Algebraic property testing

Proceedings of the fortieth annual ACM symposium on Theory of computing, 2008
We argue that the symmetries of a property being tested play a central role in property testing. We support this assertion in the context of algebraic functions, by examining properties of functions mapping a vector space Kn over a field K to a subfield F.
Tali Kaufman, Madhu Sudan 0001
openaire   +2 more sources

Property Testing of Regular Languages with Applications to Streaming Property Testing of Visibly Pushdown Languages

International Colloquium on Automata, Languages and Programming, 2021
Gabriel Bathie, Tatiana Starikovskaya
semanticscholar   +1 more source