Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
The rich collection of successes in property testing raises a natural question: Why are so many different properties turning out to be locally testable? Are there some broad "...
Arnab Bhattacharyya, Victor Chen, Madhu Sudan, Nin...
—Recent protocols are become increasingly complex, and lead to further level of complexity when used in combination, often resulting in ambiguous behavior. This paper, starting f...
Telemaco Melia, Amardeo Sarma, Rui L. Aguiar, Diet...
Design-for-testability is a very important issue in software engineering. It becomes crucial in the case of OO designs where control flows are generally not hierarchical, but are d...