Zobrazeno 1 - 10
of 170
pro vyhledávání: '"Strichman, Ofer"'
Model checking is an automatic formal verification technique that is widely used in hardware verification. The state-of-the-art complete model-checking techniques, based on IC3/PDR and its general variant CAR, are based on computing symbolically sets
Externí odkaz:
http://arxiv.org/abs/2411.00026
Given two programs $p_1$ and $p_2$, typically two versions of the same program, the goal of regression verification is to mark pairs of functions from $p_1$ and $p_2$ that are equivalent, given a definition of equivalence. The most common definition
Externí odkaz:
http://arxiv.org/abs/2207.14364
Autor:
Cohen, Dor, Strichman, Ofer
Over the last decade, Neural Networks (NNs) have been widely used in numerous applications including safety-critical ones such as autonomous systems. Despite their emerging adoption, it is well known that NNs are susceptible to Adversarial Attacks. H
Externí odkaz:
http://arxiv.org/abs/2207.08157
Autor:
Ivrii, Alexander, Strichman, Ofer
While static symmetry breaking has been explored in the SAT community for decades, only as of 2010 research has focused on exploiting the same discovered symmetry dynamically, during the run of the SAT solver, by learning extra clauses. The two metho
Externí odkaz:
http://arxiv.org/abs/2103.10267
Autor:
Cohen, Tomer, Finkelman, Lior, Grimberg, Gal, Shenhar, Gadi, Strichman, Ofer, Strichman, Yonatan, Yeger, Stav
We show that combining a prediction model (based on neural networks), with a new method of test pooling (better than the original Dorfman method, and better than double-pooling) called 'Grid', we can reduce the number of Covid-19 tests by 73%.
Externí odkaz:
http://arxiv.org/abs/2005.03453
Autor:
Cohen, Dor, Strichman, Ofer
In a recent article [Oh'15], Oh examined the impact of various key heuristics (e.g., deletion strategy, restart policy, decay factor, database reduction) in competitive SAT solvers. His key findings are that their expected success depends on whether
Externí odkaz:
http://arxiv.org/abs/1706.05637
Autor:
Strichman, Ofer
Disjunctive Linear Arithmetic (DLA) is a major decidable theory that is supported by almost all existing theorem provers. The theory consists of Boolean combinations of predicates of the form $\Sigma_{j=1}^{n}a_j\cdot x_j \le b$, where the coefficien
Externí odkaz:
http://arxiv.org/abs/cs/0402002
Autor:
Strichman, Ofer
Publikováno v:
Interfaces, 2017 Nov 01. 47(6), 537-554.
Externí odkaz:
https://www.jstor.org/stable/45154340
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.