Sciweavers

608 search results - page 42 / 122
» Tests, Proofs and Refinements
Sort
View
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
14 years 8 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
VL
2003
IEEE
126views Visual Languages» more  VL 2003»
14 years 1 months ago
Generalizing WYSIWYT visual testing to screen transition languages
ct How can rigorous forms of testing be supported in a way that is both compatible with the visual aspect of visual programming languages, and usable by the audiences using those l...
Darren Brown, Margaret M. Burnett, Gregg Rothermel...
FOCS
2009
IEEE
14 years 2 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
14 years 2 months ago
Tolerant Linearity Testing and Locally Testable Codes
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
Swastik Kopparty, Shubhangi Saraf
LICS
2008
IEEE
14 years 2 months ago
Nonlocal Flow of Control and Kleene Algebra with Tests
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...
Dexter Kozen