NDLI: On the verification of sequential equivalence

Content Provider	IEEE Xplore Digital Library
Author	Jiang, J.-H.R. Brayton, R.K.
Copyright Year	1982
Abstract	The state-explosion problem limits formal verification on large sequential circuits partly because the sizes of binary decision diagrams (BDDs) sizes heavily depend on the number of variables dealt with. In the worst case, a BDD size grows exponentially with the number of variables. Thus, reducing this number can possibly increase the verification capacity. In particular, this paper shows how sequential equivalence checking can be done in the sum state space. Given two finite state machines M/sub 1/ and M/sub 2/ with numbers of state variables m/sub 1/ and m/sub 2/, respectively, conventional formal methods verify equivalence by traversing the state space of the product machine with m/sub 1/+m/sub 2/ registers. In contrast, this paper introduces a different possibility, based on partitioning the state space defined by a multiplexed machine, which can have merely max{m/sub 1/,m/sub 2/}+1 registers. This substantial reduction in state variables potentially enables the verification of larger instances. Experimental results show the approach can verify benchmarks with up to 312 registers, including all of the control outputs of microprocessor 8085.
Sponsorship	IEEE Council on Electronic Design Automation IEEE Circuits and Systems Society
Starting Page	686
Ending Page	697
Page Count	12
File Size	857719
File Format	PDF
ISSN	02780070
Volume Number	22
Issue Number	6
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2003-06-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	State-space methods Data structures Boolean functions Formal verification Binary decision diagrams Automata Registers Sequential circuits Microprocessors Very large scale integration
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Electrical and Electronic Engineering Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Structural FSM traversal

An improved branch and bound algorithm for exact BDD minimization

Effect of improved lower bounds in dynamic BDD reordering

Circuit width, register allocation, and ordered binary decision diagrams

Arithmetic transforms for compositions of sequential and imprecise datapaths

Dependent-Latch Identification in Reachable State Space

Symbolic FSM traversals based on the transition relation

Improving symbolic reachability analysis by means of activity profiles

A theory and implementation of sequential hardware equivalence

On the verification of sequential equivalence

Similar Documents

Structural FSM traversal

An improved branch and bound algorithm for exact BDD minimization

Effect of improved lower bounds in dynamic BDD reordering

Circuit width, register allocation, and ordered binary decision diagrams

Arithmetic transforms for compositions of sequential and imprecise datapaths

Dependent-Latch Identification in Reachable State Space

Symbolic FSM traversals based on the transition relation

Improving symbolic reachability analysis by means of activity profiles

A theory and implementation of sequential hardware equivalence

On the verification of sequential equivalence