Mining complex boolean expressions for sequential equivalence checking

Neha Goel, Michael S. Hsiao, Narendran Ramakrishnan, Mohammed J. Zaki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

We propose a novel technique to mine powerful and generalized boolean relations among flip-flops in a sequential circuit for sequential equivalence checking. In contrast to traditional learning methods, our mining algorithm can detect inductive invariants as well as illegal state cubes. These invariants can be arbitrary boolean expressions and can thus prune a large don't care space during equivalence checking. Experimental results demonstrate that these general invariants can be very effective for sequential equivalence checking of circuits with no or very few equivalent signals between them, with low computational costs.

Original languageEnglish
Title of host publicationProceedings - 2010 19th IEEE Asian Test Symposium, ATS 2010
Pages442-447
Number of pages6
DOIs
Publication statusPublished - 1 Dec 2010
Event2010 19th IEEE Asian Test Symposium, ATS 2010 - Shanghai, China
Duration: 1 Dec 20104 Dec 2010

Publication series

NameProceedings of the Asian Test Symposium
ISSN (Print)1081-7735

Other

Other2010 19th IEEE Asian Test Symposium, ATS 2010
CountryChina
CityShanghai
Period1/12/104/12/10

    Fingerprint

Keywords

  • BLOSOM
  • Induction based proof
  • Re-descriptions
  • Sequential equivalence checking

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Goel, N., Hsiao, M. S., Ramakrishnan, N., & Zaki, M. J. (2010). Mining complex boolean expressions for sequential equivalence checking. In Proceedings - 2010 19th IEEE Asian Test Symposium, ATS 2010 (pp. 442-447). [5692286] (Proceedings of the Asian Test Symposium). https://doi.org/10.1109/ATS.2010.81