default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Ivrii
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j3]Michele Nir Gavrielov, Alexander Ivrii, Shelly Garion:
Linear circuit synthesis using weighted Steiner trees. Quantum Inf. Comput. 24(9&10): 721-733 (2024)- 2017
- [j2]Gadi Aleksandrowicz, Hana Chockler
, Joseph Y. Halpern, Alexander Ivrii:
The Computational Complexity of Structure-Based Causality. J. Artif. Intell. Res. 58: 431-451 (2017) - 2016
- [j1]Alexander Ivrii, Sharad Malik, Kuldeep S. Meel, Moshe Y. Vardi:
On computing minimal independent support and its applications to sampling and counting. Constraints An Int. J. 21(1): 41-58 (2016)
Conference and Workshop Papers
- 2021
- [c24]Rohit Dureja, Arie Gurfinkel, Alexander Ivrii, Yakir Vizel:
IC3 with Internal Signals. FMCAD 2021: 63-71 - [c23]Alexander Ivrii, Ofer Strichman:
Exploiting Isomorphic Subgraphs in SAT. FMCAD 2021: 204-211 - 2020
- [c22]Raviv Gal, Haim Kermany, Alexander Ivrii, Ziv Nevo, Avi Ziv:
Late Breaking Results: FRIENDS - Finding Related Interesting Events via Neighbor Detection. DAC 2020: 1-2 - 2019
- [c21]Rohit Dureja, Jason Baumgartner, Alexander Ivrii, Robert Kanzelman, Kristin Y. Rozier:
Boosting Verification Scalability via Structural Grouping and Semantic Partitioning of Properties. FMCAD 2019: 1-9 - [c20]Raj Kumar Gajavelly, Jason Baumgartner, Alexander Ivrii, Robert L. Kanzelman, Shiladitya Ghosh:
Input Elimination Transformations for Scalable Verification and Trace Reconstruction. FMCAD 2019: 10-18 - 2018
- [c19]Alexander Ivrii, Ziv Nevo, Jason Baumgartner:
k-FAIR = k-LIVENESS + FAIR Revisiting SAT-based Liveness Algorithms. FMCAD 2018: 1-5 - [c18]Ryan Berryhill, Alexander Ivrii, Andreas G. Veneris:
Finding All Minimal Safe Inductive Sets. SAT 2018: 346-362 - 2017
- [c17]Ryan Berryhill, Alexander Ivrii, Neil Veira, Andreas G. Veneris:
Learning support sets in IC3 and Quip: The good, the bad, and the ugly. FMCAD 2017: 140-147 - [c16]Arie Gurfinkel, Alexander Ivrii:
K-induction without unrolling. FMCAD 2017: 148-155 - 2016
- [c15]Kuldeep S. Meel, Moshe Y. Vardi, Supratik Chakraborty, Daniel J. Fremont, Sanjit A. Seshia, Dror Fried, Alexander Ivrii, Sharad Malik:
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving. AAAI Workshop: Beyond NP 2016 - [c14]Pradeep Kumar Nalla, Raj Kumar Gajavelly, Jason Baumgartner, Hari Mony, Robert Kanzelman, Alexander Ivrii:
The art of semi-formal bug hunting. ICCAD 2016: 51 - 2015
- [c13]Arie Gurfinkel, Alexander Ivrii:
Pushing to the Top. FMCAD 2015: 65-72 - [c12]Valeriy Balabanov, Alexander Ivrii:
Speeding up MUS Extraction with Preprocessing and Chunking. SAT 2015: 17-32 - [c11]Alexander Ivrii, Vadim Ryvchin, Ofer Strichman:
Mining Backbone Literals in Incremental SAT - A New Kind of Incremental Data. SAT 2015: 88-103 - 2014
- [c10]Gadi Aleksandrowicz, Hana Chockler, Joseph Y. Halpern, Alexander Ivrii:
The Computational Complexity of Structure-Based Causality. AAAI 2014: 974-980 - [c9]Alexander Ivrii, Arie Gurfinkel, Anton Belov:
Small inductive safe invariants. FMCAD 2014: 115-122 - [c8]Gadi Aleksandrowicz, Alexander Ivrii, Oded Margalit, Dan Rasin:
Generating Modulo-2 Linear Invariants for Hardware Model Checking. Haifa Verification Conference 2014: 54-67 - 2013
- [c7]Gadi Aleksandrowicz, Jason Baumgartner, Alexander Ivrii, Ziv Nevo:
Generalized counterexamples to liveness properties. FMCAD 2013: 169-180 - [c6]Hana Chockler, Alexander Ivrii, Arie Matsliah, Simone Fulvio Rollini, Natasha Sharygina:
Using cross-entropy for satisfiability. SAC 2013: 1196-1203 - 2012
- [c5]Jason Baumgartner, Alexander Ivrii, Arie Matsliah, Hari Mony:
IC3-guided abstraction. FMCAD 2012: 182-185 - [c4]Hana Chockler, Alexander Ivrii, Arie Matsliah:
Computing Interpolants without Proofs. Haifa Verification Conference 2012: 72-85 - [c3]Anton Belov, Alexander Ivrii, Arie Matsliah, João Marques-Silva:
On Efficient Computation of Variable MUSes. SAT 2012: 298-311 - [c2]Yael Ben-Haim, Alexander Ivrii, Oded Margalit, Arie Matsliah:
Perfect Hashing and CNF Encodings of Cardinality Constraints. SAT 2012: 397-409 - 2011
- [c1]Hana Chockler, Alexander Ivrii, Arie Matsliah, Shiri Moran, Ziv Nevo:
Incremental formal verification of hardware. FMCAD 2011: 135-143
Informal and Other Publications
- 2024
- [i4]Henry Zou, Matthew Treinish, Kevin Hartman, Alexander Ivrii, Jake Lishman:
LightSABRE: A Lightweight and Enhanced SABRE Algorithm. CoRR abs/2409.08368 (2024) - 2021
- [i3]Alexander Ivrii, Ofer Strichman:
Exploiting Isomorphic Subgraphs in SAT (Long version). CoRR abs/2103.10267 (2021) - 2015
- [i2]Kuldeep S. Meel, Moshe Y. Vardi, Supratik Chakraborty, Daniel J. Fremont, Sanjit A. Seshia, Dror Fried, Alexander Ivrii, Sharad Malik:
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving. CoRR abs/1512.06633 (2015) - 2014
- [i1]Gadi Aleksandrowicz, Hana Chockler, Joseph Y. Halpern, Alexander Ivrii:
The Computational Complexity of Structure-Based Causality. CoRR abs/1412.3076 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
