Ofer Strichman

Ofer Strichman's AcademicInfluence.com Rankings

Ofer Strichman

Computer Science

#10793

World Rank

#11367

Historical Rank

Database

#8708

World Rank

#9136

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Ofer Strichman Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Ofer Strichman is a professor of computational logic and computer science at the Davidson Industrial Engineering and Management, Technion – Israel Institute of Technology. He holds the Joseph Gruenblat chair in production engineering.

(See a Problem?)

Ofer Strichman's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Decision Procedures - An Algorithmic Point of View (2008) (431)
SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques (2002) (164)
Efficient Computation of Recurrence Diameters (2002) (149)
Deciding Bit-Vector Arithmetic with Abstraction (2007) (138)
Pruning Techniques for the SAT-Based Bounded Model Checking Problem (2001) (136)
Completeness and Complexity of Bounded Model Checking (2004) (136)
Regression verification (2009) (118)
Deciding Separation Formulas with SAT (2002) (116)
Tuning SAT Checkers for Bounded Model Checking (2000) (109)
Theory and Applications of Satisfiability Testing – SAT 2010 (2010) (93)
Deciding Equality Formulas by Small Domains Instantiations (1999) (80)
The Code Validation Tool (CVT) (1998) (77)
Efficient Verification of Sequential and Concurrent C Programs (2004) (73)
Proof-guided underapproximation-widening for multi-process systems (2005) (72)
Translation Validation for Synchronous Languages (1998) (69)
Inference rules for proving the equivalence of recursive procedures (2008) (69)
Regression Verification: Proving the Equivalence of Similar Programs (2009) (68)
The Small Model Property: How Small Can It Be? (2002) (66)
Accelerating Bounded Model Checking of Safety Properties (2004) (61)
Predicate Abstraction with Minimum Predicates (2003) (61)
Decision Procedures (2016) (60)
On Solving Presburger and Linear Arithmetic with SAT (2002) (60)
Explaining abstract counterexamples (2004) (58)
Faster Extraction of High-Level Minimal Unsatisfiable Cores (2011) (57)
SAT-based counterexample-guided abstraction refinement (2004) (55)
Computational challenges in bounded model checking (2005) (53)
Regression verification: proving the equivalence of similar programs (2013) (50)
Optimized L*-Based Assume-Guarantee Reasoning (2007) (49)
Translation Validation: From SIGNAL to C (1999) (49)
Abstraction-Based Satisfiability Solving of Presburger Arithmetic (2004) (46)
Linear-Time Reductions of Resolution Proofs (2009) (42)
Abstraction Refinement for Bounded Model Checking (2005) (41)
Regression Verification - A Practical Way to Verify Programs (2005) (40)
Linear Completeness Thresholds for Bounded Model Checking (2011) (38)
Translation Validation: From Simulink to C (2009) (37)
Regression Verification for Multi-threaded Programs (2012) (35)
Ultimately Incremental SAT (2014) (35)
Efficient MUS extraction with resolution (2013) (35)
Deriving Small Unsatisfiable Cores with Dominators (2006) (34)
Local Restarts (2008) (34)
Decision diagrams for linear arithmetic (2009) (33)
An abstraction-based decision procedure for bit-vector arithmetic (2009) (31)
Time-bounded analysis of real-time systems (2011) (30)
Learning the Language of Error (2015) (28)
Easier and More Informative Vacuity Checks (2007) (27)
An approach for extracting a small unsatisfiable core (2008) (27)
Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas (2005) (27)
Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores (2014) (26)
Minimal unsatisfiable core extraction for SMT (2016) (25)
HaifaSat: A New Robust SAT Solver (2005) (22)
Range Allocation for Separation Logic (2004) (22)
Beyond vacuity: towards the strongest passing formula (2008) (20)
Decision Procedures for Equality Logic and Uninterpreted Functions (2008) (19)
Before and after vacuity (2009) (17)
Learning general constraints in CSP (2015) (17)
Yet Another Decision Procedure for Equality Logic (2005) (17)
Finite Instantiations in Equivalence Logic with Uninterpreted Functions (2001) (16)
Regression Verification for Unbalanced Recursive Functions (2016) (16)
Cyclic Routing of Unmanned Aerial Vehicles (2019) (16)
Decision-Making with Cross-Entropy for Self-Adaptation (2017) (14)
A Proof-Producing CSP Solver (2010) (14)
Optimizations in Decision Procedures for Propositional Linear Inequalities (2002) (13)
Reducing the size of resolution proofs in linear time (2011) (13)
Three optimizations for Assume–Guarantee reasoning with L* (2008) (13)
Preprocessing in Incremental SAT (2012) (13)
Compositional Sequentialization of Periodic Programs (2013) (13)
A Theory-Based Decision Heuristic for DPLL(T) (2008) (11)
Variants of LTL Query Checking (2010) (10)
Results of SEI Line-Funded Exploratory New Starts Projects (2012) (9)
A New Class of Lineage Expressions over Probabilistic Databases Computable in P-Time (2013) (9)
Synthesizing Non-Vacuous Systems (2017) (9)
Building small equality graphs for deciding equality logic with uninterpreted functions (2006) (8)
Regression verification for multi-threaded programs (with extensions to locks and dynamic thread creation) (2015) (7)
Reduced Functional Consistency of Uninterpreted Functions (2005) (7)
Deciding a Combination of Theories (2008) (6)
Equality Logic and Uninterpreted Functions (2008) (6)
Verifying periodic programs with priority inheritance locks (2013) (6)
Cyclic Routing of Unmanned Air Vehicles (2014) (6)
Local Restarts in SAT (2008) (6)
A framework for Satisfiability Modulo Theories (2009) (6)
A probabilistic analysis of coverage methods (2011) (6)
Proving mutual termination (2015) (5)
Range Allocation for Equivalence Logic (2001) (5)
Erratum ("The small model property: how small can it be?" Volume 178, Number 1 [2002], pages 279-293) (2003) (5)
Synthesizing Reactive Systems Using Robustness and Recovery Specifications (2019) (5)
Learning the Language of Software Errors (2020) (4)
Translation Validation: From DC+ to C* (1998) (4)
Theory and Applications of Satisfiability Testing-- Sat 2010: 13th International Conference, Sat 2010 Edinburgh, Uk, July 2010: Proceedings (2010) (4)
Decision Procedures for Propositional Logic (2008) (4)
HaifaSat: a SAT solver based on an Abstraction/Refinement model (2008) (4)
Program Equivalence (Dagstuhl Seminar 18151) (2018) (4)
Generating Minimum Transitivity Constraints in P-time for Deciding Equality Logic (2008) (4)
Proving Mutual Termination of Programs (2012) (3)
Special issue: program equivalence (2018) (3)
Underapproximation for Model-Checking Based on Random Cryptographic Constructions (2007) (3)
A proof-producing CSP solver: A proof supplement (2010) (3)
Near-Optimal Course Scheduling at the Technion (2017) (3)
Proceedings of the 7th International Workshop on Satisfiability Modulo Theories (2009) (3)
Yet Another Decision Procedure for Equality Logic ( full version ) (2005) (2)
Deciding Disjunctive Linear Arithmetic with SAT (2004) (2)
Real-time solving of computationally hard problems using optimal algorithm portfolios (2020) (2)
Automated Repair of Neural Networks (2022) (1)
Linear-time Reductions of Resolution Proofs ( full version ) (2008) (1)
Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing (2010) (1)
Preprocessing in Incremental SAT A proof supplement (2012) (1)
Reducing Separation Formulas to Propositional Logic (2003) (1)
Mining Backbone Literals in Incremental SAT - A New Kind of Incremental Data (2015) (1)
A combination of 'pooling' with a prediction model can reduce by 73% the number of COVID-19 (Corona-virus) tests (2020) (1)
Tools and Algorithms for the Construction and Analysis of Systems (1995) (1)
Computational challenges in boundedmodel checking ∗ (2005) (1)
Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra (2015) (1)
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (2022) (0)
The Impact of Entropy and Solution Density on Selected SAT Heuristics (2017) (0)
Combining BMC and Complementary Approximate Reachability to Accelerate Bug-Finding (2022) (0)
Beyond vacuity: towards the strongest passing formula (2013) (0)
Learning general constraints in CSP ( long version ) (2014) (0)
Introduction and Basic Concepts (2008) (0)
Regression verification for multi-threaded programs (with extensions to locks and dynamic thread creation) (2015) (0)
Proving mutual termination (2015) (0)
Exploiting Isomorphic Subgraphs in SAT (2021) (0)
Efficient Decision Procedures for Validation (2010) (0)
Synthesizing Reactive Systems Using a Robustness Specification (2019) (0)
Exploiting Isomorphic Subgraphs in SAT (Long version) (2021) (0)
Preface (2006) (0)
Applications in Software Engineering and Computational Biology (2016) (0)
Preface (2003) (0)
Introductory paper (2005) (0)
Regression Verification for Multi-Threaded Programs ( long version ) (2011) (0)
Underapproximation for model-checking based on universal circuits (2010) (0)
Specifiable robustness in reactive synthesis (2022) (0)
A decision heuristic based on an Abstraction / Refinement model (0)
The 2006 Federated Logic (2006) (0)
Special issue: program equivalence (2018) (0)
Preface to the special issue “SI: Satisfiability Modulo Theories” (2012) (0)
2008 FORMAL METHODS IN COMPUTER-AIDED DESIGN (2008) (0)
Regression verification of unbalanced recursive functions with multiple calls (long version) (2022) (0)
Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design – FMCAD 2020 (2020) (0)
Vacuity in synthesis (2021) (0)
Optimal algorithm portfolios for computationally hard real-time problems (2019) (0)
Bounded Model Checking 1 (2003) (0)
SPECIAL S ECTION O N T OOLS A ND A LGORITHMS F OR THE C ONSTRUCTION A ND A NALYSIS O F S YSTEMS (2005) (0)
Optimizationsin DecisionProceduresfor Propositional LinearInequalities (2002) (0)
Preface to the special issue “SI: Satisfiability Modulo Theories” (2013) (0)
From Propositional to Quantifier-Free Theories (2016) (0)
Advances in counterexample-guided abstraction refinement (2003) (0)
Software Regression Verification (2013) (0)
Using Regression Verification to Revalidate Real-Time Software on Multicore Computers (2010) (0)

This paper list is powered by the following services:

Other Resources About Ofer Strichman

en.wikipedia.org

What Schools Are Affiliated With Ofer Strichman?

Ofer Strichman is affiliated with the following schools:

Weizmann Institute of Science