Article

Free access

Partitioned ROBDDs—a compact, canonical and efficiently manipulable representation for Boolean functions

Authors:

A. Sangiovanni-VincentelliAuthors Info & Claims

ICCAD '96: Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design

Pages 547 - 554

Published: 01 January 1997 Publication History

Abstract

We present a new representation for Boolean functions called Partitioned ROBDDs. In this representation we divide the Boolean space into 'k' partitions and represent a function over each partition as a separate ROBDD. We show that partitioned-ROBDDs are canonical and can be efficiently manipulated. Further they can be exponentially more compact than monolithic ROBDDs and even free BDDs. Moreover, at any given time, only one partition needs to be manipulated which further increases the space efficiency. In addition to showing the utility of partitioned-ROBDDs on special classes of functions, we provide automatic techniques for their construction. We show that for large circuits our techniques are more efficient in space as well as time over monolithic ROBDDs. Using these techniques, some complex industrial circuits could be verified for the first time.

References

[1]

S.B. Akers. Binary decision diagrams. IEEE Transactions on Computers, C-27:509-516, June 1978.

Digital Library

[2]

E.Ashar et. al. Boolean satisfiability and equivalence checking using general binary decision diagrams. ICCD, 1991.

Digital Library

[3]

M. Blum et. al. Equivalence of free Boolean graphs can be decided probabilistically in polynomial time. Inf. Proc. Letters, 10, March 1980.

[4]

B. Bollig. Personal communication, manuscript, February 1996.

[5]

K. S. Brace, R. L. Rudell, and R. E. Bryant. Efficient Implementation of a BDD Package. In DAC, pages 40-45, June 1990.

Digital Library

[6]

R. E. Bryant. Graph-based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35:677-691, August 1986.

Digital Library

[7]

R.E. Bryant. On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans. on Comp., C-40:206-213, Feb. 1991.

Digital Library

[8]

R.E. Bryant. Binary Decision Diagrams and Beyond: Enabling Technologies for Formal Verification. In ICCAD, November 1995.

Digital Library

[9]

J.R. Burch, E. M. Clarke, and D. E. Long. Symbolic Model Checking with Partitioned Transition Relations. In DAC, pages 403-407, 1991.

Digital Library

[10]

J.R. Burch et. al. Symbolic Model Checking: 102o States and Beyond. Inf. and Comp., 98(2):142-170,1992.

Digital Library

[11]

O. Coudert et. al. Verification of Sequential Machines Based on Symbolic Execution. In Proc. of the Workshop on Automatic Verif. Methods for Finite State Systems, Grenoble, France, 1989.

Digital Library

[12]

R. Drechsler et. al. Efficient representation and manipulation of switching functions based on Ordered Kronecker Functional Decision Diagrams. In DAC, pages 415-419, 1994.

Digital Library

[13]

L. Fortune, J. Hopcroft, and E. M. Schmidt. The complexity of equivalence and containment for free single variable program schemes. Goos, Hartmanis, Ausiello and Bohm, Eds., Lecture Notes in Computer Science 62, Springer-Verlag, pages 227-240,1978.

Digital Library

[14]

J. Gergov and C. Meinel. Efficient Boolean Manipulation With OBDD's can be Extended to FBDD's. IEEE Transaction on Computers, 43(10): 1197-1209,1994.

Digital Library

[15]

J. Jain, J. Bitner, D. S. Fussell, and J. A. Abraham. Functional partitioning for verification and related problems. Brown/MIT VLSI Conference, March 1992.

[16]

J. Jain, J. Bitner, D. S. Fussell, and J. A. Abraham. Probabilistic verification of Boolean functions. Formal Methods in System Design, 1, 1992.

[17]

J. Jain, R. Mukherjee, and M. Fujita. Advanced Verification Techniques Based on Learning. In DAC, pages 420-426, June 1995.

Digital Library

[18]

J. Jain et. al. Decomposition Techniques for Efficient ROBDD Construction. In Formal Methods in CAD 96, LNCS. Springer-Verlag, 1996.

Digital Library

[19]

U. Kebschull et. al. Multilevel logic synthesis based on Functional Decision Diagrams. European DAC, pages 43-47, 1992.

[20]

S. Kimura and E. M. Clarke. A parallel algorithm for constructing binary decision diagrams. ICCD90.

[21]

S. Malik et. al. Logic Verification using Binary Decision Diagrams in a Logic Synthesis Environment. In ICCAD, pages 6-9, November 1988.

[22]

S. Minato. Zero-suppressed bdds for set manipulation in combinatorial problems. 30th DAC, 1993.

Digital Library

[23]

A. Narayan et. al. Overcoming Memory Constraints in ROBDD Construction By Functional Decomposition and Partitioning. Technical Report UCB/ERL M95/91, Electronics Research Lab, Univ. of California, Berkeley, CA 94720,1995.

[24]

A. Narayan et. al. A Study of Composition Schemes for Mixed Apply/Compose Based Construction of ROBDDs. In Proc. of the Intl. Conf. on VLSI Design, January 1996.

Digital Library

[25]

M. Rebaudengo, S. Gai, and M. Sonza Reorda. An improved data parallel algorithm for Boolean function manipulation using BDDs. Euromicro Workshop on Parallel and Distributed Processing 1995.

Digital Library

[26]

S. Reddy et. al. Novel verification framework combining structural and OBDD methods in a synthesis environment. DAC, pages 414-419, 1995.

Digital Library

[27]

