The following pages link to Ofer Strichman (Q246145):
Displaying 50 items.
- Learning general constraints in CSP (Q309921) (← links)
- Decision procedures. An algorithmic point of view (Q518892) (← links)
- Proving mutual termination (Q746783) (← links)
- Three optimizations for assume-guarantee reasoning with \(L^{*}\) (Q934701) (← links)
- Inference rules for proving the equivalence of recursive procedures (Q938300) (← links)
- Underapproximation for model-checking based on universal circuits (Q963058) (← links)
- An approach for extracting a small unsatisfiable core (Q1028724) (← links)
- Before and after vacuity (Q1028732) (← links)
- A framework for satisfiability modulo theories (Q1037239) (← links)
- The small model property: How small can it be? (Q1854568) (← links)
- Accelerating bounded model checking of safety properties (Q1878909) (← links)
- Efficient verification of sequential and concurrent C programs (Q1888200) (← links)
- Real-time solving of computationally hard problems using optimal algorithm portfolios (Q2043446) (← links)
- Vacuity in synthesis (Q2058393) (← links)
- Beyond vacuity: towards the strongest passing formula (Q2248090) (← links)
- Regression verification for unbalanced recursive functions (Q2281656) (← links)
- Cyclic-routing of unmanned aerial vehicles (Q2424667) (← links)
- Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant (Q2473386) (← links)
- Building small equality graphs for deciding equality logic with uninterpreted functions (Q2490118) (← links)
- Cyclic Routing of Unmanned Aerial Vehicles (Q2815100) (← links)
- Preprocessing in Incremental SAT (Q2843332) (← links)
- Reduced functional consistency of uninterpreted functions (Q2848689) (← links)
- Generating minimum transitivity constraints in P-time for deciding equality logic (Q2864399) (← links)
- Regression Verification for Multi-threaded Programs (Q2891406) (← links)
- Compositional Sequentialization of Periodic Programs (Q2926663) (← links)
- Synthesizing Non-Vacuous Systems (Q2961552) (← links)
- Faster Extraction of High-Level Minimal Unsatisfiable Cores (Q3007682) (← links)
- Linear Completeness Thresholds for Bounded Model Checking (Q3088266) (← links)
- (Q3181642) (← links)
- Ultimately Incremental SAT (Q3192067) (← links)
- Mining Backbone Literals in Incremental SAT (Q3453214) (← links)
- Learning the Language of Error (Q3460551) (← links)
- Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra (Q3466783) (← links)
- Local Restarts (Q3502714) (← links)
- Inference Rules for Proving the Equivalence of Recursive Procedures (Q3587255) (← links)
- (Q4414397) (← links)
- (Q4427902) (← links)
- (Q4804898) (← links)
- (Q4804901) (← links)
- Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores (Q5015593) (← links)
- Learning the Language of Software Errors (Q5109907) (← links)
- Proof-guided underapproximation-widening for multi-process systems (Q5276140) (← links)
- Computer Aided Verification (Q5312895) (← links)
- Computer Aided Verification (Q5312909) (← links)
- Variants of LTL Query Checking (Q5391524) (← links)
- Underapproximation for Model-Checking Based on Random Cryptographic Constructions (Q5429328) (← links)
- Theory and Applications of Satisfiability Testing (Q5713736) (← links)
- Computer Aided Verification (Q5716541) (← links)
- Computer Aided Verification (Q5716573) (← links)
- Learning General Constraints in CSP (Q5741482) (← links)
