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 of the Asian Test Symposium
Pages442-447
Number of pages6
DOIs
Publication statusPublished - 1 Dec 2010
Externally publishedYes
Event2010 19th IEEE Asian Test Symposium, ATS 2010 - Shanghai, China
Duration: 1 Dec 20104 Dec 2010

Other

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

Fingerprint

Sequential circuits
Flip flop circuits
Networks (circuits)
Costs

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 of the Asian Test Symposium (pp. 442-447). [5692286] https://doi.org/10.1109/ATS.2010.81

Mining complex boolean expressions for sequential equivalence checking. / Goel, Neha; Hsiao, Michael S.; Ramakrishnan, Narendran; Zaki, Mohammed J.

Proceedings of the Asian Test Symposium. 2010. p. 442-447 5692286.

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

Goel, N, Hsiao, MS, Ramakrishnan, N & Zaki, MJ 2010, Mining complex boolean expressions for sequential equivalence checking. in Proceedings of the Asian Test Symposium., 5692286, pp. 442-447, 2010 19th IEEE Asian Test Symposium, ATS 2010, Shanghai, China, 1/12/10. https://doi.org/10.1109/ATS.2010.81
Goel N, Hsiao MS, Ramakrishnan N, Zaki MJ. Mining complex boolean expressions for sequential equivalence checking. In Proceedings of the Asian Test Symposium. 2010. p. 442-447. 5692286 https://doi.org/10.1109/ATS.2010.81
Goel, Neha ; Hsiao, Michael S. ; Ramakrishnan, Narendran ; Zaki, Mohammed J. / Mining complex boolean expressions for sequential equivalence checking. Proceedings of the Asian Test Symposium. 2010. pp. 442-447
@inproceedings{2da9b6bab4d24488811e3bc96a93a91f,
title = "Mining complex boolean expressions for sequential equivalence checking",
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.",
keywords = "BLOSOM, Induction based proof, Re-descriptions, Sequential equivalence checking",
author = "Neha Goel and Hsiao, {Michael S.} and Narendran Ramakrishnan and Zaki, {Mohammed J.}",
year = "2010",
month = "12",
day = "1",
doi = "10.1109/ATS.2010.81",
language = "English",
isbn = "9780769542485",
pages = "442--447",
booktitle = "Proceedings of the Asian Test Symposium",

}

TY - GEN

T1 - Mining complex boolean expressions for sequential equivalence checking

AU - Goel, Neha

AU - Hsiao, Michael S.

AU - Ramakrishnan, Narendran

AU - Zaki, Mohammed J.

PY - 2010/12/1

Y1 - 2010/12/1

N2 - 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.

AB - 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.

KW - BLOSOM

KW - Induction based proof

KW - Re-descriptions

KW - Sequential equivalence checking

UR - http://www.scopus.com/inward/record.url?scp=79951616830&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79951616830&partnerID=8YFLogxK

U2 - 10.1109/ATS.2010.81

DO - 10.1109/ATS.2010.81

M3 - Conference contribution

SN - 9780769542485

SP - 442

EP - 447

BT - Proceedings of the Asian Test Symposium

ER -