Article

Probabilistic construction and manipulation of free Boolean diagrams

Authors:

Amelia Shen,

Srinivas Devadas,

Abhijit GhoshAuthors Info & Claims

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

Pages 544 - 583

Published: 07 November 1993 Publication History

Abstract

No abstract available.

Cited By

View all

Bahar RSomenzi FRudell R(1995)Boolean techniques for low power driven re-synthesisProceedings of the 1995 IEEE/ACM international conference on Computer-aided design10.5555/224841.225079(428-432)Online publication date: 1-Dec-1995
https://dl.acm.org/doi/10.5555/224841.225079
Ashar PMalik SRudell R(1995)Fast functional simulation using branching programsProceedings of the 1995 IEEE/ACM international conference on Computer-aided design10.5555/224841.225074(408-412)Online publication date: 1-Dec-1995
https://dl.acm.org/doi/10.5555/224841.225074
Reddy SKunz WPradhan DPreas B(1995)Novel verification framework combining structural and OBDD methods in a synthesis environmentProceedings of the 32nd annual ACM/IEEE Design Automation Conference10.1145/217474.328705(414-419)Online publication date: 1-Jan-1995
https://dl.acm.org/doi/10.1145/217474.328705

Probabilistic construction and manipulation of free Boolean diagrams
1. Theory of computation

Recommendations

Probabilistic manipulation of Boolean functions using free Boolean diagrams

We propose a data structure for Boolean functions termed “the free Boolean diagram.” A free Boolean diagram allows decision vertices as in the conventional binary decision diagram, but also allows function vertices corresponding to the AND ...
Probabilistic representation and manipulation of Boolean functions using free Boolean diagrams
Symbolic Boolean manipulation with ordered binary-decision diagrams

Ordered Binary-Decision Diagrams (OBDDs) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satisfiability and equivalence straightforward. A number of operations ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

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

November 1993

781 pages

ISBN:0818644907

Chairmen:
Michael Lightner
Univ. of Colorado, Boulder
,
Jochen A. G. Jess
Eindhoven Univ. of Tech., Eindhoven, The Netherlands

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 07 November 1993

Check for updates

Qualifiers

Article

Conference

ICCAD '93

Sponsor:

SIGDA
IEEE-CS

ICCAD '93: International Conference on Computer Aided Design

November 7 - 11, 1993

California, Santa Clara, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 23 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bahar RSomenzi FRudell R(1995)Boolean techniques for low power driven re-synthesisProceedings of the 1995 IEEE/ACM international conference on Computer-aided design10.5555/224841.225079(428-432)Online publication date: 1-Dec-1995
https://dl.acm.org/doi/10.5555/224841.225079
Ashar PMalik SRudell R(1995)Fast functional simulation using branching programsProceedings of the 1995 IEEE/ACM international conference on Computer-aided design10.5555/224841.225074(408-412)Online publication date: 1-Dec-1995
https://dl.acm.org/doi/10.5555/224841.225074
Reddy SKunz WPradhan DPreas B(1995)Novel verification framework combining structural and OBDD methods in a synthesis environmentProceedings of the 32nd annual ACM/IEEE Design Automation Conference10.1145/217474.328705(414-419)Online publication date: 1-Jan-1995
https://dl.acm.org/doi/10.1145/217474.328705

Abstract

Cited By

Recommendations

Probabilistic manipulation of Boolean functions using free Boolean diagrams

Probabilistic representation and manipulation of Boolean functions using free Boolean diagrams

Symbolic Boolean manipulation with ordered binary-decision diagrams

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations