Results 11  20
of
4,066
Binary Decision Diagrams for Fault Tree Analysis
, 1996
"... Binary decision diagrams for fault tree analysis ..."
Approximation and Decomposition of Binary Decision Diagrams
, 1998
"... Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and model checking algorithms have emphasized the need for efficient algorithms for the approximation and decomposition of BDDs. ..."
Abstract

Cited by 33 (0 self)
 Add to MetaCart
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and model checking algorithms have emphasized the need for efficient algorithms for the approximation and decomposition of BDDs
Cloningbased contextsensitive pointer alias analysis using binary decision diagrams
 In Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation
, 2004
"... This paper presents the first scalable contextsensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a method for every context of interest, and run a contextinsensitive algorithm over the expanded call graph to get contexts ..."
Abstract

Cited by 311 (16 self)
 Add to MetaCart
relations can be computed efficiently using binary decision diagrams (BDDs). Key to the scalability of the technique is a context numbering scheme that exposes the commonalities across contexts. We applied our algorithm to the most popular applications available on Sourceforge, and found that the largest
Binary Decision Diagrams on Network of Workstations
 Proc. of International Conference on Computer Design (ICCD'96
, 1996
"... The success of all binary decision diagram (BDD) based synthesis and verification algorithms depend on the ability to efficiently manipulate very large BDDs. We present algorithms for manipulation of very large Binary Decision Diagrams (BDDs) on a network of workstations (NOW). ANOW provides a colle ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
The success of all binary decision diagram (BDD) based synthesis and verification algorithms depend on the ability to efficiently manipulate very large BDDs. We present algorithms for manipulation of very large Binary Decision Diagrams (BDDs) on a network of workstations (NOW). ANOW provides a
Optimal Free Binary Decision Diagrams
, 2002
"... Free binary decision diagrams (FBDDs) are graph{based data structures representing Boolean functions with a constraint (additional to binary decision diagrams) that each variable is tested during the computation at most once. The function EARn is a Boolean function on n n Boolean matrices; EARn ..."
Abstract
 Add to MetaCart
Free binary decision diagrams (FBDDs) are graph{based data structures representing Boolean functions with a constraint (additional to binary decision diagrams) that each variable is tested during the computation at most once. The function EARn is a Boolean function on n n Boolean matrices
Binary Decision Diagrams and automated
, 2004
"... Abstract This report serves as an overview of the use of Ordered Binary/Boolean Decision Diagrams (OBDDs) in automated verification. The history, key developments and current state of the problems involved will be discussed. 1 BDDs: An overview There are many ways of representing an arbitrary boolea ..."
Abstract
 Add to MetaCart
Abstract This report serves as an overview of the use of Ordered Binary/Boolean Decision Diagrams (OBDDs) in automated verification. The history, key developments and current state of the problems involved will be discussed. 1 BDDs: An overview There are many ways of representing an arbitrary
Resolution and Binary Decision Diagrams
, 2000
"... and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of ..."
Abstract
 Add to MetaCart
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Binary decision diagrams in theory and practice
, 2001
"... Decision diagrams (DDs) are the stateoftheart data structure in VLSI CAD and have been successfully applied in many other fields.DDs are widely used and are also integrated in commercial tools.This special section comprises six contributed articles on various aspects of the theory and application ..."
Abstract

Cited by 31 (7 self)
 Add to MetaCart
and application of DDs.As preparation for these contributions, the present article reviews the basic definitions of binary decision diagrams (BDDs). We provide a brief overview and study theoretical and practical aspects.Basic properties of BDDs are discussed and manipulation algorithms are described
Learning Ordered Binary Decision Diagrams
 In 6th International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence No. 997, Jantke, Shinohara, Zeugmann (Eds
, 1995
"... This note studies the learnability of ordered binary decision diagrams (obdds). We give a polynomialtime algorithm using membership and equivalence queries that finds the minimum obdd for the target respecting a given ordering. We also prove that both types of queries and the restriction to a given ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
This note studies the learnability of ordered binary decision diagrams (obdds). We give a polynomialtime algorithm using membership and equivalence queries that finds the minimum obdd for the target respecting a given ordering. We also prove that both types of queries and the restriction to a
of Boolean functions. In contrast to Ordered Binary Decision Diagrams
"... Abstract: Free Binary Decision Diagrams (FBDDs) are a data structure for the representation ..."
Abstract
 Add to MetaCart
Abstract: Free Binary Decision Diagrams (FBDDs) are a data structure for the representation
Results 11  20
of
4,066