NDLI: Are BDDs still alive within sequential verification?

Content Provider	Springer Nature Link
Author	Cabodi, Gianpiero cco, Sergio Quer, Stefa
Copyright Year	2005
Abstract	This work proposes a fully BDD-based approach based on: mixing forward and backward traversals, dovetailing approximate and exact methods, adopting guided and partitioned searches, and using conjunctive decompositions and generalized-cofactor-based BDD simplifications. The method is exact, i.e., it does not produce false negatives or positives, and reaps relevant performance enhancements from an appropriate tradeoff among the component methodologies.The resulting verification strategy is able, on one hand, to improve standard BDD-based algorithms, and, on the other hand, to compete with SAT-based tools on a broader range of circuit sizes.We experimentally compare our approach with three state-of-the-art freely available techniques. The first and second ones are SAT-based strategies, i.e., bounded model checking implemented within the NuSMV and the VIS tools (using Chaff as SAT engine). The third one is a BDD-based methodology, i.e., approximate reachability don’t cares model checking implemented within the VIS tool. Results show interesting improvements in terms of both efficiency and power. They demonstrate how BDDs are able to accomplish larger verification tasks and to efficiently deal with high sequential depths.
Starting Page	129
Ending Page	142
Page Count	14
File Format	PDF
ISSN	14332779
Journal	International Journal on Software Tools for Technology Transfer
Volume Number	7
Issue Number	2
e-ISSN	14332787
Language	English
Publisher	Springer Berlin Heidelberg
Publisher Date	2005-01-25
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Binary Decision Diagrams Approximate-reachability Satisfiability solvers Model checking Software Engineering Software Engineering/Programming and Operating Systems Theory of Computation
Content Type	Text
Resource Type	Article
Subject	Information Systems 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

Decision-diagram-based techniques for bounded reachability checking of asynchronous systems

A BMC-based formulation for the scheduling problem of hardware systems

Probabilistic symbolic model checking with PRISM: a hybrid approach

Data decision diagrams for Promela systems analysis

Test sequence generation and model checking using dynamic transition relations

Satisfiability checking using Boolean Expression Diagrams

Accelerating temporal verification of Simulink diagrams using satisfiability modulo theories

Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure

BDD-based software verification : Applications to event-condition-action systems

Are BDDs still alive within sequential verification?

Similar Documents

Decision-diagram-based techniques for bounded reachability checking of asynchronous systems

A BMC-based formulation for the scheduling problem of hardware systems

Probabilistic symbolic model checking with PRISM: a hybrid approach

Data decision diagrams for Promela systems analysis

Test sequence generation and model checking using dynamic transition relations

Satisfiability checking using Boolean Expression Diagrams

Accelerating temporal verification of Simulink diagrams using satisfiability modulo theories

Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure

BDD-based software verification : Applications to event-condition-action systems

Are BDDs still alive within sequential verification?