R.L. Rudell. Dynamic Variable Ordering for Ordered Binary Decision Diagrams. In ICCAD, pages 42-47, November 1993.

Digital Library

[28]

E Somenzi, S. Panda, and B. Plessier. Symmetry Detection and Dynamic Variable Ordering of Decision Diagrams. In ICCAD, November 1994.

Digital Library

[29]

C.D. Thompson. Area-time complexity for VLSI. InACM STOC, 1979.

Digital Library

Cited By

Bingham JKaivola RWahl T(2015)Universal boolean functional vectorsProceedings of the 15th Conference on Formal Methods in Computer-Aided Design10.5555/2893529.2893540(25-32)Online publication date: 27-Sep-2015
https://dl.acm.org/doi/10.5555/2893529.2893540
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
Ciesielski MGomez-Prado DRen QGuillot JBoutillon E(2009)Optimization of data-flow computations using canonical TED representationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2009.202470828:9(1321-1333)Online publication date: 1-Sep-2009
https://dl.acm.org/doi/10.1109/TCAD.2009.2024708
Show More Cited By

Index Terms

Partitioned ROBDDs—a compact, canonical and efficiently manipulable representation for Boolean functions
1. Hardware

Recommendations

Look into the Mirror: Evolving Self-dual Bent Boolean Functions
Genetic Programming
Abstract
Bent Boolean functions are important objects in cryptography and coding theory, and there are several general approaches for constructing such functions. Metaheuristics proved to be a strong choice as they can provide many bent functions, even ...
Composition of Post classes and normal forms of Boolean functions

The class composition C@?K of Boolean clones, being the set of composite functions f(g"1,...,g"n) with f@?C, g"1,...,g"n@?K, is investigated. This composition C@?K is either the join C@?K in the Post Lattice or it is not a clone, and all pairs of clones ...
Boolean functions with a simple certificate for CNF complexity

In this paper we study relationships between CNF representations of a given Boolean function f and essential sets of implicates of f . It is known that every CNF representation and every essential set must intersect. Therefore the maximum number of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICCAD '96: Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design

January 1997

703 pages

ISBN:0818675977

Chairmen:
Rob A. Rutenbar
Carnegie Mellon Univ., Pittsburgh, PA
,
Ralph H. J. M. Otten
Delft Univ. of Technology, Delft, The Netherlands

Copyright © Copyright (c) 1996 Institute of Electrical and Electronics Engineers, Inc. All rights reserved.

Sponsors

SIGDA: ACM Special Interest Group on Design Automation
IEEE-CAS: Circuits & Systems
IEEE-CS: Computer Society

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 January 1997

Check for updates

Author Tags

Qualifiers

Article

Conference

ICCAD '96

Sponsor:

SIGDA
IEEE-CAS
IEEE-CS

ICCAD '96: International Conference on Computer Aided Design

November 10 - 14, 1996

California, San Jose, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

31
Total Citations
View Citations
283
Total Downloads

Downloads (Last 12 months)36
Downloads (Last 6 weeks)7

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Bingham JKaivola RWahl T(2015)Universal boolean functional vectorsProceedings of the 15th Conference on Formal Methods in Computer-Aided Design10.5555/2893529.2893540(25-32)Online publication date: 27-Sep-2015
https://dl.acm.org/doi/10.5555/2893529.2893540
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
Ciesielski MGomez-Prado DRen QGuillot JBoutillon E(2009)Optimization of data-flow computations using canonical TED representationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2009.202470828:9(1321-1333)Online publication date: 1-Sep-2009
https://dl.acm.org/doi/10.1109/TCAD.2009.2024708
Ward DSomenzi FHassoun S(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
https://dl.acm.org/doi/10.1145/1233501.1233662
Peranandam PNalla PRuf JWeiss RKropf TRosenstiel WSentovich E(2006)Fast falsification based on symbolic bounded property checkingProceedings of the 43rd annual Design Automation Conference10.1145/1146909.1147181(1077-1082)Online publication date: 24-Jul-2006
https://dl.acm.org/doi/10.1145/1146909.1147181
Ciesielski MKalla PAskar S(2006)Taylor Expansion DiagramsIEEE Transactions on Computers10.1109/TC.2006.15355:9(1188-1201)Online publication date: 1-Sep-2006
https://dl.acm.org/doi/10.1109/TC.2006.153
Nalla PWeiss RPeranandam PRuf JKropf TRosenstiel W(2006)Distributed Symbolic Bounded Property CheckingElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2005.10.018135:2(47-63)Online publication date: 1-Feb-2006
https://dl.acm.org/doi/10.1016/j.entcs.2005.10.018
Iyer SJain JSahoo DEmerson E(2006)Under-approximation Heuristics for Grid-based Bounded Model CheckingElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2005.10.017135:2(31-46)Online publication date: 1-Feb-2006
https://dl.acm.org/doi/10.1016/j.entcs.2005.10.017
Grumberg OHeyman TSchuster A(2006)A work-efficient distributed algorithm for reachability analysisFormal Methods in System Design10.1007/s10703-006-0011-429:2(157-175)Online publication date: 1-Sep-2006
https://dl.acm.org/doi/10.1007/s10703-006-0011-4
Grumberg OHeyman TSchuster A(2005)Distributed Symbolic Model Checking for μ-CalculusFormal Methods in System Design10.1007/s10703-005-1493-126:2(197-219)Online publication date: 1-Mar-2005
https://dl.acm.org/doi/10.1007/s10703-005-1493-1
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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

Media

Figures

Other

Tables

View Table of Contents