Generalized Boolean symmetries through nested partition refinement

Authors:
Hadi Katebi;Karem A. Sakallah;Igor L. Markov
Affiliations:
University of Michigan - Ann Arbor;University of Michigan - Ann Arbor;University of Michigan - Ann Arbor
Venue:
Proceedings of the International Conference on Computer-Aided Design
Year:
2013

Citing 8
Cited 0

Generalized symmetries in boolean functions

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Symmetry detection for large Boolean functions using circuit representation, simulation, and satisfiability

Proceedings of the 43rd annual Design Automation Conference
Improvements to combinational equivalence checking

Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Postplacement rewiring by exhaustive search for functional symmetries

ACM Transactions on Design Automation of Electronic Systems (TODAES)
A unified approach to canonical form-based Boolean matching

Proceedings of the 44th annual Design Automation Conference
Conflict anticipation in the search for graph automorphisms

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
BDD minimization using symmetries

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Scalable sampling methodology for logic simulation: reduced-ordered Monte Carlo

Proceedings of the International Conference on Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

Combinatorial objects in EDA applications exhibit a great amount of complexity and typically defy polynomial-time algorithms. To achieve acceptable performance, EDA tools seek to exploit various structures found in these objects in practice. In this work, we explore symmetries of Boolean functions and develop a new algorithm based on nested partition refinement, abstract group theory and Boolean satisfiability. We apply our algorithm to solve large-scale Boolean matching.