Protocol validation in complex systems
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Design and validation of computer protocols
Design and validation of computer protocols
Handbook of theoretical computer science (vol. B)
Reasoning about infinite computations
Information and Computation
Property testing in bounded degree graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Model checking
Symbolic Model Checking
Model Checking of Safety Properties
Formal Methods in System Design
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
Revised Lectures from the International Symposium on Compositionality: The Significant Difference
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Testing Acyclicity of Directed Graphs in Sublinear Time
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Testing the Diameter of Graphs
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Proclaiming Dictators and Juntas or Testing Boolean Formulae
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Expressibility results for linear-time and branching-time logics
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Regular Languages are Testable with a Constant Number of Queries
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Diagram-based verification of discrete, real-time and hybrid systems
Diagram-based verification of discrete, real-time and hybrid systems
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Conformance testing in the presence of multiple faults
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
We continue the study of combinatorial property testing. For a property 驴, an 驴-test for 驴 for 0 x, returns "yes" if x satisfies 驴, and returns "no" with high probability if x is 驴-far from satisfying 驴, where 驴-far essentially means that an 驴-fraction of x needs to be changed in order for it to satisfy 驴. In [AKNS99], Alon et al. show that regular languages are 驴-testable with a constant (depends on 驴 and 驴 and independent of x) number of queries. We extend the result in [AKNS99] to 驴-regular languages: given a nondeterministic B眉chi automaton A on infinite words and a smalle 驴 0, we describe an algorithm that gets as input an infinite lasso-shape word of the form x 驴 y驴, for finite words x and y, samples only a constant number of letters in x and y, returns "yes" if w 驴 L(A), and returns "no" with probability 2/3 if w is 驴-far from L(A). We also discuss the applicability of property testing to formal verification, where 驴-regular languages are used for the specification of the behavior of nonterminating reactive systems, and computations correspond to lasso-shape words.