Article

Multi-threaded reachability

Authors:

Debashis Sahoo,

Subramanian K. Iyer,

E. Allen EmersonAuthors Info & Claims

DAC '05: Proceedings of the 42nd annual Design Automation Conference

Pages 467 - 470

https://doi.org/10.1145/1065579.1065701

Published: 13 June 2005 Publication History

Abstract

Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. Such algorithms can be at times ineffective as they suffer from the problem of scheduling the relative order in which the partitions are processed. In this paper we present a novel multi-threaded reachability algorithm that avoids this scheduling problem while increasing the latent parallelism in partitioned state space traversal. We show that in most cases our method is significantly faster than both the standard reachability algorithm as well as the existing partitioned approaches. The gains are further magnified when our threaded implementation is evaluated in the context of a parallel framework.

References

[1]

R. Bryant. Graph-based Algorithms for Boolean Function Manipulation. IEEE Trans. Comput., C-35:677--691, 1986.

Digital Library

[2]

G. Cabodi, P. Camurati, L. Lavagno, and S. Quer. Disjunctive partitioning and partial iterative squaring: An effective approach for symbolic traversal of large circuits. In DAC, pages 728--733, 1997.

Digital Library

[3]

O. Coudert, C. Berthet, and J. C. Madre. Verification of sequential machines based on symbolic execution. In Proc. of the Workshop on Automatic Verification Methods for Finite State Systems, 1989.

Digital Library

[4]

H. Garavel, R. Mateescu, and I. Smarandache. Parallel state space construction for model-checking. In SPIN workshop on Model checking of software, pages 217--234. Springer-Verlag New York, Inc., 2001.

Digital Library

[5]

T. Heyman, D. Geist, O. Grumberg, and A. Schuster. Achieving scalability in parallel reachability analysis of very large circuits. In CAV, 2000.

Digital Library

[6]

S. Iyer, D. Sahoo, C. Stangier, A. Narayan, and J. Jain. Improved symbolic Verification Using Partitioning Techniques. In Proc. of CHARME 2003, volume 2860 of Lecture Notes in Computer Science, 2003.

[7]

J. Jain. et. al., Functional Partitioning for Verification and Related Problems. Brown/MIT VLSI Conference, 1992.

[8]

K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.

Digital Library

[9]

A. Narayan. et. al., Reachability Analysis Using Partitioned-ROBDDs. In ICCAD, pages 388--393, 1997.

Digital Library

[10]

C. Pixley and J. Havlicek. A verification synergy: Constraint-based verification. In Electronic Design Processes, 2003.

[11]

D. Sahoo and S. Iyer. et. al., A Partitioning Methodology for BDD-based Verification. In FMCAD, 2004.

[12]

F. Somenzi. CUDD: CU Decision Diagram Package ftp://vlsi.colorado.edu/pub, 2001.

[13]

U. Stern and D. L. Dill. Parallelizing the murphy verifier. In CAV, 1997.

Digital Library

[14]

T. Stornetta and F. Brewer. Implementation of an efficient parallel BDD package. In DAC, pages 641--644, 1996.

Digital Library

[15]

VIS. Verilog Benchmarks http://vlsi.colorado.edu/~vis/.

[16]

B. Yang and D. R. O'Hallaron. Parallel breadth-first bdd construction. In symposium on Principles and practice of parallel programming, pages 145--156. ACM Press, 1997.

Digital Library

Cited By

Oortwijn WDijk TPol JErdogmus HHavelund K(2017)Distributed binary decision diagrams for symbolic reachabilityProceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software10.1145/3092282.3092284(21-30)Online publication date: 13-Jul-2017
https://dl.acm.org/doi/10.1145/3092282.3092284
Dijk TPol J(2015)SylvanProceedings of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 903510.1007/978-3-662-46681-0_60(677-691)Online publication date: 11-Apr-2015
https://dl.acm.org/doi/10.1007/978-3-662-46681-0_60
Cohen ANamjoshi KSa'ar YZuck LKisyova K(2010)Parallelizing a symbolic compositional model-checking algorithmProceedings of the 6th international conference on Hardware and software: verification and testing10.5555/1987082.1987091(46-59)Online publication date: 4-Oct-2010
https://dl.acm.org/doi/10.5555/1987082.1987091
Show More Cited By

Index Terms

Multi-threaded reachability
1. Hardware
  1. Hardware validation
    1. Functional verification

Recommendations

Using forward reachability analysis for verification of timed petri nets

We consider verification of safety properties for concurrent real-timed systems modelled as timed Petri nets by performing symbolic forward reachability analysis. We introduce a formalism, called region generators, for representing sets of markings of ...
Predicate abstraction for reachability analysis of hybrid systems

Embedded systems are increasingly finding their way into a growing range of physical devices. These embedded systems often consist of a collection of software threads interacting concurrently with each other and with a physical, continuous environment. ...
Distributed binary decision diagrams for symbolic reachability
SPIN 2017: Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software

Decision diagrams are used in symbolic verification to concisely represent state spaces. A crucial symbolic verification algorithm is reachability: systematically exploring all reachable system states. Although both parallel and distributed reachability ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

DAC '05: Proceedings of the 42nd annual Design Automation Conference

June 2005

984 pages

ISBN:1595930582

DOI:10.1145/1065579

General Chair:
William H. Joyner
IBM Corp./SRC
,
Program Chairs:
Grant E. Martin
Tensilica, Inc.
,
Andrew B. Kahng
University of California at San Diego, CA

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

DAC05

Sponsor:

DAC05: The 42nd Annual Design Automation Conference 2005

June 13 - 17, 2005

California, Anaheim, USA

Acceptance Rates

Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25

Sponsor:
sigda

62nd ACM/IEEE Design Automation Conference

June 22 - 26, 2025

San Francisco , CA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
301
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Oortwijn WDijk TPol JErdogmus HHavelund K(2017)Distributed binary decision diagrams for symbolic reachabilityProceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software10.1145/3092282.3092284(21-30)Online publication date: 13-Jul-2017
https://dl.acm.org/doi/10.1145/3092282.3092284
Dijk TPol J(2015)SylvanProceedings of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 903510.1007/978-3-662-46681-0_60(677-691)Online publication date: 11-Apr-2015
https://dl.acm.org/doi/10.1007/978-3-662-46681-0_60
Cohen ANamjoshi KSa'ar YZuck LKisyova K(2010)Parallelizing a symbolic compositional model-checking algorithmProceedings of the 6th international conference on Hardware and software: verification and testing10.5555/1987082.1987091(46-59)Online publication date: 4-Oct-2010
https://dl.acm.org/doi/10.5555/1987082.1987091
Kunkle DSlavici VCooperman G(2010)Parallel disk-based computation for large, monolithic binary decision diagramsProceedings of the 4th International Workshop on Parallel and Symbolic Computation10.1145/1837210.1837222(63-72)Online publication date: 21-Jul-2010
https://dl.acm.org/doi/10.1145/1837210.1837222
Sahoo DJain JIyer SDill D(2005)A new reachability algorithm for symmetric multi-processor architectureProceedings of the Third international conference on Automated Technology for Verification and Analysis10.1007/11562948_5(26-38)Online publication date: 4-Oct-2005
https://dl.acm.org/doi/10.1007/11562948_5

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents