The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ofer Strichman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Amir Pnueli, Ofer Strichman, Michael Siegel
    Translation Validation: From SIGNAL to C. [Citation Graph (0, 0)][DBLP]
    Correct System Design, 1999, pp:231-255 [Conf]
  2. Edmund M. Clarke, Anubhav Gupta, James H. Kukula, Ofer Strichman
    SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques. [Citation Graph (0, 0)][DBLP]
    CAV, 2002, pp:265-279 [Conf]
  3. Roman Gershman, Maya Koifman, Ofer Strichman
    Deriving Small Unsatisfiable Cores with Dominators. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:109-122 [Conf]
  4. Anubhav Gupta, Ofer Strichman
    Abstraction Refinement for Bounded Model Checking. [Citation Graph (0, 0)][DBLP]
    CAV, 2005, pp:112-124 [Conf]
  5. Daniel Kroening, Joël Ouaknine, Sanjit A. Seshia, Ofer Strichman
    Abstraction-Based Satisfiability Solving of Presburger Arithmetic. [Citation Graph (0, 0)][DBLP]
    CAV, 2004, pp:308-320 [Conf]
  6. Orly Meir, Ofer Strichman
    Yet Another Decision Procedure for Equality Logic. [Citation Graph (0, 0)][DBLP]
    CAV, 2005, pp:307-320 [Conf]
  7. Amir Pnueli, Yoav Rodeh, Ofer Strichman, Michael Siegel
    Deciding Equality Formulas by Small Domains Instantiations. [Citation Graph (0, 0)][DBLP]
    CAV, 1999, pp:455-469 [Conf]
  8. Yoav Rodeh, Ofer Strichman
    Finite Instantiations in Equivalence Logic with Uninterpreted Functions. [Citation Graph (0, 0)][DBLP]
    CAV, 2001, pp:144-154 [Conf]
  9. Ofer Strichman
    Tuning SAT Checkers for Bounded Model Checking. [Citation Graph (0, 0)][DBLP]
    CAV, 2000, pp:480-494 [Conf]
  10. Ofer Strichman, Sanjit A. Seshia, Randal E. Bryant
    Deciding Separation Formulas with SAT. [Citation Graph (0, 0)][DBLP]
    CAV, 2002, pp:209-222 [Conf]
  11. Muralidhar Talupur, Nishant Sinha, Ofer Strichman, Amir Pnueli
    Range Allocation for Separation Logic. [Citation Graph (0, 0)][DBLP]
    CAV, 2004, pp:148-161 [Conf]
  12. Sagar Chaki, Edmund M. Clarke, Alex Groce, Ofer Strichman
    Predicate Abstraction with Minimum Predicates. [Citation Graph (0, 0)][DBLP]
    CHARME, 2003, pp:19-34 [Conf]
  13. Ofer Strichman
    Pruning Techniques for the SAT-Based Bounded Model Checking Problem. [Citation Graph (0, 0)][DBLP]
    CHARME, 2001, pp:58-70 [Conf]
  14. Amir Pnueli, Ofer Strichman, Michael Siegel
    Translation Validation: From DC+ to C*. [Citation Graph (0, 0)][DBLP]
    FM-Trends, 1998, pp:137-150 [Conf]
  15. Ofer Strichman
    On Solving Presburger and Linear Arithmetic with SAT. [Citation Graph (0, 0)][DBLP]
    FMCAD, 2002, pp:160-170 [Conf]
  16. Amir Pnueli, Yoav Rodeh, Ofer Strichman
    Range Allocation for Equivalence Logic. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:317-333 [Conf]
  17. Roman Gershman, Ofer Strichman
    HaifaSat: A New Robust SAT Solver. [Citation Graph (0, 0)][DBLP]
    Haifa Verification Conference, 2005, pp:76-89 [Conf]
  18. Amir Pnueli, Ofer Strichman, Michael Siegel
    Translation Validation for Synchronous Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:235-246 [Conf]
  19. Orna Grumberg, Flavio Lerda, Ofer Strichman, Michael Theobald
    Proof-guided underapproximation-widening for multi-process systems. [Citation Graph (0, 0)][DBLP]
    POPL, 2005, pp:122-131 [Conf]
  20. Roman Gershman, Ofer Strichman
    Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:423-429 [Conf]
  21. Sagar Chaki, Alex Groce, Ofer Strichman
    Explaining abstract counterexamples. [Citation Graph (0, 0)][DBLP]
    SIGSOFT FSE, 2004, pp:73-82 [Conf]
  22. Edmund M. Clarke, Daniel Kroening, Joël Ouaknine, Ofer Strichman
    Completeness and Complexity of Bounded Model Checking. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2004, pp:85-96 [Conf]
  23. Daniel Kroening, Ofer Strichman
    Efficient Computation of Recurrence Diameters. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2003, pp:298-309 [Conf]
  24. Armin Biere, Alessandro Cimatti, Edmund M. Clarke, Ofer Strichman, Yunshan Zhu
    Bounded model checking. [Citation Graph (0, 0)][DBLP]
    Advances in Computers, 2003, v:58, n:, pp:118-149 [Journal]
  25. Ofer Strichman
    Deciding Disjunctive Linear Arithmetic with SAT [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  26. Armin Biere, Ofer Strichman
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:119, n:2, pp:1-0 [Journal]
  27. Armin Biere, Ofer Strichman
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:144, n:1, pp:1-0 [Journal]
  28. Amir Pnueli, Ofer Strichman
    Reduced Functional Consistency of Uninterpreted Functions. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:144, n:2, pp:53-65 [Journal]
  29. Ofer Strichman, Armin Biere
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:174, n:3, pp:1-2 [Journal]
  30. Sagar Chaki, Edmund M. Clarke, Alex Groce, Joël Ouaknine, Ofer Strichman, Karen Yorav
    Efficient Verification of Sequential and Concurrent C Programs. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2004, v:25, n:2-3, pp:129-166 [Journal]
  31. Ofer Strichman
    Accelerating Bounded Model Checking of Safety Properties. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2004, v:24, n:1, pp:5-24 [Journal]
  32. Amir Pnueli, Yoav Rodeh, Ofer Strichman, Michael Siegel
    Erratum ("The small model property: how small can it be?" Volume 178, Number 1 [2002], pages 279-293). [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:184, n:1, pp:227- [Journal]
  33. Amir Pnueli, Yoav Rodeh, Ofer Strichman, Michael Siegel
    The Small Model Property: How Small Can It Be? [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:178, n:1, pp:279-293 [Journal]
  34. Yoav Rodeh, Ofer Strichman
    Building small equality graphs for deciding equality logic with uninterpreted functions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:1, pp:26-59 [Journal]
  35. Armin Biere, Ofer Strichman
    Introductory paper. [Citation Graph (0, 0)][DBLP]
    STTT, 2005, v:7, n:2, pp:87-88 [Journal]
  36. Edmund M. Clarke, Daniel Kroening, Joël Ouaknine, Ofer Strichman
    Computational challenges in bounded model checking. [Citation Graph (0, 0)][DBLP]
    STTT, 2005, v:7, n:2, pp:174-183 [Journal]
  37. Amir Pnueli, Ofer Strichman, Michael Siegel
    The Code Validation Tool CVT: Automatic Verification of a Compilation Process. [Citation Graph (0, 0)][DBLP]
    STTT, 1998, v:2, n:2, pp:192-201 [Journal]
  38. Alex Groce, Sagar Chaki, Daniel Kroening, Ofer Strichman
    Error explanation with distance metrics. [Citation Graph (0, 0)][DBLP]
    STTT, 2006, v:8, n:3, pp:229-247 [Journal]
  39. Edmund M. Clarke, Anubhav Gupta, Ofer Strichman
    SAT-based counterexample-guided abstraction refinement. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2004, v:23, n:7, pp:1113-1123 [Journal]
  40. Arie Matsliah, Ofer Strichman
    Underapproximation for Model-Checking Based on Random Cryptographic Constructions. [Citation Graph (0, 0)][DBLP]
    CAV, 2007, pp:339-351 [Conf]
  41. Hana Chockler, Ofer Strichman
    Easier and More Informative Vacuity Checks. [Citation Graph (0, 0)][DBLP]
    MEMOCODE, 2007, pp:189-198 [Conf]
  42. Sagar Chaki, Ofer Strichman
    Optimized L*-Based Assume-Guarantee Reasoning. [Citation Graph (0, 0)][DBLP]
    TACAS, 2007, pp:276-291 [Conf]
  43. Randal E. Bryant, Daniel Kroening, Joël Ouaknine, Sanjit A. Seshia, Ofer Strichman, Bryan A. Brady
    Deciding Bit-Vector Arithmetic with Abstraction. [Citation Graph (0, 0)][DBLP]
    TACAS, 2007, pp:358-372 [Conf]

  44. A Proof-Producing CSP Solver. [Citation Graph (, )][DBLP]


  45. Inference Rules for Proving the Equivalence of Recursive Procedures. [Citation Graph (, )][DBLP]


  46. Regression Verification: Proving the Equivalence of Similar Programs. [Citation Graph (, )][DBLP]


  47. Translation Validation: From Simulink to C. [Citation Graph (, )][DBLP]


  48. Regression verification. [Citation Graph (, )][DBLP]


  49. Beyond Vacuity: Towards the Strongest Passing Formula. [Citation Graph (, )][DBLP]


  50. A Theory-Based Decision Heuristic for DPLL(T). [Citation Graph (, )][DBLP]


  51. Decision diagrams for linear arithmetic. [Citation Graph (, )][DBLP]


  52. Linear-Time Reductions of Resolution Proofs. [Citation Graph (, )][DBLP]


  53. Local Restarts. [Citation Graph (, )][DBLP]


  54. Regression Verification - A Practical Way to Verify Programs. [Citation Graph (, )][DBLP]


  55. Inference rules for proving the equivalence of recursive procedures. [Citation Graph (, )][DBLP]


  56. Generating Minimum Transitivity Constraints in P-time for Deciding Equality Logic. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.007secs
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