From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

w-Regular languages are testable with a constant number of queries, и . Theor. Comput. Sci., 329 (1-3): 71-92 (2004)Coverage Metrics for Formal Verification., , и . CHARME, том 2860 из Lecture Notes in Computer Science, стр. 111-125. Springer, (2003)omega-Regular Languages Are Testable with a Constant Number of Queries., и . RANDOM, том 2483 из Lecture Notes in Computer Science, стр. 26-28. Springer, (2002)Formal verification of concurrent software: two case studies., , , , , и . PADTAD, стр. 11-22. ACM, (2006)Improving Representative Computation in ExpliSAT., , и . Haifa Verification Conference, том 8244 из Lecture Notes in Computer Science, стр. 359-364. Springer, (2013)Coverage metrics for model checking (מטריקות כיסוי לבדיקות מודל.).. Hebrew University of Jerusalem, Israel, (2003)Preface.. VSSE, том 294 из Electronic Notes in Theoretical Computer Science, стр. 1. Elsevier, (2013)A Study of Demographic Bias in CNN-Based Brain MR Segmentation., , , и . MLCN@MICCAI, том 13596 из Lecture Notes in Computer Science, стр. 13-22. Springer, (2022)Why Do Things Go Wrong (or Right)? Applications of Causal Reasoning to Verification.. FMCAD, стр. 1. IEEE, (2022)Lattice-Based Refinement in Bounded Model Checking., , , , и . VSTTE, том 11294 из Lecture Notes in Computer Science, стр. 50-68. Springer, (2018)