Ofer Strichman

From MaRDI portal


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Specifiable robustness in reactive synthesis
Formal Methods in System Design
2023-05-08Paper
Accelerated deletion-based extraction of minimal unsatisfiable cores
Journal on Satisfiability, Boolean Modeling and Computation
2021-12-09Paper
Vacuity in synthesis
Formal Methods in System Design
2021-12-08Paper
Real-time solving of computationally hard problems using optimal algorithm portfolios
Annals of Mathematics and Artificial Intelligence
2021-08-02Paper
Learning the language of software errors
Journal of Artificial Intelligence Research
2020-05-14Paper
Regression verification for unbalanced recursive functions
 
2020-01-03Paper
Cyclic-routing of unmanned aerial vehicles
Journal of Computer and System Sciences
2019-06-25Paper
Proof-guided underapproximation-widening for multi-process systems
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
2017-07-14Paper
Decision procedures. An algorithmic point of view
Texts in Theoretical Computer Science. An EATCS Series
2017-03-30Paper
Synthesizing non-vacuous systems
Lecture Notes in Computer Science
2017-02-21Paper
Learning general constraints in CSP
Artificial Intelligence
2016-09-07Paper
Learning General Constraints in CSP
Integration of AI and OR Techniques in Constraint Programming
2016-07-25Paper
Cyclic routing of unmanned aerial vehicles
Integration of AI and OR Techniques in Constraint Programming
2016-06-27Paper
Regression verification for multi-threaded programs (with extensions to locks and dynamic thread creation)
Formal Methods in System Design
2016-02-25Paper
Model counting of monotone conjunctive normal form formulas with spectra
INFORMS Journal on Computing
2016-01-25Paper
Learning the Language of Error
Automated Technology for Verification and Analysis
2016-01-08Paper
Mining backbone literals in incremental SAT. A new kind of incremental data
Lecture Notes in Computer Science
2015-11-20Paper
Proving mutual termination
Formal Methods in System Design
2015-10-20Paper
Compositional sequentialization of periodic programs
Lecture Notes in Computer Science
2014-11-03Paper
Ultimately incremental SAT
Lecture Notes in Computer Science
2014-09-26Paper
Beyond vacuity: towards the strongest passing formula
Formal Methods in System Design
2014-06-30Paper
Generating minimum transitivity constraints in P-time for deciding equality logic
Electronic Notes in Theoretical Computer Science
2013-12-06Paper
Reduced functional consistency of uninterpreted functions
 
2013-09-26Paper
Preprocessing in incremental SAT
Theory and Applications of Satisfiability Testing – SAT 2012
2013-08-12Paper
Regression verification for multi-threaded programs
Lecture Notes in Computer Science
2012-06-15Paper
Linear completeness thresholds for bounded model checking
Computer Aided Verification
2011-08-19Paper
Faster Extraction of High-Level Minimal Unsatisfiable Cores
Theory and Applications of Satisfiability Testing - SAT 2011
2011-06-17Paper
Variants of LTL query checking
Hardware and Software: Verification and Testing
2011-04-06Paper
Inference rules for proving the equivalence of recursive procedures
Time for Verification
2010-09-07Paper
Underapproximation for model-checking based on universal circuits
Information and Computation
2010-04-08Paper
Predicate abstraction with minimum predicates
Lecture Notes in Computer Science
2010-02-05Paper
A framework for satisfiability modulo theories
Formal Aspects of Computing
2009-11-13Paper
\textsc{HaifaSat}: a SAT solver based on an abstraction/refinement model
 
2009-10-12Paper
Before and after vacuity
Formal Methods in System Design
2009-07-06Paper
An approach for extracting a small unsatisfiable core
Formal Methods in System Design
2009-07-06Paper
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science
2009-05-15Paper
Inference rules for proving the equivalence of recursive procedures
Acta Informatica
2008-08-19Paper
Three optimizations for assume-guarantee reasoning with \(L^{*}\)
Formal Methods in System Design
2008-07-30Paper
Local Restarts
Theory and Applications of Satisfiability Testing – SAT 2008
2008-05-27Paper
Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
Texts in Theoretical Computer Science. An EATCS Series
2008-02-27Paper
Underapproximation for Model-Checking Based on Random Cryptographic Constructions
Computer Aided Verification
2007-11-29Paper
Optimized L*-Based Assume-Guarantee Reasoning
Tools and Algorithms for the Construction and Analysis of Systems
2007-09-03Paper
Deciding Bit-Vector Arithmetic with Abstraction
Tools and Algorithms for the Construction and Analysis of Systems
2007-09-03Paper
Hardware and Software, Verification and Testing
Lecture Notes in Computer Science
2007-02-12Paper
Building small equality graphs for deciding equality logic with uninterpreted functions
Information and Computation
2006-04-28Paper
Computer Aided Verification
Lecture Notes in Computer Science
2006-01-10Paper
Computer Aided Verification
Lecture Notes in Computer Science
2006-01-10Paper
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science
2005-12-15Paper
Computer Aided Verification
Lecture Notes in Computer Science
2005-08-25Paper
Computer Aided Verification
Lecture Notes in Computer Science
2005-08-25Paper
Efficient verification of sequential and concurrent C programs
Formal Methods in System Design
2004-11-22Paper
Accelerating bounded model checking of safety properties
Formal Methods in System Design
2004-09-09Paper
scientific article; zbMATH DE number 1979549 (Why is no real title available?)
 
2003-09-14Paper
scientific article; zbMATH DE number 1953038 (Why is no real title available?)
 
2003-07-25Paper
scientific article; zbMATH DE number 1903358 (Why is no real title available?)
 
2003-05-01Paper
scientific article; zbMATH DE number 1903355 (Why is no real title available?)
 
2003-05-01Paper
The small model property: How small can it be?
Information and Computation
2003-01-14Paper


Research outcomes over time


This page was built for person: Ofer Strichman