This paper presents an efficient binary decision diagram solver for live variable analysis of high level design languages like SpecC. A novel representation of the program as a global structure using efficient data structure called Binary Decision Diagrams is presented. Based on the global structure of the program, a relational framework for live variable analysis is proposed and the solver alg...

Circuit size, branching program size, and formula size of Boolean functions, denoted by C(f), BP(f), and L(f), are the most important complexity measures for Boolean functions. Often also the formula size L (f) over the restricted basis f_;^;:g is considered. It is well-known that C(f) 3BP(f), BP(f) L (f), L (f) L(f)2, and C(f) L(f) 1. These estimates are optimal. But the inequality BP(f) L(f)2...

We improve the efficiency of Sampath’s diagnoser approach by exploiting compact symbolic representations of the system and diagnoser in terms of BDDs. We show promising results on test cases derived from a telecommunication application.

A “pairing function” J associates a unique natural number z to any two natural numbers x,y such that for two “unpairing functions” K and L, the equalities K(J(x,y))=x, L(J(x,y))=y and J(K(z),L(z))=z hold. Using pairing functions on natural number representations of truth tables, we derive an encoding for Binary Decision Diagrams with the unique property that its boolean evaluation faithfully mi...

Functional symmetries provide significant benefits for multiple tasks in synthesis and verification. Many applications require the manual specification of symmetries using special language features such as symmetric data types. Methods for automatically detecting symmetries are based on functional analysis, e.g. using BDDs, or structural methods. The latter search for circuit graph automorphism...

Fractional pebbling is a generalization of black-white pebbling introduced recently. In this reasearch paper we solve an open problem by proving a tight lower bound on the pebble weight required to fractionally pebble a balanced d-ary tree of height h. This bound has close ties with branching programs and the separation of P from NL.

This paper presents a method to detect and recognize symmetries in Boolean functions. The idea is to use information theoretic measures of Boolean functions to detect sub-space of possible symmetric variables. Coupled with the new techniques of efficient estimations of information measures on Binary Decision Diagrams (BDDs) we obtain promised results in symmetries detection for large-scale func...

The problem FT h d (k) consists in computing the value in [k] = {1, . . . , k} taken by the root of a balanced d-ary tree of height h whose internal nodes are labelled with d-ary functions on [k] and whose leaves are labelled with elements of [k]. We propose FT h d (k) as a good candidate for witnessing L ( LogDCFL. We observe that the latter would follow from a proof that k-way branching progr...

In this paper we suggest a block restricted sifting strategy which is based on the restriction of Rudell s sifting to certain blocks of variables The application of this strategy results in a consider able improvement of the time performance without causing a substantial increase of OBDD size The blocks of variables were determined according to some structural properties re ecting the communi c...