12 results on '"Mishchenko, Alan"'
Search Results
2. ABC: An Academic Industrial-Strength Verification Tool
- Author
-
Brayton, Robert, Mishchenko, Alan, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Touili, Tayssir, editor, Cook, Byron, editor, and Jackson, Paul, editor
- Published
- 2010
- Full Text
- View/download PDF
3. Applying Logic Synthesis for Speeding Up SAT
- Author
-
Een, Niklas, Mishchenko, Alan, Sörensson, Niklas, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Marques-Silva, João, editor, and Sakallah, Karem A., editor
- Published
- 2007
- Full Text
- View/download PDF
4. A Simulation-Guided Paradigm for Logic Synthesis and Verification.
- Author
-
Lee, Siang-Yun, Riener, Heinz, Mishchenko, Alan, Brayton, Robert K., and De Micheli, Giovanni
- Subjects
LOGIC design ,CONFIRMATION (Logic) ,COMBINATIONAL circuits ,MATHEMATICAL optimization ,LOGIC circuits ,BOOLEAN functions - Abstract
This article proposes a new logic synthesis and verification paradigm based on circuit simulation. In this paradigm, high quality, expressive simulation patterns are pregenerated to be reused in multiple runs of optimization and verification algorithms, resulting in reduced time-consuming Boolean computations such as satisfiability (SAT) solving. Methods to generate expressive simulation patterns are presented and compared, and a bit-packing technique to compress them is integrated into the implementation. The generated patterns are shown to be reusable across different algorithms and after network function modifications. A logic synthesis algorithm, Boolean resubstitution, and a verification algorithm, combinational equivalence checking, are two examples of using this paradigm. In simulation-guided Boolean resubstitution, simulation patterns are used for efficient filtering of optimization choices, leading to a lower cost in expanding the search space. By adopting the proposed paradigm, we achieve a 5.9% reduction in the number of AIG nodes, compared to 3.7% by a state-of-the-art resubstitution algorithm, within comparable runtime. In simulation-guided equivalence checking, the number of SAT solver calls is reduced by 9.5% with the use of the expressive simulation patterns accumulated in earlier logic synthesis stages. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
5. Three-Input Gates for Logic Synthesis.
- Author
-
Marakkalage, Dewmini Sudara, Testa, Eleonora, Riener, Heinz, Mishchenko, Alan, Soeken, Mathias, and De Micheli, Giovanni
- Subjects
LOGIC design ,LOGIC circuits ,REPRESENTATIONS of graphs ,BOOLEAN functions ,GRAPH algorithms - Abstract
Most logic synthesis algorithms work on graph representations of logic functions with nodes associated with arbitrary logic expressions or simple logic functions and iteratively optimize such graphs. While recent multilevel logic synthesis efforts focused primarily on graphs with 2-input nodes such as AND and OR gates, the recently proposed paradigm of Majority-Inverter Graphs (MIGs) instead uses the 3-input Majority gate as the node function. As this technique proved to be a success, it is natural to ask: are there other 3-input gates better suited for logic synthesis? Motivated by this question, we investigate the relative advantages of 3-input gates as constituents of logic networks. We consider representative gates from each of the ten nondegenerate 3-input NPN classes and study how powerful they are at representing Boolean functions. Using SAT-based exact synthesis, we evaluate each 3-input gate using the minimum number of such gates (together with inverters) needed to synthesize all 4-input Boolean functions and a subset of frequent 5-input and 6-input Boolean functions. We show that the logic gate $\mathrm {Dot}(x,y,z) \mathrel {\mathrel {\mathop:}\hspace {-0.0672em}=} x \oplus (z \lor xy)$ outperforms the rest in terms of expressive power. We further confirm this observation by showing that Dot-Inverter Graph representations are more than 14% smaller as compared to MIG representations of EPFL benchmarks. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
6. SAT-Based Exact Synthesis: Encodings, Topology Families, and Parallelism.
- Author
-
Haaswijk, Winston, Soeken, Mathias, Mishchenko, Alan, and De Micheli, Giovanni
- Subjects
LOGIC design ,SYMMETRY breaking ,TOPOLOGY ,ENCODING ,TECHNOLOGICAL innovations ,CRYPTOGRAPHY - Abstract
Exact synthesis is a versatile logic synthesis technique with applications to logic optimization, technology mapping, synthesis for emerging technologies, and cryptography. In recent years, advances in SAT solving have led to a heightened research effort into SAT-based exact synthesis. Advantages of exact synthesis include the use of various constraints (e.g., synthesis of emerging technology circuits). However, although progress has been made, its runtime remains unpredictable. This paper identifies two key points as hurdles to further progress. First, there are open questions regarding the design and implementation of exact synthesis systems, due to the many degrees of freedom. For example, there are different CNF encodings, different symmetry breaks to choose from, and different encodings may be suitable for different domains. Second, SAT-based exact synthesis is difficult to parallelize. Indeed, this is a common drawback of logic synthesis algorithms. This paper proposes four ways to close some open questions and to reduce runtime: 1) quantifying differences between CNF encoding schemes and their impacts on runtime; 2) demonstrating impact of symmetry breaking constraints; 3) showing how directed acyclic graph topology information can be used to decrease runtime; and 4) showing how topology information can be used to leverage parallelism. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
7. Effective Logic Synthesis for Threshold Logic Circuit Design.
- Author
-
Neutzling, Augusto, Matos, Jody Maick, Mishchenko, Alan, Reis, Andre, and Ribas, Renato P.
- Subjects
LOGIC circuits ,BOOLEAN functions ,FIELD programmable gate arrays ,DIGITAL electronics ,NANOTECHNOLOGY - Abstract
This paper presents a novel and effective logic synthesis flow able to identify threshold logic functions during the technology mapping process. It provides more efficient logic covering, exploring also redundant cuts. Moreover, the proposed design flow takes into account different circuit area estimations, such as the sum of input weights and threshold values, the gate fanin and the number of threshold logic gates. As a result, the mapped circuits present a reduction up to 47% and 67% in area and logic depth, respectively, in comparison to the most recent related approaches. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
8. m -Inductive Property of Sequential Circuits.
- Author
-
Savoj, Hamid, Mishchenko, Alan, and Brayton, Robert
- Subjects
- *
MATHEMATICAL optimization , *ALGORITHMS , *BOOLEAN functions , *SEQUENTIAL circuits , *CONFIRMATION (Logic) , *COMPUTER science - Abstract
This paper introduces m -inductiveness over a set of nodes S in sequential circuits. The m -inductive property can be used for equivalence-checking or improved sequential optimization. It allows the behavior of many next state functions (not in S ) to be changed while maintaining correctness at the primary outputs of a circuit. As such, it creates flexibility that can be used for sequential optimization. It is shown that the number of nodes in S is reduced as m, the parameter for the inductiveness, increases. We provide an algorithm for finding a minimal set S , as well as one for using m -inductiveness in optimization. We give examples of such optimized circuits and show that m -inductive-based optimization can result in significant area reduction when applied to industrial designs. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
9. Sequential Equivalence Checking for Clock-Gated Circuits.
- Author
-
Savoj, Hamid, Mishchenko, Alan, and Brayton, Robert
- Subjects
- *
COMPUTER software development , *COMPUTER storage devices , *INTEGRATED circuits , *MODULES (Algebra) , *COMBINATIONAL circuits - Abstract
Sequential logic synthesis often leads to substantially easier equivalence checking problems, compared to general-case sequential equivalence checking (SEC). This paper theoretically investigates when SEC can be reduced to a combinational equivalence checking (CEC) problem. It shows how the theory can be applied when sequential transforms are used, such as sequential clock gating, retiming, and redundancy removal. The legitimacy of such transforms is typically justified intuitively, by the designer or software developer believing that the two circuits reach the same state after a finite number of cycles, and no difference is observed at the outputs due to fanin non-controllability and fanout non-observability effects. [ABSTRACT FROM PUBLISHER]
- Published
- 2014
- Full Text
- View/download PDF
10. A Theory of Nondeterministic Networks.
- Author
-
Mishchenko, Alan and Brayton, Robert K.
- Subjects
- *
SIMULATION methods & models , *COMPUTER-aided design , *ALGORITHMS , *COMPUTER programming , *MATHEMATICAL analysis - Abstract
Both nondeterminism and multilevel networks can be used to compactly characterize logic structures as well as all the flexibilities allowed for optimizing them. Synthesis results can be improved by allowing the manipulation of a larger class of networks called nondeterministic (ND) networks. These are multilevel logic networks that embody both nondeterminism and multivalued (MVI signals and, thus, enhance compactness and expressiveness. In this paper, a complete theory for representing and manipulating ND networks is developed. It is shown that an ND network's behavior can be classified into at least three types, all of which coalesce when the network becomes deterministic. The theory addresses the classical transformations commonly applied to optimize deterministic binary networks, such as node minimization, elimination, and decomposition. These are analyzed with respect to their effects on each type of network behavior, leading to modifications of some operations to make them safe, i.e., guaranteeing that the new behavior remains within the network's specification. Finally, it is proved that all three types of behaviors can be used in a hierarchical-synthesis paradigm. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
11. Linear Cofactor Relationships in Boolean Functions.
- Author
-
Zhang, Jin S., Chrzanowska-Jeske, Malgorzata, Mishchenko, Alan, and Burch, Jerry R.
- Subjects
LOGIC circuits ,ELECTRONIC circuits ,ALGORITHMS ,COMPUTER programming ,MATHEMATICAL analysis ,DIGITAL electronics - Abstract
This paper describes linear cofactor relationships (LCRs), which are defined as the exclusive sums of cofactors with respect to a pair of variables in Boolean functions. These relationships subsume classical symmetries and single-variable symmetries. The paper proposes an efficient algorithm to detect LCRs and discusses their potential applications in Boolean matching, minimization of decision diagrams, synthesis of regular layout-friendly logic circuits, and detection of support-reducing bound sets. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
12. Using Simulation and Satisfiability to Compute Flexibilities in Boolean Networks.
- Author
-
Mishchenko, Alan, Zhang, Jin S., Sinha, Subarna, Burch, Jerry R., Brayton, Robert, and Chrzanowska-Jeske, Malgorzata
- Subjects
- *
LOGIC circuits , *SATISFACTION , *SIMULATION methods & models , *COMPUTER science , *MATHEMATICAL functions , *BINARY number system - Abstract
Simulation and Boolean satisfiability (SAT) checking are common techniques used in logic verification. This paper shows how simulation and satisfiability (S&S) can be tightly integrated to efficiently compute flexibilities in a multilevel Boolean network, including the following: 1) complete "don't cares" (CDCs); 2) sets of pairs of functions to be distinguished (SPFDs); and 3) sets of candidate nodes for resubstitution. These flexibilities can be used in network optimization to change the network structure while preserving its functionality. In the first two applications, simulation quickly enumerates most of the solutions while SAT detects the remaining solutions. In the last application, simulation efficiently filters out most of the infeasible solutions while SAT checks the remaining candidates. The experimental results confirm that the combination of simulation and SAT offers a computation engine that outperforms binary decision diagrams, which are traditionally used in such applications. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.