From post

Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation.

, , , , и . TACAS, том 2619 из Lecture Notes in Computer Science, стр. 176-191. Springer, (2003)

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.

No persons found for author name Fraer, Ranan
add a person with the name Fraer, Ranan
 

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

Efficient LTL compilation for SAT-based model checking., , , , и . ICCAD, стр. 877-884. IEEE Computer Society, (2005)Accelerated verification of RTL assertions based on satisfiability solvers., , , , и . HLDVT, стр. 107-110. IEEE Computer Society, (2002)Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation., , , , и . TACAS, том 2619 из Lecture Notes in Computer Science, стр. 176-191. Springer, (2003)Reasoning with Executable Specifications., и . TAPSOFT, том 915 из Lecture Notes in Computer Science, стр. 531-545. Springer, (1995)Tracing the Origins of Verification Conditions.. AMAST, том 1101 из Lecture Notes in Computer Science, стр. 241-255. Springer, (1996)Benefits of Bounded Model Checking at an Industrial Setting., , , , , , и . CAV, том 2102 из Lecture Notes in Computer Science, стр. 436-453. Springer, (2001)Evaluating Semi-Exhaustive Verification Techniques for Bug Hunting., , , и . SMC@FLoC, том 23 из Electronic Notes in Theoretical Computer Science, стр. 11-22. Elsevier, (1999)Deeper Bound in BMC by Combining Constant Propagation and Abstraction., , , , , , и . ASP-DAC, стр. 304-309. IEEE Computer Society, (2007)A new paradigm for synthesis and propagation of clock gating conditions., , и . DAC, стр. 658-663. ACM, (2008)Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification., , , , и . CAV, том 1855 из Lecture Notes in Computer Science, стр. 389-402. Springer, (2000)