Author:
Chockler Hana,Kupferman Orna
Subject
General Computer Science,Theoretical Computer Science
Reference34 articles.
1. Testing k-colorability;Alon;SIAM J. Discrete Math.,2002
2. Regular languages are testable with a constant number of queries;Alon,1999
3. Defining liveness;Alpern;Inform. Process Lett.,1985
4. M. Bender, D. Ron, Testing acyclicity of directed graphs in sublinear time, in: Proc. 27th Int. Colloq. on Automata, Languages, and Programming, 2000.
5. Symbolic model chacking without BDDs;Biere,1999
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Property Testing for Bounded Degree Databases;LEIBNIZ INT PR INFOR;2018
2. Sublinear DTD Validity;Language and Automata Theory and Applications;2015
3. Verifying cloud services;ACM SIGOPS Operating Systems Review;2013-07-23
4. Testable and untestable classes of first-order formulae;Journal of Computer and System Sciences;2012-09
5. Approximate Satisfiability and Equivalence;SIAM Journal on Computing;2010-01