6 citations · 6 across the 4 of their papers we have counts for
6 papers
Logic Synthesis Meets Machine Learning: Trading Exactness for Generalization
Shubham Rai, Walter Lau Neto, Yukio Miyasaka +37
Logic synthesis is a fundamental step in hardware design whose goal is to find structural representations of Boolean functions while minimizing delay and area. If the function is c…
Simulation-Guided Boolean Resubstitution
Siang-Yun Lee, Heinz Riener, Alan Mishchenko +2
This paper proposes a new logic optimization paradigm based on circuit simulation, which reduces the need for Boolean computations such as SAT-solving or constructing BDDs. The pap…
Circuit-Based Intrinsic Methods to Detect Overfitting
Satrajit Chatterjee, Alan Mishchenko
The focus of this paper is on intrinsic methods to detect overfitting. By intrinsic methods, we mean methods that rely only on the model and the training data, as opposed to tradit…
A Single-Instance Incremental SAT Formulation of Proof- and Counterexample-Based Abstraction
Niklas Een, Alan Mishchenko, Nina Amla
This paper presents an efficient, combined formulation of two widely used abstraction methods for bit-level verification: counterexample-based abstraction (CBA) and proof-based abs…
Efficient Solution of Language Equations Using Partitioned Representations
Alan Mishchenko, Robert Brayton, Roland Jiang +2
A class of discrete event synthesis problems can be reduced to solving language equations f . X ⊆ S, where F is the fixed component and S the specification. Sequential synthes…
SAT-Based Complete Don't-Care Computation for Network Optimization
Alan Mishchenko, Robert K. Brayton
This paper describes an improved approach to Boolean network optimization using internal don't-cares. The improvements concern the type of don't-cares computed, their scope, and th…