#### Filter Results:

- Full text PDF available (301)

#### Publication Year

1963

2017

- This year (2)
- Last 5 years (38)
- Last 10 years (103)

#### Publication Type

#### Co-author

#### Publication Venue

#### Brain Region

#### Cell Type

#### Key Phrases

Learn More

- Ellen M. Sentovich, Kanwar Jit Singh, +6 authors Alberto Sangiovanni-Vincentelli
- 1992

SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logic-level description of a sequential circuit, it produces an optimized net-list in the target technology while preserving the sequential input-output behavior. Many different programs and algorithms have been… (More)

- Robert K. Brayton, Alan Mishchenko
- CAV
- 2010

ABC is a public-domain system for logic synthesis and formal verification of binary logic circuits appearing in synchronous hardware designs. ABC combines scalable logic transformations based on And-Inverter Graphs (AIGs), with a variety of innovative algorithms. A focus on the synergy of sequential synthesis and sequential verification leads to… (More)

- Robert K. Brayton, Gary D. Hachtel, +13 authors Tiziano Villa
- CAV
- 1996

Category: B Intended for publication in the formal proceedings. All appropriate clearances for the publication of this paper have been obtained, and if accepted the author will prepare the final manuscript in time for inclusion in the Conference Proceedings and will present the paper at the conference. Summary VIS (Verification Interacting with Synthesis)… (More)

We present a logical formalism for expressing properties of continuous time Markov chains. The semantics for such properties arise as a natural extension of previous work on discrete time Markov chains to continuous time. The major result is that the veriication problem is decidable; this is shown using results in algebraic and transcendental number theory.

- Paul R. Stephan, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli
- IEEE Trans. on CAD of Integrated Circuits and…
- 1996

— We present a robust and efficient algorithm for combina-tional test generation using a reduction to satisfiability (SAT). The algorithm , TEGUS, has the following features. We choose a form for the test set characteristic equation which minimizes its size. The simplified equation is solved by an algorithm for SAT using simple, but powerful, greedy… (More)

- Robert K. Brayton, Richard L. Rudell, Alberto L. Sangiovanni-Vincentelli, Albert R. Wang
- IEEE Transactions on Computer-Aided Design of…
- 1987

MIS is both an interactive and a batch-oriented multilevel logic synthesis and minimization system. MIS starts from the combinational logic extracted, typically, from a high-level description of a macrocell. It produces a multilevel set of optimized logic equations preserving the input-output behavior. The system includes both fast and slower (but more… (More)

- Niklas Eén, Alan Mishchenko, Robert K. Brayton
- FMCAD
- 2011

—Last spring, in March 2010, Aaron Bradley published the first truly new bit-level symbolic model checking algorithm since Ken McMillan's interpolation based model checking procedure introduced in 2003. Our experience with the algorithm suggests that it is stronger than interpolation on industrial problems , and that it is an important algorithm to study… (More)

- Adnan Aziz, Kumud Sanwal, Vigyan Singhal, Robert K. Brayton
- ACM Trans. Comput. Log.
- 2000

We present a logical formalism for expressing properties of continuous-time Markov chains. The semantics for such properties arise as a natural extension of previous work on discrete-time Markov chains to continuous time. The major result is that the verification problem is decidable; this is shown using results in algebraic and transcendental number theory.

- Alan Mishchenko, Satrajit Chatterjee, Robert K. Brayton
- IEEE Transactions on Computer-Aided Design of…
- 2006

The paper presents several improvements to state-of-the-art in FPGA technology mapping exemplified by a recent advanced technology mapper DAOmap [Chen and Cong, ICCAD '04]. Improved cut enumeration computes all K-feasible cuts without pruning for up to 7 inputs for the largest MCNC benchmarks. A new technique for on-the-fly cut dropping reduces by orders of… (More)