Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/339492.339567acmconferencesArticle/Chapter ViewAbstractPublication PagesiccadConference Proceedingsconference-collections
Article
Free access

Lazy group sifting for efficient symbolic state traversal of FSMs

Published: 07 November 1999 Publication History

Abstract

This paper proposes lazy group sifting for dynamic variable re-ordering during state traversal. The proposed method relaxes the idea of pairwise grouping of present state variables and their corresponding next state variables. This is done to produce better variable orderings during image computation without causing BDD size blowup in the substitution of next state variables with present state variables at the end of image computation. Experimental results show that our approach is more robust in state traversal than the approaches that either unconditionally group variable pairs or never group them.

References

[1]
O. Coudert, C. Berthet, and J. C. Madre. Verification of sequential machines using boolean functional vectors. In L. Claesen, editor, Proceedings IFIP International Workshop on Applied Formal Methods for Correct VLSI Design, pages 111-128, Leuven, Belgium, November 1989.
[2]
H. Touati, H. Savoj, B. Lin, R. K. Brayton, and A. Sangiovanni-Vincentelli. Implicit enumeration of finite state machines using BDD's. In Proceedings of the IEEE International Conference on Computer Aided Design, pages 130-133, November 1990.
[3]
J. R. Burch, E. M. Clarke, and D. E. Long. Representing circuits more efficiently in symbolic model checking. In Proceedings of the Design Automation Conference, pages 403-407, San Francisco, CA, June 1991.
[4]
G. Cabodi, R Camurati, and S. Quer. Improved reachability analysis of large finite state machines. In Proceedings of the International Conference on Computer-Aided Design, pages 354-360, Santa Clara, CA, November 1996.
[5]
A. Narayan, A. J. Isles, J. Jain, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. Reachability analysis using partitioned ROBDDs. In Proceedings of the International Conference on Computer-Aided Design, pages 388-393, November 1997.
[6]
S.-W. Jeong, B. Plessier, G. D. Hachtel, and F. Somenzi. Variable ordering and selection for FSM traversal. In Proceedings of the IEEE International Conference on Computer Aided Design, pages 476-479, Santa Clara, CA, November 1991.
[7]
R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Proceedings of the International Conference on Computer-Aided Design, pages 42-47, Santa Clara, CA, November 1993.
[8]
G. Kamhi and L. Fix. Adaptive variable reordering for symbolic model checking. In Proceedings of the International Conference on Computer-Aided Design, pages 359-365, San Jose, CA, November 1998.
[9]
B. Yang, R. E. Bryant, D. R. O'Hallaron, A. Biere, O. Coudert, G. Janssen, R. K. Ranjan, and F. Somenzi. A performance study of BDD-based model checking. In G. Gopalakrishnan and R Windley, editors, Formal Methods in Computer Aided Design, pages 255-289. Springer-Verlag, November 1998. LNCS 1522.
[10]
R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986.
[11]
C. Meinel and A. Slobodova. Speeding up variable reordering of OBDDs. In P1vceedings of the International Conference on Computer Design, pages 338- 343, Austin, TX, October 1997.
[12]
A. Slobodova and C. Meinel. Sample method for minimization of OBDDs. Presented at IWLS98, Lake Tahoe, CA., June 1998.
[13]
S. Panda and F. Somenzi. Who are the variables in your neighborhood. In P1vceedings of the International Conference on Computer-Aided Design, pages 74-77, San Jose, CA, November 1995.
[14]
S. Panda, F. Somenzi, and B. F. Plessier. Symmetry detection and dynamic variable ordering of decision diagrams. In P1vceedings of the International Conference on Computer-Aided Design, pages 628-631, San Jose, CA, November 1994.
[15]
R.K. Brayton et al. VIS. In Formal Methods in Computer Aided Design, pages 248-256. Springer-Verlag, Berlin, November 1996. LNCS 1166.
[16]
E Somenzi. CUDD : CU Decision Diagram Package. ftp ://vlsi.colorado.edu/pub/.
[17]
J. Desel and E. Kindler. Proving correctness of distributed algorithms using high-level Petri nets: A case study. In International Conference on Application of Concurrency to System Design, Aizu, Japan, March 1998.

Cited By

View all
  • (2006)Decomposing image computation for symbolic reachability analysis using control flow informationProceedings of the 2006 IEEE/ACM international conference on Computer-aided design10.1145/1233501.1233662(779-785)Online publication date: 5-Nov-2006

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ICCAD '99: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
November 1999
613 pages
ISBN:0780358325

Sponsors

Publisher

IEEE Press

Publication History

Published: 07 November 1999

Check for updates

Qualifiers

  • Article

Conference

ICCAD '99
Sponsor:
  • IEEE-EDS
  • SIGDA
  • IEEE-CAS
  • IEEE-CS
ICCAD '99: The International Conference on Computer Aided Design.
November 7 - 11, 1999
California, San Jose, USA

Acceptance Rates

Overall Acceptance Rate 457 of 1,762 submissions, 26%

Upcoming Conference

ICCAD '24
IEEE/ACM International Conference on Computer-Aided Design
October 27 - 31, 2024
New York , NY , USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)13
  • Downloads (Last 6 weeks)3
Reflects downloads up to 03 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2006)Decomposing image computation for symbolic reachability analysis using control flow informationProceedings of the 2006 IEEE/ACM international conference on Computer-aided design10.1145/1233501.1233662(779-785)Online publication date: 5-Nov-2006

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media