The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ranan Fraer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ranan Fraer
    Tracing the Origins of Verification Conditions. [Citation Graph (0, 0)][DBLP]
    AMAST, 1996, pp:241-255 [Conf]
  2. Fady Copty, Limor Fix, Ranan Fraer, Enrico Giunchiglia, Gila Kamhi, Armando Tacchella, Moshe Y. Vardi
    Benefits of Bounded Model Checking at an Industrial Setting. [Citation Graph (0, 0)][DBLP]
    CAV, 2001, pp:436-453 [Conf]
  3. Ranan Fraer, Gila Kamhi, Barukh Ziv, Moshe Y. Vardi, Limor Fix
    Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification. [Citation Graph (0, 0)][DBLP]
    CAV, 2000, pp:389-402 [Conf]
  4. Roy Armoni, Sergey Egorov, Ranan Fraer, Dmitry Korchemny, Moshe Y. Vardi
    Efficient LTL compilation for SAT-based model checking. [Citation Graph (0, 0)][DBLP]
    ICCAD, 2005, pp:877-884 [Conf]
  5. Kathi Fisler, Ranan Fraer, Gila Kamhi, Moshe Y. Vardi, Zijiang Yang
    Is There a Best Symbolic Cycle-Detection Algorithm? [Citation Graph (0, 0)][DBLP]
    TACAS, 2001, pp:420-434 [Conf]
  6. Marcelo Glusman, Gila Kamhi, Sela Mador-Haim, Ranan Fraer, Moshe Y. Vardi
    Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation. [Citation Graph (0, 0)][DBLP]
    TACAS, 2003, pp:176-191 [Conf]
  7. Yves Bertot, Ranan Fraer
    Reasoning with Executable Specifications. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1995, pp:531-545 [Conf]
  8. Roy Armoni, Limor Fix, Ranan Fraer, Scott Huddleston, Nir Piterman, Moshe Y. Vardi
    SAT-based Induction for Temporal Safety Properties. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:119, n:2, pp:3-16 [Journal]
  9. Ranan Fraer, Gila Kamhi, Limor Fix, Moshe Y. Vardi
    Evaluating Semi-Exhaustive Verification Techniques for Bug Hunting. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:23, n:2, pp:- [Journal]

  10. Deeper Bound in BMC by Combining Constant Propagation and Abstraction. [Citation Graph (, )][DBLP]


  11. A new paradigm for synthesis and propagation of clock gating conditions. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002