Alexander Ivrii

According to our database1, Alexander Ivrii authored at least 26 papers between 2011 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Exploiting Isomorphic Subgraphs in SAT (Long version).
CoRR, 2021

Exploiting Isomorphic Subgraphs in SAT.
Proceedings of the Formal Methods in Computer Aided Design, 2021

IC3 with Internal Signals.
Proceedings of the Formal Methods in Computer Aided Design, 2021

2020
Late Breaking Results: FRIENDS - Finding Related Interesting Events via Neighbor Detection.
Proceedings of the 57th ACM/IEEE Design Automation Conference, 2020

2019
Input Elimination Transformations for Scalable Verification and Trace Reconstruction.
Proceedings of the 2019 Formal Methods in Computer Aided Design, 2019

Boosting Verification Scalability via Structural Grouping and Semantic Partitioning of Properties.
Proceedings of the 2019 Formal Methods in Computer Aided Design, 2019

2018
Finding All Minimal Safe Inductive Sets.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

k-FAIR = k-LIVENESS + FAIR Revisiting SAT-based Liveness Algorithms.
Proceedings of the 2018 Formal Methods in Computer Aided Design, 2018

2017
The Computational Complexity of Structure-Based Causality.
J. Artif. Intell. Res., 2017

K-induction without unrolling.
Proceedings of the 2017 Formal Methods in Computer Aided Design, 2017

Learning support sets in IC3 and Quip: The good, the bad, and the ugly.
Proceedings of the 2017 Formal Methods in Computer Aided Design, 2017

2016
On computing minimal independent support and its applications to sampling and counting.
Constraints An Int. J., 2016

The art of semi-formal bug hunting.
Proceedings of the 35th International Conference on Computer-Aided Design, 2016

Constrained Sampling and Counting: Universal Hashing Meets SAT Solving.
Proceedings of the Beyond NP, 2016

2015
Mining Backbone Literals in Incremental SAT - A New Kind of Incremental Data.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Speeding up MUS Extraction with Preprocessing and Chunking.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Pushing to the Top.
Proceedings of the Formal Methods in Computer-Aided Design, 2015

2014
Generating Modulo-2 Linear Invariants for Hardware Model Checking.
Proceedings of the Hardware and Software: Verification and Testing, 2014

Small inductive safe invariants.
Proceedings of the Formal Methods in Computer-Aided Design, 2014

2013
Using cross-entropy for satisfiability.
Proceedings of the 28th Annual ACM Symposium on Applied Computing, 2013

Generalized counterexamples to liveness properties.
Proceedings of the Formal Methods in Computer-Aided Design, 2013

2012
Perfect Hashing and CNF Encodings of Cardinality Constraints.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

On Efficient Computation of Variable MUSes.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Computing Interpolants without Proofs.
Proceedings of the Hardware and Software: Verification and Testing, 2012

IC3-guided abstraction.
Proceedings of the Formal Methods in Computer-Aided Design, 2012

2011
Incremental formal verification of hardware.
Proceedings of the International Conference on Formal Methods in Computer-Aided Design, 2011


  Loading...